Provable algorithms for parallel generalized sweep scheduling

DOI10.1016/J.JPDC.2006.02.003MaRDI QIDQ2495501zbMATH OpenOpenAlexFDO

Authors V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan, Sibylle Zust

Publication date 30 June 2006

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2006.02.003

zbMATH Keywords

approximation algorithmsparallel algorithmsminimum makespan schedulingsweep scheduling on meshes

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Parallel algorithms in computer science (68W10)

Recommendations

• Synchronized sweep algorithms for scalable scheduling constraints
• Approximation algorithms for general parallel task scheduling
• Parallel algorithms for solution of problems in scheduling theory
• Sequential and parallel computations in the general scheduling problem
• scientific article; zbMATH DE number 1760037
• scientific article; zbMATH DE number 4037590
• scientific article; zbMATH DE number 1696564
• Proportional scheduling, split-proofness, and merge-proofness
• Approximation algorithms for scheduling parallel jobs

Cited in

(4)

• Relaxed schedulers can efficiently parallelize iterative algorithms
• Proportional scheduling, split-proofness, and merge-proofness
• Chaotic Iterations for S_N Transport
• Extending IC-scheduling via the sweep algorithm

This page was built for publication: Provable algorithms for parallel generalized sweep scheduling

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