Compositional real-time scheduling framework

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2004, Pages 57-67

  Shin, Insik ^a   Lee, Insup ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPONENT-BASED DESIGN; REAL-TIME SCHEDULING; SCHEDULING FRAMEWORKS; TIMING CONSTRAINTS;

ABSTRACTING; ALGORITHMS; COMPUTER SIMULATION; INTERFACES (COMPUTER); LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; RESOURCE ALLOCATION; SCHEDULING;

REAL TIME SYSTEMS;

EID: 21644439131     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/REAL.2004.15     Document Type: Conference Paper

References (18)

1. L. Almeida and P. Pedreiras. Scheduling within temporal partitions: response-time analysis and server design. In Proc. of the Fourth ACM International Conference on Embedded Software, September 2004.
2. S. Baruah, A. Mok, and L. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proc. of IEEE Real-Time Systems Symposium, pages 182-190, December 1990.
3. G. Bernat, A. Burns, and A Llamosi. Weakly hard real-time systems. IEEE Transactions on Computers, 50(4):308-321, 2001.
4. Z. Deng and J. W.-S. Liu. Scheduling real-time applications in an open environment. In Proc. of IEEE Real-Time Systems Symposium, pages 308-319, December 1997.
5. X. Feng and A. Mok. A model of hierarchical real-time virtual resources. In Proc. of IEEE Real-Time Systems Symposium, pages 26-35, December 2002.
6. M. Hamdaoui and P. Ramanathan. A dynamic priority assignment technique for streams with (m, k)firm deadlines. IEEE Transactions on Computers, 44(12):1443-1451, 1995.
7. T.-W. Kuo and C.H. Li. A fixed-priority-driven open environment for real-time applications. In Proc. of IEEE Real-Time Systems Symposium, pages 256-267, December 1999.
8. J. Lehoczky, L. Sha, and J.K. Strosnider. Enhanced aperiodic responsiveness in hard-real-time environments. In Proc. of IEEE Real-Time Systems Symposium, pages 261-270, 1987.
9. J.Y.T. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation, 2:37-250, 1982.
10. G. Lipari and S. Baruah. A hierarchical extension to the constant bandwidth server framework. In Proc. of IEEE Real-Time Technology and Applications Symposium, pages 26-35, May 2001.
11. G. Lipari and E. Bini. Resource partitioning among real-time applications. In Proc. of Euromicro Conference on Real-Time Systems, July 2003.
12. C.L. Liu and J.W. Layland. Scheduling algorithms for multi-programming in a hard-real-time environment. Journal of the ACM, 20(1):46 - 61, 1973.
13. A. Mok, X. Feng, and D. Chen. Resource partition for real-time systems. In Proc. of IEEE Real-Time Technology and Applications Symposium, pages 75- 84, May 2001.
14. A.K. Mok and X. Feng. Towards compositionality in real-time resource partitioning based on regularity bounds. In Proc. of IEEE Real-Time Systems Symposium, pages 129-138, December 2001.
15. J. Regehr and J. Stankovic. HLS: A framework for composing soft real-time schedulers. In Proc. of IEEE Real-Time Systems Symposium, pages 3-14, December 2001.
16. S. Saewong, R. Rajkumar, J.P. Lehoczky, and M.H. Klein. Analysis of hierarchical fixed-priority scheduling. In Proc. of Euromicro Conference on Real-Time Systems, June 2002.
17. I. Shin and I. Lee. Periodic resource model for compositional real-time guarantees. In Proc. of IEEE Real-Time Systems Symposium, pages 2-14, December 2003.
18. I. Shin and I. Lee. Compositional Real-Time Scheduling Framework. Technical report, MS-CIS-04-20, University of Pennsylvania, 2004.