Abstract
We describe routing algorithms on networks composed of optical busses. Using networks with short busses and small degree we are able to give very fast routing algorithms. First, we describe a leveled optical network and routing algorithms for it. Next, we show how to simulate this network on high-dimensional meshes of optical busses (MOBs). We present algorithms, e.g., for h-relations with runtime being double-logarithmic in the size of the mesh, linear in h, and polynomial in the dimension. Previous results are exponential in the dimension. We use a novel type of protocol and analysis inspired by hashing based shared memory simulations with redundant storage representation from [MSS95].
supported by the DFG-Graduiertenkolleg “Parallele Rechnernetzwerke in der Produktionstechnik”, ME 872/4-1 and by DFG-SFB 376 “Massive Parallelität”
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Richard J. Anderson and Gary L. Miller. Optical communication for pointer based algorithms. Technical Report CA 90089-0782 USA, Computer Science Department, University of Southern California, 1988.
Martin Dietzfelbinger and Friedhelm Meyer auf der Heide. Simple efficient shared memory simulations. In Proceedings of the 5th Ann. Symp. on Parallel Algorithms and Architectures, 1993.
Leslie Ann Goldberg, Mark Jerrum, Tom Leighton, and Satish Rao. A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer. In Proceedings of the 5th Ann. ACM Symp. on Parallel Algorithms and Architectures, pages 300–309, 1993. Preprint.
Leslie Ann Goldberg, Mark Jerrum, Tom Leighton, and Satish Rao. Doubly logarithmic communication algorithms for the completely connected optical communication parallel computers. Preprint, 1994.
C. McDiarmid. On the method of bounded differences. Combinatorics, London Math. Soc. Lecture Notes Series, (141):148–188, 1989.
Friedhelm Meyer auf der Heide, Christian Scheideler, and Volker Stemann. Exploiting storage redundancy to speed up randomized shared memory simulations. In Annual Symposium on Theoretical Aspects of Computer Science, to appear in Theoretical Computer Science, 1995.
Friedhelm Meyer auf der Heide, Klaus Schröder, and Frank Schwarze. Routing on networks of optical crossbars (Technical Report). Technical report, Heinz Nixdorf Institute and Computer Science Department, University Paderborn, 1996. to appear.
Eli Upfal. An O(log N) deterministic packet routing scheme. In Symposium on Theory of Computing. ACM, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
auf der Heide, F.M., Schröder, K., Schwarze, F. (1996). Routing on networks of optical crossbars. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_39
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive