Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation (Extended Abstract)

@inproceedings{Chaudhuri1996UnderstandingTS,
  title={Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation (Extended Abstract)},
  author={Soma Chaudhuri and Paul Reiners},
  booktitle={WDAG},
  year={1996}
}
We present a complete characterization of the Set Consensus Partial Order, a reenement of the Consensus Hierarchy of Herlihy. We deene the (n; k)-set consensus problem as the k-set consensus problem for n processors. We then answer the question of whether an (n; k)-set consensus object (an object which solves the (n; k)-set consensus problem) can be implemented using a combination of (m; `)-set consensus objects and snapshot objects, for all possible values of n; k; m; `, creating a partial… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

References

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

and E

  • E. Borowsk
  • Gafni, pre-conference presentation at PODC
  • 1995
Highly Influential
7 Excerpts

and N

  • M. Herlih
  • Shavit, \The Asynchronous Computability Theorem…
  • 1993
Highly Influential
5 Excerpts

and M

  • N. Lync
  • Tuttle, \An Introduction to Input/Output Automata…
  • 1988
Highly Influential
3 Excerpts

Understanding the Set Consensus Partial Order Using the Borowsky Gafni Simulation

  • P. Reiners
  • M.S. Thesis, Iowa State University,
  • 1996
1 Excerpt

and F

  • M. Sak
  • Zaharoglou, \Wait-Free k-set Agreement is…
  • 1993
3 Excerpts

and S

  • P. Jayant
  • Toueg, \Some Results on Impossibility…
  • 1992

Similar Papers

Loading similar papers…