A Topology Reconfiguration Mechanism for Distributed Computer Systems | Zendy

Müslim Bozyiğit | Zendy; Yakup Paker | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Topology Reconfiguration Mechanism for Distributed Computer Systems

Author(s) -

Müslim Bozyiğit,

Yakup Paker

Publication year - 1982

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/25.1.87

Subject(s) - computer science , control reconfiguration , initialization , distributed computing , heuristic , load balancing (electrical power) , routing (electronic design automation) , distributed algorithm , topology (electrical circuits) , routing table , parallel computing , algorithm , computer network , embedded system , routing protocol , mathematics , geometry , combinatorics , artificial intelligence , programming language , grid

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research