Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus

@inproceedings{Afek2009TightGR,
  title={Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus},
  author={Yehuda Afek and Eli Gafni and Opher Lieber},
  booktitle={DISC},
  year={2009}
}
This thesis addresses the relations between two problems in distributed computing, the g-tight group renaming task and what we call, safe-consensus task. We show that the g-tight group renaming task implements g processes consensus by introducing an intermediate task, the safe-consensus task. We provide an implementation of g-safe-consensus from g-tight group renaming and an implementation of g-consensus from the former. It is known that with g-consensus g-tight group renaming is solvable, thus… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Group Renaming. OPODIS

  • Y Afek, I Gamzu, I Levy, M Merritt, Taubenfeld G
  • Group Renaming. OPODIS
  • 2008

Proc. 18th Int'l Symposium on Distributed Computing (DISC'04)

  • E Gafni, Group-Solvability
  • Proc. 18th Int'l Symposium on Distributed…
  • 2004

The Implication of the Borowsky-Gafni Simulation on the Set-Consensus Hierarchy

  • E Borowsky, E Gafni
  • The Implication of the Borowsky-Gafni Simulation…
  • 1993

Similar Papers

Loading similar papers…