On non-utilization bounds for arbitrary fixed priority policies

Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS

Volumn 2006, Issue , 2006, Pages 167-176

  Liu, Xue ^a   Abdelzaher, Tarek ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Aperiodic tasks; Real time scheduling; Schedulability analysis; Utilization bounds

Indexed keywords

APERIODIC TASKS; REAL-TIME SCHEDULING; SCHEDULABILITY ANALYSIS; UTILIZATION BOUNDS;

REAL TIME SYSTEMS; RESOURCE ALLOCATION; SCHEDULING;

COMPUTER SCIENCE;

EID: 33749601273     PISSN: 15453421     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTAS.2006.32     Document Type: Conference Paper

References (17)

1. T. Abdelzaher and V. Sharma. A synthetic utilization bound for aperiodic tasks with resource requirements. In 15th Euromicro Conference on Real-Time Systems, Porto, Portugal, July 2003.
2. T. Abdelzaher, G. Thaker, and P. Lardieri. A feasible region for meeting aperiodic end-to-end deadlines in resource pipelines. In International Conference on Distributed Computing Systems, Tokyo, Japan, March 2004.
3. T. F. Abdelzaher and C. Lu. Schedulability analysis and utilization bounds for highly scalable real-time services. In IEEE Real-Time Technology and Applications Symposium, TaiPei, Taiwan, June 2001.
4. B. Andersson and C. Ekelin. Exact admission-control for integrated aperiodic and periodic tasks. In Real-Time and Embedded Technology and Applications Symposium, San Francisco, California, March 2005.
5. E. Bini, G. Buttazzo, and G. Buttazzo. A hyperbolic bound for the rate monotonie algorithm. In 13th Euromicro Conference on Real-Time Systems, Delft, Netherlands, June 2001.
6. M. Caccamo and L. Sha. Aperiodic servers with resource constraints. In IEEE Real-Time Systems Symposium, London, England, December 2001.
7. X. Chen and P. Mohapatra. Lifetime behavior and its impact on web caching. In IEEE Workshop on Internet Applications, 1999.
8. C.-C. Han. A better polynomial-time schedulability test for real-time multiframe tasks. In 19th IEEE Real-Time Systems Symposium, pages 104-113, Madrid, Spain, December 1998.
9. J.-C. L. Jianjia Wu and W. Zhao. On schedulability bounds of static priority schedulers. In Real-Time and Embedded Technology and Applications Symposium, San Francisco, California, March 2005.
10. T. W. Kuo and A. K. Mok. Load adjustment in adaptive real-time systems. In IEEE Real-Time Systems Symposium, December 1991.
11. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. of ACM, 20(1):46-61, 1973.
12. A. K. Mok and D. Chen. A multiframe model for real-time tasks. IEEE Transactions on Software Engineering, 23(10):635-645, October 1997.
13. M. Pandya and M. Malek. Minimum achievable utilization for fault-tolerant processing of periodic tasks. IEEE Transactions on Computers, 47(10):1102-1112, October 1998.
14. D.-W. Park, S. Natarajan, and A. Kanevsky. Fixed-priority scheduling of real-time systems using utilization bounds. Journal of Systems and Software, 33(1):57-63, April 1996.
15. W. K. Shih, J. Liu, and C. L. Liu. Modified rate-monotonic algorithm for scheduling periodic jobs with deferred deadlines. IEEE Transactions on Software Engineering, 19(12):1171-1179, December 1993.
16. J. K. Strosnider, J. P. Lehoczky, and L. Sha. The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments. IEEE Transactions on Computers, 44(1):73-91, January 1995.
17. S. R. Thuel and J. P. Lehoczky. Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealing. In Real-Time Systems Symposium, pages 22-33, San Juan, Puerto Rico, December 1994.