Abstract
We propose a topology for interconnection networks, called projective torus, arising from 1-edge fault tolerance concern for tori. Shortest path routing and various diameters on projective tori are shown to be better than meshes and tori. Furthermore, wire layout for edges in a projective torus is also presented. It shows that wire length of an edge is bounded by a small constant.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bondy, J.A. and Murty, U.S.R.: Graph Theory with Applications. Elsevier Science Publishing, New York, (1976).
Chou, R.S. and Hsu, L.H.: 1-edge fault-tolerant designs for meshes. Parallel Processing Letters, 4 (1994) 385–389.
Harary, F. and Hayes, J.P.: Edge fault tolerance in graphs. Networks. 23 (1993) 135–142.
Hsu, L.H., Wang, S.Y. and Sung, T.Y.: Faithful 1-edge fault tolerant graphs, manuscript. accepted by Information Processing Letters. (1996).
Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays — Trees — Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA, (1992).
Tang, K.W. and Padubidri, S.A.: Diagonal and toroidal mesh networks. IEEE Trans. Computers. 43 (1994) 815–826.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sung, TY., Hoe, TY., Hsu, LH. (1997). Projective torus networks. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045112
Download citation
DOI: https://doi.org/10.1007/BFb0045112
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63357-0
Online ISBN: 978-3-540-69522-6
eBook Packages: Springer Book Archive