By Topic

Experiments with randomized and deterministic routing algorithms on transputer networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Cai Wentong ; Sch. of Appl. Sci., Nanyang Technol. Univ.

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