Title :
An interconnection network RPn(k) and its properties
Author :
Lin, Yang ; Chang-Ming, Xing
Author_Institution :
Int. Sch. of sict, Shandong Inst. of Commerce & Technol., Jinan, China
Abstract :
Petersen graph has good performance in parallel and distributed computation because of its properties such as short diameter and regularity. Based on the simple scalable properties of ring and the short network diameter of Petersen graph, a new interconnection network RPn(k) is proposed and the properties of the RPn(k) are analyzed. It is proved that RPn(k) not only has good regularity and extensibility, but also has shorter diameter and smaller construction costs than the RP(k) network. Additionally, The conditions satisfying that the network diameter of RPn(k) are better than those of 2D Torus are presented.
Keywords :
costing; graph theory; multiprocessor interconnection networks; parallel processing; Petersen graph; construction cost; distributed computation; interconnection network RPn(k); network diameter; parallel computation; Business; Computer networks; Concurrent computing; Costs; Distributed computing; Educational institutions; Multiprocessor interconnection networks; Network topology; Roads; Routing; Interconnection Network; Petersen Graph; RPn(k); Ring;
Conference_Titel :
Networking and Digital Society (ICNDS), 2010 2nd International Conference on
Conference_Location :
Wenzhou
Print_ISBN :
978-1-4244-5162-3
DOI :
10.1109/ICNDS.2010.5479396
