Thinning protocols for routing h-relations over shared media

Authors:
Anssi Kautonen;Ville Leppänen;Martti Penttonen
Affiliations:
Department of Computer Science, University of Eastern Finland, P.O. Box 111, FIN-80101 Joensuu, Finland;Department of Information Technology, University of Turku, Joukahaisenkatu 3-5, FIN-20520 Turku, Finland;Department of Computer Science, University of Eastern Finland, P.O. Box 1627, FIN-70211 Kuopio, Finland
Venue:
Journal of Parallel and Distributed Computing
Year:
2010

Citing 18
Cited 0

A guided tour of Chernoff bounds

Information Processing Letters
Efficient optical communication in parallel computers

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Simple, efficient shared memory simulations

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Direct bulk-synchronous parallel algorithms

Journal of Parallel and Distributed Computing
Stochastic contention resolution with short delays

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Analysis of Backoff Protocols for Mulitiple AccessChannels

SIAM Journal on Computing
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers

SIAM Journal on Computing
ERCW PRAMs and optical communication

Theoretical Computer Science - Special issue on parallel computing
An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks

SIAM Journal on Computing
Stochastic Contention Resolution With Short Delays

SIAM Journal on Computing
Analysis of practical backoff protocols for contention resolution with multiple servers

Journal of Computer and System Sciences
An Optical Simulation of Shared Memory

SIAM Journal on Computing
Efficient communication using total-exchange

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Constant Thinning Protocol for Routing h-Relations in Complete Networks

Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Simulations of PRAM on Complete Optical Networks

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Shared Memory Simulations with Triple-Logarithmic Delay

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Contention resolution with bounded delay

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Contention Resolution with Guaranteed Constant Expected Delay

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Various shared media support several channels and provide extensive connectivity enabling nodes of such media to simultaneously communicate with each other. Especially, optical communication offers huge bandwidth and makes it possible to build communication networks of very high bandwidth. However, contention of shared channels may be challenging. In this paper we examine the problem setup called h-relation routing on complete networks under so-called OCPC or 1-collision assumption. We present some simple and robust communication algorithms and study their efficiency, analytically and experimentally. The analyses and experiments show that if there is enough parallel slackness, then routing is work-optimal, and the amortized routing cost per packet is a small constant.