On the performance of multicomputer interconnection networks |
| |
| Affiliation: | 1. Department of Computing Science, University of Glasgow, Glasgow G12 8RZ, UK;2. Department of Math/Computer, UAE University, Al Ain, P.O. Box 17551, United Arab Emirates;3. School of Information Systems, University of New South Wales, Sydney 2052, Australia;1. Department of Physics, Kakatiya University, Warangal 506009, Telangana, India;2. Department of Physics, Sri Sarada College for Women (Autonomous), Salem 636011, T.N., India;1. Department of Materials Science and Engineering, Faculty of Engineering, Kyushu University, Fukuoka 819-0395, Japan;2. WPI, International Institute for Carbon-Neutral Energy Research (WPI-I2CNER), Kyushu University, Fukuoka 819-0395, Japan;3. Technology Department, Nagano Forging Co., Ltd, Nagano 380-0003, Japan;4. Institute of Physics of Materials, ASCR, Zizkova 22, CZ-616 62 Brno, Czech Republic;5. CEITEC – IPM, Institute of Physics of Materials, ASCR, Zizkova 22, 616 62 Brno, Czech Republic;1. Institute for Ferrous Metallurgy, K. Miarki 12-14, 44-100 Gliwice, Poland;2. Institute of Materials Engineering, Czestochowa University of Technology, Al. Armii Krajowej 19, 42-200 Częstochowa, Poland;3. Division of Material Processing Technology, Management and Computer Techniques in Materials Science, Institute of Engineering Materials and Biomaterials, Silesian University of Technology, ul. Konarskiego 18a, 44-100 Gliwice, Poland;1. Nikolaev Institute of Inorganic Chemistry, 3, Acad. Lavrentiev Ave., Novosibirsk 630090, Russia;2. Novosibirsk State University, 2, Pirogova Str., Novosibirsk 630090, Russia |
| |
| Abstract: | ![]()
Several researchers have analysed the performance of k-ary n-cubes taking into account channel bandwidth constraints imposed by implementation technology, namely the constant wiring density and pin-out constraints for VLSI and multiple-chip technology respectively. For instance, Dally [IEEE Trans. Comput. 39(6) (1990) 775], Abraham [Issues in the architecture of direct interconnection networks schemes for multiprocessors, Ph.D. thesis, University of Illinois at Urbana-Champaign, 1992], and Agrawal [IEEE Trans. Parallel Distributed Syst. 2(4) (1991) 398] have shown that low-dimensional k-ary n-cubes (known as tori) outperform their high-dimensional counterparts (known as hypercubes) under the constant wiring density constraint. However, Abraham and Agrawal have arrived at an opposite conclusion when they considered the constant pin-out constraint. Most of these analyses have assumed deterministic routing, where a message always uses the same network path between a given pair of nodes. More recent multicomputers have incorporated adaptive routing to improve performance. This paper re-examines the relative performance merits of the torus and hypercube in the context of adaptive routing. Our analysis reveals that the torus manages to exploit its wider channels under light traffic. As traffic increases, however, the hypercube can provide better performance than the torus. Our conclusion under the constant wiring density constraint is different from that of the works mentioned above because adaptive routing enables the hypercube to exploit its richer connectivity to reduce message blocking. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
