MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS
- 1 October 2009
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 20 (05) , 941-963
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- Application of some graph invariants to the analysis of multiprocessor interconnection networks2008
- The minimal spectral radius of graphs with a given diameterLinear Algebra and its Applications, 2007
- Parallel variable neighbourhood search algorithms for job shop scheduling problemsIMA Journal of Management Mathematics, 2007
- Inferring the Topology and Traffic Load of Parallel Programs Running in a Virtual Machine EnvironmentLecture Notes in Computer Science, 2005
- Sparse topologies with small spectrum sizeTheoretical Computer Science, 2003
- Interconnection Networks and Their EigenvaluesInternational Journal of Foundations of Computer Science, 2003
- A Programmer’s View of Parallel Computers1997
- A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architecturesIEEE Transactions on Parallel and Distributed Systems, 1993
- A table of connected graphs on six verticesDiscrete Mathematics, 1984