Abstract
Hypercycles, is a class of multidimensional graphs, which are generalizations of the n-cube. They are obtained by allowing each dimension to incorporate more than two elements and a cyclic interconnection strategy. Hypercycles, can be used in the design of interconnection networks for distributed systems tailored specifically to the topology of a particular application. Routing strategies, including deadlock-free and deadlock-avoiding have been developed and their relative performance established through simulations.
Supported by the Natural Sciences and Engineering Research Council Canada, and IRIS
This is a preview of subscription content, log in via an institution to check access.
References
Dimopoulos, N.,et al “Performance Evaluation of the Backtrack to the Origin and Retry Routing for Hypercycle based Interconnection Networks” Proceedings, 10th International Conference on Distributed Systems, Paris, pp. 278–284 (June 1990).
Dimopoulos, N.,et al“ Routing and Broadcasting in Hypercycles. Deadlock Free and Backtracking Strategies'” under review, IEEE Trans. Paral. and Distr. Systems.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dimopoulos, N.J., Chowdhury, M., Sivakumar, R., Dimakopoulos, V. (1992). Routing in Hypercycles. Deadlock free and backtracking strategies. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_148
Download citation
DOI: https://doi.org/10.1007/3-540-55599-4_148
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55599-5
Online ISBN: 978-3-540-47250-6
eBook Packages: Springer Book Archive