Session F2: Interconnection networks for multiprocessors

Microprocessing and Microprogra~'nming32 (1991) 573--574 North-Holland

Sef~

F2:

~

c ~ :

573

~m)~s

~

~

z~

~ ~

.

~

Muit~pmeemtms

sp~

With the rapid advanee~ i,~ technology, it is now feasible to build a system consisting of thousands of processors. Frocessors in such a parallel/distributed system may spend a con~idereble amount of time just commualc~M~g among themselves tm~$ an interconnectlon network connects them. Tbeaxffo~e~ we need to desiga interconnecfinn netw~.rkswith both co~ .~mdp e d f ~ m c o well balanced. In this se~nn we have four papers different interconneOinn networks topics: time diffe~._nt po~i¢~ for m~m0glngthe conue~ons in a HIPPI system, a new reg~.~interconnectinn nee~rk for large dLsm'bu~ ~aems, a faelt tolerant modeler atchltecture for generalized ~ n-co~ network, and an algorithm with e hardwere implemenmtinn for generating node disjoint routes in a Kautz network. The first paper, "Control PoHcles for I n ~ r c o n n ~ DL.~r~u~od Sy~ems via an HIPPI Switch; by I. Chbmt~q A. Ganz and M. G. Kienzleq proposes three connection m ~ policies for comrolling a HIPPI (High Performance Parallel ~ ) interconnectinn system. A~eming a crossbar topolo~ for the switch, the authors I~ve developed two Ma:kov model to analyze the performance of ][-I~PI ~¢rconnecfion ~ under connection manag~ent policies. The models allow to determine intcrconnectlon system cap,chics and aid in tim choice of connection management policies.

The second paper, "A Regent I m e r c ~ m ~ a Nemm~, by C. S. Yang. D. C. lain ~ S. Y. Wu, preum~ a ~ imcrconncct~ network f ~ ~rg¢ ~ s3~tcm~ ~ ~ a mixed mdlx number s,#tem. The a m t ~ s lucre mc~-m'*~l diameter. ~ , fauk to,ram:e, nmdug + ~ut r ~ . Tlm paper com:kutes ttm tlm n e t m ~ is ~ for VIaI ~ end i m p m ~ some p ~ e m , d Ikmlum hypercubes such ~s ~ ~ t re.bray. The third paper, ~A R e c e ~ i e Modeiur Fa~it T o ~ t G.-neralized Boolean n-cube Network', by C. S. Yang ~ S. Y. We. presents a fault t ~ modular a~Mtectm'e for g e m m ~ Boolean m-cobe nemmk, where each m e d ~ comets d

routi~ ~ o r i t ~ emt s~vt t ~ the m ~ k ~ m e ¢ ~ ect~m: ve~

The fom~ paper, "On Hardvcare for ~ ~ in Kamz D ~ r a ~ ' , by G. L M. S n ~ P. L M. ~ P. G. Ja~sea, F. de eeor a~l e. ~ ~ e ~ d e ~ of a ~ and fast ~ - ~ r c ~ # ~ of ~ ~ for node disjoint metes between two a r b ~ r ~ tm¢~ in a K a ~ network. T'ne romi~ ~ d g o r ~ is dsscrlbed in VHDL amt tim authors remark that t ~ ~ m ~ a r e can be ~flised with components such as Flek] Progtmmneb~ Gate An'a~.