Interconnection Topologies for Parallel Processing Systems

The growing demand for more computing power at increasing speed in many scienti c and engineering applications made it necessary to develop advanced computer archi tectures based on the concept of parallel processing In general a parallel computer system consists of various processing and memory units and other shared resources A critical issue in design and analysis of parallel systems is the way in which the system components are connected together since this interconnection network determines the performance of the whole system Bhuy The network topology de ned as the ab stract representation of the connections in the network is a key factor in determing a suitable architectural structure A lot of criteria for a comparison of interconnection topologies have been proposed we will focus on the problem of nding topologies with minimum communication delays expressed by the diameter and the average distance of the network The progress in solving the d k problem which is de ned as nding a graph with a maximum number of nodes for given degree d and diameter k is shown and Extended Chordal Rings are proposed as a good solution to the problem of minimizing communication delays in networks of low degree

[1]  Otto Spaniol Konzepte und Bewertungsmethoden für lokale Rechnernetze , 1982, Inform. Spektrum.

[2]  Miguel Angel Fiol,et al.  Some large graphs with given degree and diameter , 1986, J. Graph Theory.

[3]  Karl W. Doty,et al.  New Designs for Dense Processor Interconnection Networks , 1984, IEEE Transactions on Computers.

[4]  Charles L. Seitz,et al.  Concurrent VLSI Architectures , 1984, IEEE Transactions on Computers.

[5]  Frank Harary,et al.  Graph Theory , 2016 .

[6]  Karl W. Doty Large Regular Interconnection Networks , 1982, ICDCS.

[7]  Gérard Memmi,et al.  Some New Results About the (d, k) Graph Problem , 1982, IEEE Transactions on Computers.

[8]  Henry D. Friedman,et al.  A Design for (d, k) Graphs , 1966, IEEE Trans. Electron. Comput..

[9]  Gunnar E. Carlsson,et al.  Interconnection Networks Based on a Generalization of Cube-Connected Cycles , 1985, IEEE Transactions on Computers.

[10]  J PritchardD Concurrency: Practice and Experience , 1991 .

[11]  B. Elspas,et al.  Interconnection Topologies for Parallel Processing Systems , 1993 .

[12]  IEEE Transactions on Computers , Computing in Science & Engineering.

[13]  Dharma P. Agrawal,et al.  Evaluating the performance of multicomputer configurations , 1986 .

[14]  Charles Delorme,et al.  Tables of Large Graphs with Given Degree and Diameter , 1982, Inf. Process. Lett..

[15]  Chuan-Lin Wu,et al.  Interconnection Networks for Parallel and Distributed Processing , 1984 .

[16]  F. Harary,et al.  The theory of graphs and its applications , 1963 .

[17]  Charles Delorme,et al.  Strategies for Interconnection Networks: Some Methods from Graph Theory , 1986, J. Parallel Distributed Comput..

[18]  R. M. Storwick,et al.  Improved Construction Techniques for (d, k) Graphs , 1970, IEEE Transactions on Computers.