Unconstrained static scheduling with communication weights

DOI10.1002/JOS.114MaRDI QIDQ1850709zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

greedy-merge clustering algorithmscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cites work

• Bounds on Multiprocessing Timing Anomalies
• List scheduling with and without communication delays
• Multiprocessor scheduling with 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

Cited in

(2)

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

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)