Abstract
In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speaking, a leader election algorithm is proactive if it can tolerate failure of nodes even after a leader is elected, and (stable) leader election happens periodically. This is needed in systems where a leader is required after every failure to ensure the availability of the system and there might be no explicit events such as messages in the (shared memory) system. Previous algorithms like DiskPaxos[1] are not proactive.
In our model, individual nodes can fail and reincarnate at any point in time. Each node has a counter which is incremented every period, which is same across all the nodes (modulo a maximum drift). Different nodes can be in different epochs at the same time. Our algorithm ensures that per epoch there can be at most one leader. So if the counter values of some set of nodes match, then there can be at most one leader among them. If the nodes satisfy certain timeliness constraints, then the leader for the epoch with highest counter also becomes the leader for the next epoch(stable property). Our algorithm uses shared memory proportional to the number of processes, the best possible. We also show how our protocol can be used in clustered shared disk systems to select a primary network partition. We have used the state machine approach to represent our protocol in Isabelle HOL[3] logic system and have proved the safety property of the protocol.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gafni, E., Lamport, L.: Disk Paxos. In: Proceedings of the International Symposium on Distributed Computing, pp. 330–344 (2000)
Lamport, L.: The part-time parliament. ACM Transactions on Computer systems 16, 133–169 (1998)
Nipkow, T., Paulson, L.C., Wenzel, M.T.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
http://afp.sourceforge.net/browser_info/current/HOL/DiskPaxos/
Jayanti, P., Chandra, T.D., Toueg, S.: Fault-tolerant wait-free shared objects. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)
Chockler, G., Malkhi, D.: Light-Weight Leases for Storage-Centric Coordination. MIT-LCS-TR-934 Publication Date: 4-22-2004
Aquilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Stable Leader Election. In: Proceedings of the 15th International Conference on Distributed Computing, pp. 108–122 (2001)
Lampson, B.: How to build a highly available system using consensus. In: Babaoğlu, Ö., Marzullo, K. (eds.) WDAG 1996. LNCS, vol. 1151, pp. 1–17. Springer, Heidelberg (1996)
De Prisco, R., Lampson, B., Lynch, N.: Revisiting the Paxos algorithm. In: Proceedings of the 11th Workshop on Distributed Algorithms (WDAG), Saarbrücken, September 1997, pp. 11–125 (1997)
Larrea, M., Fernández, A., Arévalo, S.: Optimal implementation of the weakest failure detector for solving consensus. In: Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems, SRDS 2000, Nurenberg, Germany, October 2000, pp. 52–59 (2000)
Chu, F.: Reducing Ω to ⋄ W. Information Processing Letters 67(6), 293–298 (1998)
Lo, W.-K., Hadzilacos, V.: Using Failure Detectors to Solve Consensus in Asynchronous Shared-Memory Systems. In: Proceedings of the 8th International Workshop in Distributed Algorithms, pp. 280–295 (1994)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the Association for Computing Machinery 32(2), 374–382 (1985)
Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. Journal of the ACM 34(1), 77–97 (1987)
Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. advances in Computer Research 4, 163–183 (1987)
Chockler, G., Malkhi, D.: Active Disk Paxos with Infinitely Many Processes. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC) (August 2002)
Cristian, F., Fetzer, C.: The timed asynchronous system model. In: Proceedings of the 28th Annual International Symposium on Fault-Tolerant Computing, Munich, Germany, June 1998, pp. 140–149 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dharmadeep, M.C., Gopinath, K. (2006). Proactive Leader Election in Asynchronous Shared Memory Systems. In: Graf, S., Zhang, W. (eds) Automated Technology for Verification and Analysis. ATVA 2006. Lecture Notes in Computer Science, vol 4218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11901914_29
Download citation
DOI: https://doi.org/10.1007/11901914_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47237-7
Online ISBN: 978-3-540-47238-4
eBook Packages: Computer ScienceComputer Science (R0)