On the complexity of scheduling conditional real-time code

DOI10.1007/3-540-44634-6_5MaRDI QIDQ4778541zbMATH OpenFDO

Authors Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele

Publication date 18 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2125/21250038, http://hdl.handle.net/20.500.11850/145797

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Algorithms and complexity for periodic real-time scheduling
• Algorithms and complexity for periodic real-time scheduling
• scientific article; zbMATH DE number 4215346

Cited in

(8)

• Static priority scheduling of event-triggered real-time embedded systems
• Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
• Quasi-Static Scheduling of Communicating Tasks
• Graph-based models for real-time workload: a survey
• Two coNP-complete schedule analysis problems
• Feasibility Analysis of Conditional DAG Tasks
• Combinatorial abstraction refinement for feasibility analysis of static priorities
• GPU-based acceleration of system-level design tasks

This page was built for publication: On the complexity of scheduling conditional real-time code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778541)