Advances in multiprocessor and semiconductor technology will soon make general purpose computing systems composed of thousands of VLSI processors economically feasible. Therefore, we can think multiprocessor network systems which are composed of thousands of processors or more.
This study considers tree based multiprocessor network systems appropriate to VLSI based multiprocessor network systems and analyzes these network systems by defining some analysis parameters. In order to solve a contention problem in a simple binary tree network, the network structure is argumented with double ring network. The dynamic routing algorithm was chosen over the static routing algorithm. Simulation results which concern routing control and flow control are shown by changing the number of nodes and the routing algorithms.
다중 프로세서와 반도체 기술의 발전에 의하여 많은 수의 VLSI 프로세서로 구성된 범용 컴퓨터를 만드는 것이 가능하게 될것이다.
본 논문은 tree structure를 기본 구조로 하는 다중 프로세서를 가상하여, 이 시스템에서의 routing control과 flow control에 관하여 연구하였다. Tree network의 특성에 의하여 traffic이 upper level node에 모이는 것을 해소하기 위하여 tree-double ring structure를 가상하였으며, 이 structure에서도 traffic 이 upper level node에 모이므로 routing algorithm을 개량하여 traffic이 균등하게 분포되도록 하였다.
