Scheduling periodically occurring tasks on multiple processors

DOI10.1016/0020-0190(81)90066-1zbMath0454.68018OpenAlexW2071701263MaRDI QIDQ1149764

Charles U. Martel, Eugene L. Lawler

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90066-1

zbMATH Keywords

preemptive schedulingparallel processorscyclic scheduling

Mathematics Subject Classification ID

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

Related Items (10)

MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling ⋮ Schedulers for larger classes of pinwheel instances ⋮ A new algorithm for scheduling periodic, real-time tasks ⋮ Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems ⋮ Preemptive scheduling of periodic jobs in uniform multiprocessor systems ⋮ Feasibility problems for recurring tasks on one processor ⋮ Feasibility analysis under fixed priority scheduling with limited preemptions ⋮ Real-time task scheduling for energy-aware embedded systems ⋮ The basic cyclic scheduling problem with deadlines ⋮ A polynomial feasibility test for preemptive periodic scheduling of unrelated processors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on preemptive scheduling of periodic, real-time tasks
• Open Shop Scheduling to Minimize Finish Time
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Some simple scheduling algorithms

This page was built for publication: Scheduling periodically occurring tasks on multiple processors