Petersen-Torus Networks for Multicomputer Systems

Author

Jung-hyun Seo ; HyeongOk Lee ; Moon-suk Jang

Author_Institution

Dept. of Comput. Eng., Nat. Univ. of Sunchon, Sunchon

Volume

1

fYear

2008

fDate

2-4 Sept. 2008

Firstpage

567

Lastpage

571

Abstract

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.

Keywords

graph theory; multiprocessor interconnection networks; network routing; Petersen graph; Petersen-torus network; bisection width; honeycomb torus; interconnection network; multicomputer systems; network cost; routing algorithm; Circuit synthesis; Computer networks; Costs; Hypercubes; Information management; Information technology; Multiprocessor interconnection networks; Parallel processing; Routing; Very large scale integration; Interconnection network; Network Cost; Petersen Graph; Petersen-Torus; Torus;

fLanguage

English

Publisher

ieee

Conference_Titel

Networked Computing and Advanced Information Management, 2008. NCM '08. Fourth International Conference on

Conference_Location

Gyeongju

Print_ISBN

978-0-7695-3322-3

Type

conf

DOI

10.1109/NCM.2008.47

Filename

4624071