Efficient Schemes for Parallel Communication

DOI10.1145/828.1892zbMath0628.68021OpenAlexW2058355999MaRDI QIDQ3765230

Eli Upfal

Publication date: 1984

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/828.1892

zbMATH Keywords

probabilistic algorithmparallel computersnetwork routingbalanced communication schemes

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (18)

Routing, merging, and sorting on parallel models of computation ⋮ Scheduling trains with small stretch on a unidirectional line ⋮ Stochastic analysis of dynamic processes ⋮ Towards a better understanding of pure packet routing ⋮ FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH ⋮ Simulating shared memory in real time: On the computation power of reconfigurable architectures ⋮ Communication aspects of networks based on geometric incidence relations ⋮ Efficient PRAM simulation on a distributed memory machine ⋮ Communication throughput of interconnection networks ⋮ Shared memory simulations with triple-logarithmic delay ⋮ Sparse Semi-Oblivious Routing: Few Random Paths Suffice ⋮ Optimal cover time for a graph-based coupon collector process ⋮ Oblivious routing with limited buffer capacity ⋮ On the theory of interconnection networks for parallel computers ⋮ Survey on Oblivious Routing Strategies ⋮ The generalized packet routing problem ⋮ Tight bounds for oblivious routing in the hypercube ⋮ Singletons for simpletons revisiting windowed backoff with Chernoff bounds

This page was built for publication: Efficient Schemes for Parallel Communication