Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays

DOI10.1006/INCO.1993.1041zbMath0781.68070OpenAlexW1983770018MaRDI QIDQ1260649

Lefteris M. Kirousis, Hermann Jung, Paul G. Spirakis

Publication date: 30 August 1993

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1993.1041

zbMATH Keywords

schedulingmultiprocessorcommunication delays

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

A Glimpse at Paul G. Spirakis ⋮ Scheduling trees with large communication delays on two identical processors ⋮ Some models for scheduling parallel programs with communication delays ⋮ Scheduling inverse trees under the communication model of the LogP-machine

This page was built for publication: Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays