Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness

DOI10.1016/S0166-218X(96)00035-2zbMath0863.68016WikidataQ57387858 ScholiaQ57387858MaRDI QIDQ5961604

Lucio Bianco, Maciej Drozdowski, Paolo Dell'Olmo, Jacek Błażewicz

Publication date: 22 May 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

schedulinglinear time algorithms

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Multiprocessor scheduling with communication delays
• Scheduling subject to resource constraints: Classification and complexity
• The complexity of scheduling independent two-processor tasks on dedicated processors
• Scheduling multiprocessor tasks on three dedicated processors
• Scheduling parallel I/O operations in multiple bus systems
• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Complexity of Scheduling Parallel Task Systems
• Concurrent Task Systems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling preemptive multiprocessor tasks on dedicated processors