Using duplication for scheduling unitary tasks on m processors with unit communication delays

DOI10.1016/S0304-3975(97)88194-7zbMath0901.68014MaRDI QIDQ1391530

Alix Munier, Claire Hanen

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

schedulingmakespancommunication delayslist scheduling algorithm

Mathematics Subject Classification ID

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

Related Items (5)

A branch and bound algorithm for the cyclic job-shop problem with transportation ⋮ Unnamed Item ⋮ The robust cyclic job shop problem ⋮ Complexity and approximation for precedence constrained scheduling problems with large communication delays ⋮ An EPTAS for scheduling fork-join graphs with communication delay

Cites Work

• Multiprocessor scheduling with communication delays
• UET scheduling with unit interprocessor communication delays
• New complexity results on scheduling with small communication delays
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• C.P.M. Scheduling with Small Communication Delays and Task Duplication
• Bounds on Multiprocessing Timing Anomalies
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays

This page was built for publication: Using duplication for scheduling unitary tasks on m processors with unit communication delays