A New Topology with Odd Degree for Multiprocessor Systems

The full text article is not available for purchase.

The publisher only permits individual articles to be downloaded by subscribers.


A new topology for interconnection networks has been proposed. The underlying network graph has N = 4 n nodes ( n > 2) and is almost regular with maximum degree 5 and diameter < 3/4 log 2 N + 1. Algorithms for point-to-point routing and single node broadcast have also been developed. It has also been shown that various algorithms for real life applications, e.g., matrix transpose, matrix multiplication, finding the sum/average/maximum/minimum of a set of data elements and ASCEND/DESCEND types of algorithms can be efficiently implemented on this topology. Finally, the underlying idea of constructing this network has been generalized to define a family of almost regular odd degree graphs of maximum degree 2 j + 1, ( j > 2) with N = (2 j ) n nodes and diameter 3/4 log j N + 1.

Document Type: Research Article

Affiliations: Electronics Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta, 700 035, India

Publication date: November 1, 1996

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more