Implementation of a distributed adaptive routing algorithm on the intel IPSC (Intel Personal Supercomputer). Master's thesis

Technical Report · Tue Dec 01 04:00:00 EST 1987

OSTI ID:5221871

Farinelli, T C

The purpose of this study was to examine the use of distributed adaptive routing algorithms on concurrent-class computers. The implemented routing algorithm allowed each node to select the next node based on two criteria: the fewest number of hops; and the smallest delay time. This study was limited to the comparison of a distributed adaptive routing algorithm, implemented at the applications layer, with the current static routing and with a simulation of the current routing implemented at the applications layer. The comparison with the simulated current static routing provides a measure of the possible performance gain had the adaptive routing algorithm been implemented at the network layer. Each of three configuration was comprised of four processes: a Host Process, a Routing Process, a Ring Control Process, and a Network Loading Process. The Host Process controlled the loading of the processes onto the IPSC, the Routing Process controlled the message routing, the Ring Control Process provided the baseline message passing, while the Network Loading Process provided communications congestion on selected links. The metric used to compare the Routing Process performance was the average delay time for passing a message around the ring.

• Research Organization: Air Force Inst. of Tech., Wright-Patterson AFB, OH (USA). School of Engineering
• OSTI ID: 5221871
• Report Number(s): AD-A-189849/3/XAB; AFIT/GCS/ENG-87D-11
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
990300 -- Information Handling
ALGORITHMS
AMPLIFICATION
COMPUTERS
CONTROL
DATA PROCESSING
DIGITAL COMPUTERS
DISTRIBUTED DATA PROCESSING
GAIN
LAYERS
MATHEMATICAL LOGIC
PERSONAL COMPUTERS
PROCESSING
RINGS
ROUTING
SIMULATION
SUPERCOMPUTERS