Unconstrained static scheduling with communication weights

DOI10.1002/JOS.114zbMATH Open1014.90041OpenAlexW2075480728MaRDI QIDQ1850709FDOQ1850709

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1185302
• Task scheduling with and without communication delays: A unified approach
• List scheduling with and without communication delays
• Complexity of Task Graph Scheduling with Fixed Communication Capacity
• A heuristic for scheduling task graphs with communication delays onto multiprocessors

zbMATH Keywords

schedulinggreedy-merge clustering algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (2)

• Scheduling on Two Unbounded Resources with Communication Costs
• List scheduling with and without communication delays

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

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