𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Improved Leader Election Algorithm for Distributed Systems

✍ Scribed by P, BeaulahSoundarabai; J, Thriveni; K R, Venugopal; L M, Patnaik

Book ID
120517537
Publisher
Academy & Industry Research Collaboration Center ( AIRCC )
Year
2013
Weight
172 KB
Volume
5
Category
Article
ISSN
0975-7252

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An $O(1)$ RMRs Leader Election Algorithm
An $O(1)$ RMRs Leader Election Algorithm
✍ Golab, Wojciech; Hendler, Danny; Woelfel, Philipp πŸ“‚ Article πŸ“… 2010 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 686 KB
An Improved Algorithm for Module Allocat
An Improved Algorithm for Module Allocation in Distributed Computing Systems
✍ Ajith Tom P.; C. Siva Ram Murthy πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 159 KB

We consider the problem of finding an optimal and sub-optimal allocation of program modules onto processors of a distributed computing system. A module causes two types of cost to be incurred at the processor to which it is allocated-an execution cost for processing the module, and a communication c

Algorithms for Leader Election by Cellul
Algorithms for Leader Election by Cellular Automata
✍ Codrin Nichitiu; Jacques Mazoyer; Eric RΓ©mila πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 224 KB

We present two cellular algorithms, in O n and respectively in O w 2 , for the leader election problem on finite connected rings F and respectively finite connected subsets of d , of eccentricity w, for any fixed d. The problem consists of finding an algorithm such that when setting the elements of