Thinning protocols for routing \(h\)-relations over shared media

DOI10.1016/j.jpdc.2010.03.012zbMath1233.68031OpenAlexW1983559400MaRDI QIDQ666178

Martti Penttonen, Anssi Kautonen, Ville Leppänen

Publication date: 7 March 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.03.012

zbMATH Keywords

routing\(h\)-relationOCPCshared communication mediawork-optimal

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A guided tour of Chernoff bounds
• ERCW PRAMs and optical communication
• Analysis of practical backoff protocols for contention resolution with multiple servers
• Efficient PRAM simulation on a distributed memory machine
• An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks
• Stochastic Contention Resolution With Short Delays
• An Optical Simulation of Shared Memory
• Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
• Analysis of Backoff Protocols for Multiple Access Channels

This page was built for publication: Thinning protocols for routing \(h\)-relations over shared media