(A) study on routing problems in tree based multiprocessor networks

Abstract

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.