Leader Election in the Presence of Link Failures
IEEE Transactions on Parallel and Distributed Systems
Leader Election in Asynchronous Distributed Systems
IEEE Transactions on Computers
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Distributed Operating Systems and Algorithms
Distributed Operating Systems and Algorithms
Introduction to Parallel Computing
Introduction to Parallel Computing
Verification of a Leader Election Algorithm in Timed Asynchronous Systems
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
A leader election algorithm in a distributed computing system
FTDCS '95 Proceedings of the 5th IEEE Workshop on Future Trends of Distributed Computing Systems
Distributed Leader Election in P2P Systems for Dynamic Sets
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
Distributed Systems: Principles and Paradigms (2nd Edition)
Distributed Systems: Principles and Paradigms (2nd Edition)
Determining a Central Controlling Processor with Fault Tolerant Method in Distributed System
ITNG '07 Proceedings of the International Conference on Information Technology
| Hi-index | 0.00 |
Extending distributed system require new strategy for management and maintenance. For managing distributed system we need one leader like other process in system. Problem is when leader like other process crashed. For solving these problems like these researchers has proposed a number of local based strategies that is each region try to do its work by itself and the results will be gathered in a distributed manner. Leader election is the process of determining a process as the manager of some task distributed among several processes (computers). We suppose like network topologies our distributed system topologies are token and star. We proposed new schemes and discussed about some aspects of them. We proposed divided algorithm in ring topology and we try to reduce latency in the broad networks optionally. Our algorithm reduces the latency against messages but a bit because latency is more important than number of messages. At the end we see how using of n in Divided (n).