Brief announcement: pareto optimal solutions to consensus and set consensus

@inproceedings{Castaeda2013BriefAP,
  title={Brief announcement: pareto optimal solutions to consensus and set consensus},
  author={Armando Casta{\~n}eda and Yannai A. Gonczarowski and Yoram Moses},
  booktitle={PODC},
  year={2013}
}
A protocol P is Pareto-optimal if no protocol Q can decide as fast as P for all adversaries, while allowing at least one process to decide strictly earlier, in at least one instance. Pareto optimal protocols cannot be improved upon. We present the first Pareto-optimal solutions to consensus and k-set consensus for synchronous message-passing with crashes failures. Our k-set consensus protocol strictly dominates all known solutions, and our results expose errors in [1, 7, 8, 12]. Our proofs of… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…