Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Routing Algorithms for IBM SP1 Bulent Abali1 and Cevdet Aykanat2
 

Summary: Routing Algorithms for IBM SP1
Bulent Abali1 and Cevdet Aykanat2
1
IBM Thomas J. Watson Research Center,
P.O.Box 218, Yorktown Heights, NY 10598
2
Bilkent University,
06533 Ankara, Turkey
Abstract. Scalable multicomputers are based upon interconnection net-
works that typically provide multiple communication routes between any
given pair of processor nodes. Routes must be selected for communica-
tion so that the load is distributed evenly among the links and switches
to prevent congestion in the network. We describe the route selection
algorithm used in the IBM 9076 SP1 multicomputer. We then describe
a new algorithm for reducing network congestion and compare the two
algorithms.
1 Introduction
Scalable multicomputers are based upon interconnection networks that typi-
cally provide multiplecommunicationroutes between any given pair of processor
nodes. Multiple routes provide low latency, high bandwidth, and reliable inter-

  

Source: Aykanat, Cevdet - Department of Computer Engineering, Bilkent University

 

Collections: Computer Technologies and Information Sciences