5388220 Parallel processing system and data transfer method which reduces bus contention by use of data relays having plurality of buffers

1995 ◽  
Vol 9 (2) ◽  
pp. IV
2002 ◽  
Author(s):  
Y. Kitaura ◽  
A. Kameyama ◽  
T. Terada ◽  
N. Uchitomi ◽  
T. Sudo ◽  
...  

1992 ◽  
Author(s):  
Peter E. Undrill ◽  
George G. Cameron ◽  
M. J. Cookson ◽  
Chris Davies ◽  
Neil L. Robinson ◽  
...  

2005 ◽  
Author(s):  
ZongTao Duan ◽  
XingShe Zhou

2021 ◽  
Vol 17 (11) ◽  
pp. 155014772110331
Author(s):  
Jung-hyun Seo ◽  
HyeongOk Lee

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.


Sign in / Sign up

Export Citation Format

Share Document