The Community for Technology Leaders
2012 IEEE 26th International Conference on Advanced Information Networking and Applications (2012)
Fukuoka-shi, Japan
Mar. 26, 2012 to Mar. 29, 2012
ISSN: 1550-445X
ISBN: 978-0-7695-4651-3
pp: 253-260
In a real-time database system for detection of critical events, meeting the deadlines of the application transactions and maintaining the quality of the real-time data objects are two critical issues in ensuring the effectiveness of performing the real-time monitoring tasks. Unfortunately, these two goals conflict with each other and are difficult to be achieved at the same time. To address this update and application transaction co-scheduling problem, in this paper, we propose a fixed priority scheduling algorithm called Periodic Co-Scheduling (PCS). PCS uses periodic update transactions to maintain the temporal validity of real-time data objects. It judiciously decides the priority order among all the update and application transactions so that the constructed co-schedule can satisfy the deadline constraints of all the application transactions while maximizing the qualities of the real-time data objects. The effectiveness of the PCS algorithm is validated through our extensive simulation experiments.
Co-scheduling, Real-time data monitoring, Quality of data (QoD), Critical events

S. Han, K. Lam, S. H. Son, J. Wang and A. K. Mok, "On Co-scheduling of Periodic Update and Application Transactions with Fixed Priority Assignment for Real-Time Monitoring," 2012 IEEE 26th International Conference on Advanced Information Networking and Applications(AINA), Fukuoka-shi, Japan, 2012, pp. 253-260.
95 ms
(Ver 3.3 (11022016))