We study a new problem, the wakeup problem, that seems to be fundamental in distributed computing. We present efficient solutions to the problem and show how these solutions can be used to solve the consensus problem, the leader election problem, and other related problems. The main question we try to answer is, how much memory is needed to solve the wakeup problem? We assume a model that captu...

Replicated services often rely on a leader to order client requests and broadcast state updates. In this work, we present POLE, a leader election algorithm that select leaders using application-specific scores. This flexibility given to the application enables the algorithm to tailor leader election according to metrics that are relevant in practical settings and that have been overlooked by ex...

Selection tasks generalize some well studied problems, such as collective coin flipping and leader election. We present new selection protocols in the full information model, and new negative results. In particular, when there are (1 + δ)n/2 good players, we show a protocol that chooses a good leader with probability Ω(δ), and show that every leader election protocol has success probability O(δ...

We show how to compress communication in distributed protocols in which parties do not have private inputs. More specifically, we present a generic method for converting any protocol in which parties do not have private inputs, into another protocol where each message is “short” while preserving the same number of rounds, the same communication pattern, the same output distribution, and the sam...

Itai and Rodeh showed that, on the average, the communication of a leader election algorithm takes no more than $LN$ bits, where $L \simeq 2.441716$ and $N$ denotes the size of the ring. We give a precise asymptotic analysis of the average number of rounds M(n) required by the algorithm, proving for example that $\dis M(\infty) := \lim\_{n\to \infty} M(n) = 2.441715879...$, where $n$ is the num...

During the latest episode of general election held in Malaysia, it is observed that the FBMKLCI index was lifted 62.52 points in a day soon after the announcement of election outcome. Moreover, the index registered a highest gain of 96.29 points in the middle of the intra-day trade. This suggests that investors who had got the right direction could make profitable intra-day trading the next tra...