Feasibility problems for recurring tasks on one processor

DOI10.1016/0304-3975(93)90360-6zbMath0781.68029MaRDI QIDQ688715

Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier

Publication date: 6 December 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90360-6

zbMATH Keywords

scheduling; deadline algorithm; periodic task; sporadic task

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

Related Items

Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme, A bandwidth allocation scheme for compositional real-time systems with periodic resources, Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible, A constant-approximate feasibility test for multiprocessor real-time scheduling, A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm, A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new algorithm for scheduling periodic, real-time tasks
• Scheduling periodically occurring tasks on multiple processors
• A note on preemptive scheduling of periodic, real-time tasks
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• The complexity of theorem-proving procedures
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment