A Topology Reconfiguration Mechanism for Distributed Computer Systems
Müslim Bozyiğit, Yakup Paker · The Computer Journal · 1982
A topology reconfiguration algorithm for a densely distributed computer structure composed of computers of low cost/performance ratio (e.g. microcomputers) is given. A distributed routing mechanism based on Baran's ‘hot potato’ heuristic routing algorithm is discussed. This mechanism is applied to a multicomputer system (VTM—Variable Topology Multicomputer system) proposed to be reconfigurable according to the application requirements. An analysis of the algorithm regarding the initialization of a distributed computer system is given and the preliminary system performance results in applying this algorithm are shown. The results of a run time implementation are also compared with those of a traffic-load balancing algorithm which is basically a static fixed routing algorithm, suggested by the authors for densely and uniformly distributed computer systems.