Scheduling inverse trees under the communication model of the LogP-machine
From MaRDI portal
Publication:1285579
DOI10.1016/S0304-3975(97)00161-8zbMath0913.68013MaRDI QIDQ1285579
Martin Middendorf, Wolf Zimmermann, Welf M. Löwe
Publication date: 28 April 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
- Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays
- Three, four, five, six, or the complexity of scheduling with communication delays
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- C.P.M. Scheduling with Small Communication Delays and Task Duplication
- The Complexity of Scheduling Trees with Communication Delays
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: Scheduling inverse trees under the communication model of the LogP-machine
