On the complexity of scheduling conditional real-time code

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2125, Issue , 2001, Pages 38-49

  Chakraborty, Samarjit ^a   Erlebach, Thomas ^a   Thiele, Lothar ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; CODES (SYMBOLS); DATA STRUCTURES; DIRECTED GRAPHS; EMBEDDED SYSTEMS; GRAPH THEORY; INTERACTIVE COMPUTER SYSTEMS; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

CONDITIONAL BRANCH; DIRECTED ACYCLIC GRAPH (DAG); EXPONENTIAL COMPLEXITY; FEASIBILITY ANALYSIS; FEASIBILITY TESTING; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; PSEUDO-POLYNOMIAL TIME ALGORITHMS; REAL-TIME EMBEDDED SYSTEMS;

REAL TIME SYSTEMS;

EID: 84958042785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_5     Document Type: Conference Paper

References (9)

1. N.C. Audsley, K.W. Tindell, and A. Burns. The end of the line for static cyclic scheduling? In Proc. Euromicro Conf. on Real-Time Systems, Finland, 1993. IEEE Computer Society Press.
2. S. Baruah. Dynamic- and static-priority scheduling of recurring real-time tasks. To appear in Real-Time Systems.
3. S. Baruah. Feasibility analysis of recurring branching tasks. In Proc. 10th Euromicro Workshop on Real-Time Systems, pages 138–145, 1998.
4. S. Baruah. A general model for recurring real-time tasks. In Proc. Real-Time Systems Symposium, pages 114–122. IEEE Computer Society Press, 1998.
5. S. Baruah, D. Chen, S. Gorinsky, and A.K. Mok. Generalized multiframe tasks. Real-Time Systems, 17(1):5–22, 1999.
6. S. Baruah, R.R. Howell, and L.E. Rosier. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems, 2:301–324, 1990.
7. S. Chakraborty, T. Erlebach, and L. Thiele. On the complexity of scheduling conditional real-time code. Technical Report TIK Report No. 107, ETH Zürich, 2001. ftp://ftp.tik.ee.ethz.ch/pub/people/samarjit/paper/CET01a.ps.gz.
8. A.K. Mok. Fundamental Design Problems of Distributed Systems for the Hard- Real-Time Environment. PhD thesis, Laboratory for Computer Science, MIT, 1983. Available as Technical Report No. MIT/LCS/TR-297.
9. A.K. Mok and D. Chen. A multiframe model for real-time tasks. IEEE Transactions on Software Engineering, 23(10):635–645, 1997.