A Communication-Time Tradeoff
From MaRDI portal
Publication:3795227
DOI10.1137/0216044zbMath0649.68048OpenAlexW1985004065MaRDI QIDQ3795227
Jeffrey D. Ullman, Christos H. Papadimitriou
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0216044
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)
Related Items (9)
Scheduling tree dags on parallel architectures ⋮ Scheduling task-trees with additive scales on parallel/distributed machines ⋮ Scheduling task-tree with additive scales on parallel/distributed machines ⋮ Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol ⋮ Communication complexity of PRAMs ⋮ Optimal parallel execution of complete binary trees and grids into most popular interconnection networks ⋮ Trade-offs between communication and space ⋮ Some models for scheduling parallel programs with communication delays ⋮ Minimizing the schedule length for a parallel 3D-grid precedence graph
This page was built for publication: A Communication-Time Tradeoff
