Petersen-Torus Networks for Multicomputer Systems

In this paper, we propose and analyze a new interconnection network, called Petersen-torus (PT) network based on well-known Petersen graph. Petersen graph is the graph with the most desirable network cost to the number of nodes, such that it has the most number of nodes as 10 among graphs having deg...

Full description

Saved in:
Bibliographic Details
Published in2008 Fourth International Conference on Networked Computing and Advanced Information Management Vol. 1; pp. 567 - 571
Main Authors Jung-hyun Seo, HyeongOk Lee, Moon-suk Jang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2008
Subjects
Algorithm design and analysis
Argon
Computers
Distance measurement
Hypercubes
Interconnection network
Multiprocessor interconnection
Network Cost
Petersen Graph
Petersen-Torus
Routing
Torus
Online AccessGet full text

Cover

More Information
Summary:In this paper, we propose and analyze a new interconnection network, called Petersen-torus (PT) network based on well-known Petersen graph. Petersen graph is the graph with the most desirable network cost to the number of nodes, such that it has the most number of nodes as 10 among graphs having degree 3 and diameter 2. Taking advantage of Petersen graph, PT was designed in place of Petersen graph having 10 nodes per node of torus. PT network has a smaller diameter and a smaller network cost than honeycomb torus with same nodes. We propose routing algorithm and we derive diameter, network cost and bisection width.
ISBN:0769533221
9780769533223
DOI:10.1109/NCM.2008.47