A Distributed Fault Tolerance Global Coordinator Election Algorithm in Unreliable High Traffic Distributed Systems

Abstract

-Distributed systems consist of several management sites which have different resource sharing levels. Resources can be shared among inner site and outer site processes at first and second level respectively. Global coordinator should exist in order to coordinate access to multi site's shared resources. Moreover; some other coordinators should manage access to inner site's shared resources so that exerting appropriate coordinator election algorithms in each level is crucial to achieve most efficient system. In this paper a hierarchical distributed election algorithm is proposed which eliminates single point of failure of election launcher. Meanwhile traffic is applied to network at different times and the number of election messages is extremely decreased as well which applies more efficiency especially in high traffic networks. A standby system between coordinators and their first alternative is considered to induct less wait time to processes which want to communicate with coordinator .

Improving Fault-Tolerant Load Balancing Algorithms in Computational Grids

“…However, they focused on a centralized scheduling model and did not take into account network bandwidth while scheduling real-time tasks. [17]. A major advantage of the algorithm is that it exchanges fever messages as compared to ring algorithm, modified Bully algorithm.…”