12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06) (2006)
Aug. 16, 2006 to Aug. 18, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.2006.26
Ming Xiong , Lucent Bell Labs
Song Han , City University of Hong Kong
Deji Chen , Emerson Process Management
The deferrable scheduling algorithm for fixed priority transactions (DS-FP)  is demonstrated to be a very effective approach for minimizing real-time update transaction workload while maintaining temporal validity of real-time data. This paper examines the schedulability of deferrable scheduling and presents a sufficient condition. While its on-line scheduling overhead is a concern, we propose a hyperperiod based DS-FP approach satisfying the temporal validity constraint with low overhead. The algorithm, namely DEferrable Scheduling with Hyperperiod by Schedule Adjustment (DESH-SA), adjusts the DS-FP schedule in an interval so that the adjusted schedule in the interval can be repeated infinitely. Our experiments demonstrate that DESH-SA can reduce scheduling overhead of DS-FP and also achieve update workload near optimal.
S. Han, D. Chen and M. Xiong, "Deferrable Scheduling for Temporal Consistency: Schedulability Analysis and Overhead Reduction," 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)(RTCSA), Sydney, Australia, 2006, pp. 117-124.