DocumentCode :
3162695
Title :
An algorithm for dynamic reconfiguration of a multicomputer network
Author :
García, J.M. ; Duato, J.
Author_Institution :
Dept. de Inf., Univ. de Castilla-La Mancha, Albacete, Spain
fYear :
1991
fDate :
2-5 Dec 1991
Firstpage :
848
Lastpage :
855
Abstract :
The dynamic reconfiguration of the interconnection network is an advanced feature of some multicomputers to reduce the communication overhead. The authors present an algorithm for the dynamic reconfiguration of the network. Reconfiguration is limited, preserving the original topology. Long distance message passing is minimized by positioning communication partners close to each other. The algorithm is transparent to the application programmer and is not restricted to a particular class of applications, being very well suited for parallel applications whose communication pattern varies over time. The paper also presents some simulation results, showing the benefits from the new reconfiguration algorithm
Keywords :
message passing; multiprocessor interconnection networks; parallel processing; algorithm; dynamic reconfiguration; interconnection network; message passing; multicomputer network; simulation; Application software; Delay; Heuristic algorithms; Hypercubes; Message passing; Multiprocessor interconnection networks; Network topology; Parallel architectures; Programming profession; Routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-2310-1
Type :
conf
DOI :
10.1109/SPDP.1991.218232
Filename :
218232
Link To Document :
بازگشت