Unconstrained static scheduling with communication weights

DOI10.1002/JOS.114zbMath1014.90041OpenAlexW2075480728MaRDI QIDQ1850709

Vivek Sarkar

Publication date: 17 December 2002

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jos.114

zbMATH Keywords

schedulinggreedy-merge clustering algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Multiprocessor scheduling with communication delays
• List scheduling with and without communication delays
• Optimal partitioning of randomly generated distributed programs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Complexity of Scheduling Trees with Communication Delays
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Unconstrained static scheduling with communication weights