The complexity of scheduling problems with communication delays for trees
From MaRDI portal
Publication:5056138
DOI10.1007/3-540-55706-7_15zbMath1502.68048OpenAlexW1808396869MaRDI QIDQ5056138
Andreas Jakoby, K. Ruediger Reischuk
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55706-7_15
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
The complexity of scheduling problems with communication delays for trees ⋮ Scheduling complete intrees on two uniform processors with communication delays ⋮ Data transmission in processor networks ⋮ Some models for scheduling parallel programs with communication delays
Cites Work
