Eventual Leader Election Despite Crash-Recovery and Omission Failures

In this work we consider the problem of leader election, abstraction used by many distributed services to select a unique process for coordinating actions. We propose an eventual leader election algorithm for partially synchronous systems prone to concurrent crash-recovery and omission failures where any process may suffer failures forever as long as a majority of processes meet some weak connectivity and reliability conditions.