DocumentCode
3353118
Title
Traffic analysis of rectangular SW-banyan networks
Author
Jenevein, R.M. ; Mookken, Thomas
Author_Institution
Texas Univ., Austin, TX, USA
fYear
1988
fDate
30 May-2 Jun 1988
Firstpage
333
Lastpage
342
Abstract
An algorithm to route packets in rectangular SW-banyans is described. A packet-switching scheme is modeled on single-sided and double-sided SW-banyans. Effects of queue lengths and processor configurations on performance are studied. Prevention of deadlocks in the network is discussed. Simulation results suggest a scheme with varying queue lengths for different levels of the network to optimize performance, and that the length be limited. The algorithm presented is able to take advantage of the network traffic information stored at a node and dynamically route a packet through a shortest path which has the least load
Keywords
multiprocessor interconnection networks; packet switching; telecommunication traffic; deadlocks; network traffic information; packet-switching scheme; processor configurations; queue lengths; rectangular SW-banyan networks; Computer architecture; Computer networks; Cost function; Joining processes; Packet switching; Parallel architectures; System performance; System recovery; Telecommunication traffic; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Architecture, 1988. Conference Proceedings. 15th Annual International Symposium on
Conference_Location
Honolulu, HI
Print_ISBN
0-8186-0861-7
Type
conf
DOI
10.1109/ISCA.1988.5244
Filename
5244
Link To Document