Feasibility problems for recurring tasks on one processor

DOI10.1016/0304-3975(93)90360-6zbMATH Open0781.68029OpenAlexW2009415693MaRDI QIDQ688715FDOQ688715

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

Recommendations

• Feasibility analysis of sporadic real-time multiprocessor task systems
• Feasibility analysis of sporadic real-time multiprocessor task systems
• Dynamic- and static-priority scheduling of recurring real-time tasks
• scientific article; zbMATH DE number 4215346
• Algorithms and complexity for periodic real-time scheduling

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• 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
• A new algorithm for scheduling periodic, real-time tasks
• Scheduling periodically occurring tasks on multiple processors

Cited In (9)

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

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)