Paper Details

Randomised routing: "Hot potato" simulations

Authors: Qiang, Xu Ming, Turner, Stephen J.

Abstract:

In this paper, we describe experiments which simulate communication in a network of processors organised as a hypercube. A stochastic model o£ communication has been implemented in which each processor chooses at random another processor in the network with which to communicate. Deterministic and randomized routing algorithms are compared with respect to both the time taken for packets to reach their destinations and the space required for packet queues. A mixed strategy is discussed and evaluated which combines some of the advantages of each method. Questions of fault tolerance are also discussed and possible solutions presented.

Proceedings:

OUG-9: Occam and the Transputer -- Research and Applications, Charlie Askew, 1988, pp 81 - 90 published by IOS Press, Amsterdam

This record in other formats:

Web page: BibTEX, Refer
Plain text: BibTEX, Refer

If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.

Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.