Real-time scheduling of linear speedup parallel tasks

DOI10.1016/0020-0190(95)00174-3zbMath0900.68040OpenAlexW2047379384MaRDI QIDQ1350756

Maciej Drozdowski

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00174-3

zbMATH Keywords

Parallel processingPreemptive schedulingParallel tasks

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)

Related Items

Efficient approximation algorithms for scheduling moldable tasks, Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires, Global EDF scheduling for parallel real-time tasks, Multi-core real-time scheduling for generalized parallel task models, New applications of the Muntz and Coffman algorithm, Malleable scheduling for flows of jobs and applications to MapReduce, Scheduling multiprocessor tasks -- An overview

Cites Work

• Unnamed Item
• Multiprocessor scheduling with communication delays
• Scheduling with Deadlines and Loss Functions
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Complexity of Scheduling Parallel Task Systems
• Application scheduling and processor allocation in multiprogrammed parallel processing systems
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems