On the tractability of digraph-based task models

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 2011, Pages 162-171

  Stigge, Martin ^a   Ekberg, Pontus ^a   Guan, Nan ^a   Yi, Wang ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

feasibility; real time task models; schedulability; tractability

Indexed keywords

FEASIBILITY; FEASIBILITY ANALYSIS; FEASIBILITY PROBLEM; FORMAL ANALYSIS; GLOBAL CONSTRAINTS; PERIODIC TASKS; REAL-TIME TASKS; SCHEDULABILITY; SYSTEM MODELS; TASK MODELS; TIMING CONSTRAINTS; TRACTABILITY; UNIPROCESSORS;

GRAPH THEORY; TIMING CIRCUITS;

REAL TIME SYSTEMS;

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

References (8)

1. C. L. Liu and J. W. Layland, "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment," J. ACM, vol. 20, no. 1, pp. 46-61, 1973.
2. M. Stigge, P. Ekberg, N. Guan, and W. Yi, "The Digraph Real-Time Task Model," in Proc. of RTAS 2011, pp. 71-80.
3. S. Baruah, D. Chen, S. Gorinsky, and A. Mok, "Generalized multiframe tasks," Real-Time Syst., vol. 17, no. 1, pp. 5-22, 1999.
4. S. K. Baruah, "Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks," Real-Time Syst., vol. 24, no. 1, pp. 93-128, 2003.
5. E. Fersman, P. Krcal, P. Pettersson, and W. Yi, "Task automata: Schedulability, decidability and undecidability," Inf. Comput., vol. 205, no. 8, pp. 1149-1172, 2007.
6. M. Anand, A. Easwaran, S. Fischmeister, and I. Lee, "Compositional Feasibility Analysis of Conditional Real-Time Task Models," in Proc. of ISORC 2008, pp. 391-398.
7. F. Eisenbrand and T. Rothvoß, "EDF-schedulability of synchronous periodic task systems is coNP-hard," in Proc. of SODA 2010, pp. 1029-1034.
8. R. Karp, "Reducibility Among Combinatorial Problems," in Complexity of Computer Computations, R. Miller and J. Thatcher, Eds. Plenum Press, 1972, pp. 85-103.