Multiprocessor Interconnection Networks with Small tightness

Homogeneous multiprocessor systems are usually modelled by undirected graphs. Vertices of these graphs represent the processors, while edges denote the connection links between adjacent processors. Let G be a graph with diameter D, maximum vertex degree Δ, the largest eigenvalue λ1 and m distinct eigenvalues. The products mΔ and (D+1)λ1 are called the tightness of G of the first and second type, respectively. In recent literature it was suggested that graphs with a small tightness of the first type are good models for the multiprocessor interconnection networks. In a previous paper we studied these and some other types of tightness and some related graph invariants and demonstrated their usefulness in the analysis of multiprocessor interconnection networks. We proved that the number of connected graphs with a bounded tightness is finite. In this paper we determine explicitly graphs with tightness values not exceeding 9. There are 69 such graphs and they contain up to 10 vertices. In addition we identify graphs with minimal tightness values when the number of vertices is n = 2,…, 10.

[1]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[2]  Mehmet Emin Aydin,et al.  Parallel variable neighbourhood search algorithms for job shop scheduling problems , 2007 .

[3]  Vivek Sarkar,et al.  Partitioning and Scheduling Parallel Programs for Multiprocessing , 1989 .

[4]  Lei Wang,et al.  Ringed Petersen spheres connected hypercube interconnection networks , 2005, 10th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'05).

[5]  Sajal K. Das,et al.  Interconnection Networks and Their Eigenvalues , 2003, Int. J. Found. Comput. Sci..

[6]  Robert Elsässer,et al.  Sparse topologies with small spectrum size , 2003, Theor. Comput. Sci..

[7]  D. Cvetkovic,et al.  Spectra of Graphs: Theory and Applications , 1997 .

[8]  B. McKay.  nauty User ’ s Guide ( Version 2 . 4 ) , 1990 .

[9]  Dragos Cvetkovic,et al.  A table of connected graphs on six vertices , 1984, Discret. Math..

[10]  Robert Kooij,et al.  The Minimal Spectral Radius of Graphs with a Given Diameter , 2006 .

[11]  Tor Sørevik.  A Programmer’s View of Parallel Computers , 1997 .

[12]  Peter A. Dinda,et al.  Inferring the Topology and Traffic Load of Parallel Programs Running in a Virtual Machine Environment , 2004, JSSPP.

[13]  Gregory T. Byrd,et al.  Considerations for Multiprocessor Typologies , 1987 .

[14]  Afonso Ferreira,et al.  Models for Parallel Algorithm Design: An Introduction , 1997 .

[15]  D. Cvetkovic,et al.  Simultaneous editing and multilabelling of graphs in system newGraph , 2006 .

[16]  D. Janežič,et al.  Fast Parallel Molecular Simulations , 2005 .

[17]  B. Delagi,et al.  CONSIDERATIONS FOR MULTIPROCESSOR TOPOLOGIES , 1998 .

[18]  Tatjana Davidović,et al.  Application of some graph invariants to the analysis of multiprocessor interconnection networks , 2008 .

[19]  Edward A. Lee,et al.  A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures , 1993, IEEE Trans. Parallel Distributed Syst..