A polynomial feasibility test for preemptive periodic scheduling of unrelated processors

DOI10.1016/0166-218X(85)90024-1zbMath0581.68036OpenAlexW2000817896MaRDI QIDQ1067785

Alan A. Bertossi, Maurizio A. Bonuccelli

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(85)90024-1

zbMATH Keywords

preemptive schedulingsystem of linear inequalitiesfeasible scheduleperiodically occurring jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Rate-monotonic scheduling for hard-real-time systems

Cites Work

• A new polynomial-time algorithm for linear programming
• Scheduling periodically occurring tasks on multiple processors
• A note on preemptive scheduling of periodic, real-time tasks
• Preemptive scheduling of periodic jobs in uniform multiprocessor systems
• Open Shop Scheduling to Minimize Finish Time
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• The NP-completeness column: An ongoing guide
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: A polynomial feasibility test for preemptive periodic scheduling of unrelated processors