Feasibility analysis in the sporadic DAG task model

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 2013, Pages 225-233

  Bonifaci, Vincenzo ^a   Marchetti Spaccamela, Alberto ^b   Stiller, Sebastian ^c   Wiese, Andreas ^d  

^a CNR   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^d MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

DAG model; Deadline Monotonic; Earliest Deadline First; schedulability; speedup bound

Indexed keywords

ALGORITHMIC TECHNIQUES; BEST-KNOWN ALGORITHMS; DEAD-LINE MONOTONIC; EARLIEST DEADLINE FIRST; FEASIBILITY ANALYSIS; PRECEDENCE CONSTRAINTS; SCHEDULABILITY; SPEEDUP BOUND;

ALGORITHMS; DIRECTED GRAPHS; REAL TIME SYSTEMS;

RESPONSE TIME (COMPUTER SYSTEMS);

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

References (16)

1. B. Andersson and D. de Niz. Analyzing Global-EDF for multiprocessor scheduling of parallel tasks. In Proceedings of the 16th Int. Conf. on Principles of Distributed Systems, pages 16-30. Springer, 2012.
2. S. K. Baruah, V. Bonifaci, A. Marchetti-Spaccamela, and S. Stiller. Improved multiprocessor global schedulability analysis. Real-Time Systems, 46(1):3-24, 2010.
3. S. K. Baruah, V. Bonifaci, A. Marchetti-Spaccamela, L. Stougie, and A. Wiese. A generalized parallel task model for recurrent real-time processes. In Proceedings of the IEEE Real-Time Systems Symposium, pages 63-72. IEEE, Los Alamitos, CA, 2012.
4. V. Bonifaci, A. Marchetti-Spaccamela, and S. Stiller. A constantapproximate feasibility test for multiprocessor real-time scheduling. Algorithmica, 62(3-4):1034-1049, 2012.
5. M. L. Dertouzos. Control robotics: The procedural control of physical processes. In Proceedings of the Int. Federation for Information Processing Congress, pages 807-813. North-Holland, Amsterdam, 1974.
6. K. Lakshmanan, S. Kato, and R. Rajkumar. Scheduling parallel realtime tasks on multi-core processors. In Proceedings of the IEEE Real-Time Systems Symposium, pages 259-268. IEEE, Los Alamitos, CA, 2010.
7. J. Y.-T. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform. Eval., 2(4):237-250, 1982.
8. C. L. Liu. Scheduling algorithms for hard real-time programming of a single processor. JPL Space Programs Summary, 37-60(II):31-37, 1969.
9. C. L. Liu. Scheduling algorithms for multiprocessors in a hard real-time environment. JPL Space Programs Summary, 37-60(II):28-31, 1969.
10. 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.
11. G. Nelissen, V. Berten, J. Goossens, and D. Milojevic. Techniques optimizing the number of processors to schedule multi-threaded tasks. In Proceedings of the Euromicro Conf. on Real-Time Systems, pages 321-330, 2012.
12. C. A. Phillips, C. Stein, E. Torng, and J. Wein. Optimal time-critical scheduling via resource augmentation. Algorithmica, 32(2):163-200, 2002.
13. A. Saifullah, K. Agrawal, C. Lu, and C. D. Gill. Multi-core real-time scheduling for generalized parallel task models. In Proceedings of the IEEE Real-Time Systems Symposium, pages 217-226. IEEE, Los Alamitos, CA, 2011.
14. M. Stigge, P. Ekberg, N. Guan, and W. Yi. The digraph real-time task model. In Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, pages 71-80. IEEE, Los Alamitos, CA, 2011.
15. M. Stigge, P. Ekberg, N. Guan, andW. Yi. On the tractability of digraphbased task models. In Proceedings of the Euromicro Conference on Real-Time Systems, pages 162-171. IEEE, Los Alamitos, CA, 2011.
16. J. D. Ullman. NP-complete scheduling problems. Journal of Computer and Systems Sciences, 10(3):384-393, 1975.