Node Mapping Algorithm between Torus and Petersen-Torus Networks

Author

Jung-hyun Seo ; HyeongOk Lee ; Moon-suk Jang ; Soon-Hee Han

Author_Institution

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

Volume

1

fYear

2008

Firstpage

540

Lastpage

544

Abstract

In this paper, it was proven that Torus T(5m,2n) might be embedded into Petersen-Torus PT(m,n) at dilation 5, congestion 5, and expansion 1. It was also proven that Torus might be embedded in PT at 3 or less of average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus network in PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one embedding.

Keywords

computer networks; embedded systems; multiprocessor interconnection networks; telecommunication network routing; Petersen-Torus networks; average dilation; embedding algorithm; node mapping algorithm; one-to-one embedding; processor throughput; store-and-forward routing system; wormhole routing system; Algorithm design and analysis; Circuits; Computer networks; Costs; Hypercubes; Information management; Multiprocessor interconnection networks; Packet switching; Parallel algorithms; Routing; Embedding; Interconnection Network; Petersen-Torus; Torus;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Print_ISBN

978-0-7695-3322-3

Type

conf

DOI

10.1109/NCM.2008.50

Filename

4624066