Abstract
Dynamically switched, sparse interconnection networks are the major element of scalable general purpose parallel computers. This paper presents different network structures and corresponding routing schemes based on a universal routing device. A locally adaptive enhancement to the basic deterministic routing mechanism is proposed and its impact on the network performance is proved by simulation results. This is done comparatively for different network topologies and with respect to network throughput and size scalability. Finally, the extension of the results to very large networks is demonstrated by analytical methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J.H. Patel: Performance of Processor-Memory Interconnections for Multiprocessors; IEEE Trans. Comput., vol. c-30, no 10; pp. 771–780; 1981
C.P. Kruskal, M. Snir: Performance of Multistage Interconnection Networks for Multiprocessors; IEEE Trans. Comput., vol. c-32, no 12; pp. 1091–1098; 1983
J. van Leeuwen, R.B. Tan; Interval Routing; The Computer Journal 30 (4): pp. 298–307; 1987
D. Pountain; Virtual Channels: The Next Generation of Transputers; BYTE April 90, Europe&World: 3–12; April 1990
D. May, P. Thompson; Transputers and Routers: Components for Concurrent Machines; Proc. of Japanese Occam User Group; 1990
W.J. Dally, C.L. Seitz; Deadlock-Free Message Routing in Multiprocessor Interconnection Networks; IEEE Trans. Comput., vol. c-36, no 5; pp. 547–553; 1987
P.A.J. Hilbers, J.J. Lukkien; Deadlock-free message routing in multicomputer networks; Distributed Computing 3; pp. 178–186; 1989
E. Reyzl; Comparative Evaluation of Message-Based Parallel Systems: Bus vs. Hypercube; GI-PARS Mitteilungen Nr. 6; pp. 220–231; 1989
E. Reyzl, H. Eckardt; Performance Evaluation for High-Performance Interconnection Networks; Tagungsband der 11. ITG/GI Fachtagung ”Architektur von Rechensystemen”; pp. 275–287; 1990
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hofestädt, H., Klein, A., Reyzl, E. (1991). Performance benefits from locally adaptive interval routing in dynamically switched interconnection networks. In: Bode, A. (eds) Distributed Memory Computing. EDMCC 1991. Lecture Notes in Computer Science, vol 487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032936
Download citation
DOI: https://doi.org/10.1007/BFb0032936
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53951-3
Online ISBN: 978-3-540-46478-5
eBook Packages: Springer Book Archive