Resource augmentation bounds for approximate demand bound functions

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2011, Pages 272-281

  Chen, Jian Jia ^a   Chakraborty, Samarjit ^b  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Approximate demand bound function; Approximation; DBF; Resource augmentation; Schedulability analysis

Indexed keywords

APPROXIMATION; BOUND FUNCTION; DBF; RESOURCE AUGMENTATION; SCHEDULABILITY ANALYSIS;

MULTIPROCESSING SYSTEMS;

REAL TIME SYSTEMS;

EID: 84863048553     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2011.32     Document Type: Conference Paper

References (13)

1. K. Albers and F. Slomka. An event stream driven approximation for the analysis of real-time systems. In ECRTS, pages 187-195, 2004.
2. K. Albers and F. Slomka. Efficient feasibility analysis for real-time systems with edf scheduling. In DATE, pages 492-497, 2005.
3. S. K. Baruah and N. Fisher. The partitioned multiprocessor scheduling of sporadic task systems. In RTSS, pages 321-329, 2005.
4. S. K. Baruah and N. Fisher. The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems. IEEE Trans. Computers, 55(7):918-923, 2006. (Pubitemid 43834524)
5. S. K. Baruah, A. K. Mok, and L. E. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. In IEEE Real-Time Systems Symposium, pages 182-190, 1990.
6. S. Chakraborty, S. Künzli, and L. Thiele. Approximate schedulability analysis. In IEEE Real-Time Systems Symposium, pages 159-168, 2002.
7. R. Davis and A. Burns. A survey of hard real-time scheduling algorithms and schedulability analysis techniques for multiprocessor systems. techreport YCS-2009-443, University of York, Department of Computer Science, 2009.
8. F. Eisenbrand and T. Rothvoß. Edf-schedulability of synchronous periodic task systems is conp-hard. In SODA, pages 1029-1034, 2010.
9. N. W. Fisher. How hard is partitioning for the sporadic task model? In Proceedings of the 2009 International Conference on Parallel Processing Workshops, ICPPW '09, pages 2-5, 2009.
10. R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17(2):416-429, 1969.
11. D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM, 34(1):144-162, 1987.
12. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1):46-61, 1973.
13. A. K. Mok. Fundamental design problems of distributed systems for the hard-real-time environment. Technical report, Cambridge, MA, USA, 1983.