Calculating optimal flit size and upper limit on the performance of wormhole routing

Author

Symons, Anthony ; Narasimhan, V. Lakshmi

Author_Institution

CiTR Pty. Ltd., Univ. of Queensland, Qld., Australia

fYear

1997

fDate

10-12 Dec 1997

Firstpage

59

Lastpage

72

Abstract

The emergence of large scale distributed memory computers has brought with it a variety of interconnection networks. As it is not feasible to fully interconnect the processors with a diameter of one, routing of messages is necessary. Wormhole routing is an efficient method of routing and in this paper, we derive a model for wormhole routing. Using this model, we determine the optimal buffer size, and hence show that for medium to large messages, the communication time using wormhole routing is dependent on the square root of the network diameter

Keywords

multiprocessor interconnection networks; performance evaluation; shared memory systems; telecommunication network routing; communication time; distributed memory computers; interconnection networks; network diameter; optimal buffer size; optimal flit size; performance; square root; upper limit; wormhole routing; Application software; Australia; Concurrent computing; Costs; Delay; Distributed computing; Message passing; Multiprocessor interconnection networks; Routing; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97., 1997 3rd International Conference on

Conference_Location

Melbourne, Vic.

Print_ISBN

0-7803-4229-1

Type

conf

DOI

10.1109/ICAPP.1997.651480

Filename

651480