Feasibility problems for recurring tasks on one processor

DOI10.1016/0304-3975(93)90360-6MaRDI QIDQ688715zbMATH OpenOpenAlexFDO

Authors 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

schedulingdeadline algorithmperiodic tasksporadic task

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Dynamic- and static-priority scheduling of recurring real-time tasks
• scientific article; zbMATH DE number 4215346
• Algorithms and complexity for periodic real-time scheduling

Cites work

• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A new algorithm for scheduling periodic, real-time tasks
• A note on preemptive scheduling of periodic, real-time tasks
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Scheduling periodically occurring tasks on multiple processors
• The complexity of theorem-proving procedures

Cited in

(10)

• Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
• A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
• A bandwidth allocation scheme for compositional real-time systems with periodic resources
• Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems
• Dynamic- and static-priority scheduling of recurring real-time tasks
• scientific article; zbMATH DE number 1949648 (Why is no real title available?)
• A constant-approximate feasibility test for multiprocessor real-time scheduling
• A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm
• scientific article; zbMATH DE number 1247723 (Why is no real title available?)
• Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme

This page was built for publication: Feasibility problems for recurring tasks on one processor

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