A Mesh-of-Trees Interconnection Network for Single-Chip Parallel Processing

2006 ◽  
Author(s):  
Aydin Balkan ◽  
Gang Qu ◽  
Uzi Vishkin
Keyword(s):  
Parallel Processing ◽  
Interconnection Network ◽  
Single Chip ◽  
Mesh Of Trees

Petersen-star networks modeled by optical transpose interconnection system

2021 ◽  
Vol 17 (11) ◽  
pp. 155014772110331
Author(s):  
Jung-hyun Seo ◽  
HyeongOk Lee
Keyword(s):  
Parallel Processing ◽  
Optical Communication ◽  
Time Complexity ◽  
High Performance ◽  
Electronic Communication ◽  
Interconnection Network ◽  
Processing System ◽  
Factor Graph ◽  
Star Network ◽  
Network Cost

One method to create a high-performance computer is to use parallel processing to connect multiple computers. The structure of the parallel processing system is represented as an interconnection network. Traditionally, the communication links that connect the nodes in the interconnection network use electricity. With the advent of optical communication, however, optical transpose interconnection system networks have emerged, which combine the advantages of electronic communication and optical communication. Optical transpose interconnection system networks use electronic communication for relatively short distances and optical communication for long distances. Regardless of whether the interconnection network uses electronic communication or optical communication, network cost is an important factor among the various measures used for the evaluation of networks. In this article, we first propose a novel optical transpose interconnection system–Petersen-star network with a small network cost and analyze its basic topological properties. Optical transpose interconnection system–Petersen-star network is an undirected graph where the factor graph is Petersen-star network. OTIS–PSN n has the number of nodes 102n, degree n+3, and diameter 6 n − 1. Second, we compare the network cost between optical transpose interconnection system–Petersen-star network and other optical transpose interconnection system networks. Finally, we propose a routing algorithm with a time complexity of 6 n − 1 and a one-to-all broadcasting algorithm with a time complexity of 2 n − 1.

OTIS-MOT: an efficient interconnection network for parallel processing

2010 ◽  
Vol 59 (2) ◽  
pp. 920-940 ◽  
Author(s):  
Prasanta K. Jana ◽  
Dheeresh K. Mallick
Keyword(s):  
Parallel Processing ◽  
Interconnection Network
Sign in / Sign up

Export Citation Format

Share Document