Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems

DOI10.1016/S0167-8191(98)00101-XzbMath0914.68015OpenAlexW2038551582MaRDI QIDQ1285547

Alix Munier

Publication date: 28 April 1999

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(98)00101-x

zbMATH Keywords

schedulingmakespangeneral communication delaystask duration

Mathematics Subject Classification ID

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

Related Items (4)

Complexity and approximation results for scheduling multiprocessor tasks on a ring. ⋮ Complexity and approximation for precedence constrained scheduling problems with large communication delays ⋮ An EPTAS for scheduling fork-join graphs with communication delay ⋮ Scheduling 2-dimensional grids with large communication delays

This page was built for publication: Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems