Preemptive scheduling of periodic jobs in uniform multiprocessor systems

DOI10.1016/0020-0190(83)90002-9MaRDI QIDQ1172385zbMATH OpenOpenAlexFDO

Authors Alan A. Bertossi, Maurizio A. Bonuccelli

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)

Recommendations

• Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints
• Preemptive Scheduling of Uniform Processor Systems
• scientific article; zbMATH DE number 3883931
• Preemptive scheduling on uniform machines to minimize mean flow time
• Scheduling Periodic Tasks

Cites work

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

Cited in

(12)

• A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
• Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
• Preemptive multiprocessor task scheduling with release times and time windows
• Scheduling periodic tasks on uniform multiprocessors
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• Line search method for solving a non-preemptive strictly periodic scheduling problem
• Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
• Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints
• scientific article; zbMATH DE number 108489 (Why is no real title available?)
• Preemptive Scheduling of Uniform Processor Systems
• Cutting-plane algorithms for preemptive uniprocessor scheduling problems

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

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