Preemptive scheduling of periodic jobs in uniform multiprocessor systems

DOI10.1016/0020-0190(83)90002-9zbMath0501.68010OpenAlexW2027291980MaRDI QIDQ1172385

Maurizio A. Bonuccelli, Alan A. Bertossi

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90002-9

zbMATH Keywords

time complexitytime-critical process controluniform processors

Mathematics Subject Classification ID

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

Related Items (2)

Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems ⋮ A polynomial feasibility test for preemptive periodic scheduling of unrelated processors

Cites Work

• Scheduling periodically occurring tasks on multiple processors
• A Level Algorithm for Preemptive Scheduling
• Preemptive Scheduling of Uniform Processor Systems
• On a Real-Time Scheduling Problem
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Preemptive scheduling of periodic jobs in uniform multiprocessor systems