Thinning protocols for routing h-relations over shared media

DOI10.1016/J.JPDC.2010.03.012zbMATH Open1233.68031OpenAlexW1983559400MaRDI QIDQ666178FDOQ666178

Authors: Anssi Kautonen, Ville Leppänen, Martti Penttonen 

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

Recommendations

• scientific article; zbMATH DE number 1283996
• An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks
• Scheduling parallel communication: The \(h\)-relation problem
• Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
• Asynchronous shared channel

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

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666178)