An interprocessor communication scheme is a key to exploit parallel computers effectively. One of the efficient communication schemes on hypercubes is the two-phased randomized routing algorithm. In this paper, the performance of this randomized routing algorithm is studied. In addition, the performance of a deterministic routing algorithm, the greedy routing algorithm is evaluated
Published in:
Networks, 1993. International Conference on Information Engineering '93. 'Communications and Networks for the Year 2000', Proceedings of IEEE Singapore International Conference on
(Volume:2
)
Date of Conference: 6-11 Sep 1993