Constant-time admission control for partitioned EDF

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 2010, Pages 34-43

  Masrur, Alejandro ^a   Chakraborty, Samarjit ^a   Färber, Georg ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADMISSION CONTROL; ADMISSION CONTROL DECISION; ADMISSION CONTROL TESTS; EARLIEST DEADLINE FIRST; EFFICIENT ALGORITHM; POLYNOMIAL-TIME; REAL-TIME MULTIMEDIA SERVERS; RUNNING TASKS; SCHEDULABILITY TEST; TASK ACTIVATIONS;

RESPONSE TIME (COMPUTER SYSTEMS); TESTING;

REAL TIME SYSTEMS;

EID: 77958509539     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECRTS.2010.30     Document Type: Conference Paper

References (21)

1. K. Albers and F. Slomka. An event stream driven approximation for the analysis of real-time systems. Proceedings of the 16th Euromicro Conference on Real-Time Systems, June 2004.
2. K. Albers and F. Slomka. Efficient feasibility analysis for real-time systems with EDF scheduling. Proceedings of the DATE 05 Conference, March 2005.
3. S. Baruah and N. Fisher. The partitioned multiprocessor scheduling of sporadic task systems. Proceedings of the 26th Real-Time Systems Symposium, pages 321-329, December 2005.
4. S. Baruah and N. Fisher. The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems. IEEE Transactions on Computers, 55(7):918-923, 2006.
5. S. Baruah and N. Fisher. The partitioned dynamic-priority scheduling of sporadic task systems. Real-Time Systems, 36(3):199-226, 2007.
6. S. Baruah, A. Mok, and L. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. Proceedings of the 11th IEEE Real-Time Systems Symposium, December 1990.
7. S. Baruah, L. Rosier, and R. Howell. Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor. Real-Time Systems, 2(4):301-324, November 1990.
8. E. Bini and G. Buttazzo. Biasing effects in schedulability measures. In Proceedings of the 16th Euromicro Conference on Real-Time Systems, June-July 2004.
9. E. Bini and G. Buttazzo. Measuring the performance of schedulability tests. Real-Time Systems, 30(1-2):129-154, 2005.
10. S. Chakraborty, S. K̈unzli, and L. Thiele. Approximate schedulability analysis. Proceedings of the 23rd IEEE Real-Time Systems Symposium, December 2002.
11. M. Devi. An improved schedulability test for uniprocessor periodic task systems. Proceedings of the 15th Euromicro Conference on Real-Time Systems, July 2003.
12. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., San Francisco, USA, 1979.
13. D. Johnson. Near-Optimal Bin Packing Algorithms. Massachusetts Institute of Technology (MIT), Department of Mathematics, Cambridge, USA, 1973. Ph.D. Thesis.
14. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in hard real-time environments. Journal of the Association for Computing Machinery, 20(1):40-61, 1973.
15. J. Liu. Real-Time Systems. Prentice Hall, 2000.
16. J. López, J. Díaz, and D. García. Utilization bounds for EDF scheduling on real-time multiprocessor systems. Real-Time Systems, 28(1):39-68, 2004.
17. J. López, M. García, J. Díaz, and D. García. Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems. Proceedings of the 12th Euromicro Conference on Real-Time Systems (ECRTS), pages 25-33, June 2000.
18. A. Masrur, S. Dr̈ossler, and G. F̈arber. Improvements in polynomial-time feasibility testing for EDF. Proceedings of the DATE 08 Conference, March 2008.
19. A. Ripoll, I. Crespo and A. Mok. Improvement in feasibility testing for real-time tasks. Real-Time Systems, 11(1):19-39, 1996.
20. J. Stankovic, M. Spuri, K. Ramamritham, and G. Buttazzo. Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms. Kluwer, Dordrecht, The Netherlands, 1998.
21. http://ziyang.eecs.umich.edu/-dickrp/e3s/.