Minimizing the overhead for some tree-scheduling problems

DOI10.1016/0377-2217(96)00125-7zbMath0947.90574OpenAlexW1999563830MaRDI QIDQ1278303

Denis Trystram, Frédéric Guinand, Evripidis Bampis

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(96)00125-7

zbMATH Keywords

schedulingtreescommunicationsoverhead

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimal parallel execution of complete binary trees and grids into most popular interconnection networks
• Communication complexity of PRAMs
• UET scheduling with unit interprocessor communication delays
• Asynchronous PRAMs with memory latency
• The expected advantage of asynchrony
• Some models for scheduling parallel programs with communication delays
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing the overhead for some tree-scheduling problems