Relationships between communication models in networks using atomic registers

@article{Higham2006RelationshipsBC,
  title={Relationships between communication models in networks using atomic registers},
  author={Lisa Higham and Colette Johnen},
  journal={Proceedings 20th IEEE International Parallel & Distributed Processing Symposium},
  year={2006},
  pages={9 pp.-}
}
A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In shared-registers versions of this general description, neighbouring processors communicate by reading or writing shared registers, where each read or write is one atomic step. Variants of shared register models occur in the literature. This paper defined two models of shared registers determined by selecting the… CONTINUE READING

References

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

I Lavall ee

  • C Johnen
  • and C Lavault. Fair and reliable self-stabilizing…
  • 2000
Highly Influential
4 Excerpts

Self-Stabilization

  • S Dolev
  • MIT Press
  • 2000
Highly Influential
4 Excerpts

Relationships between atomic communication register models in networks

  • L Higham, C Johnen
  • Technical report, LRI-CNRS
  • 2005
1 Excerpt

M Papatrianta lou

  • JH Hoepman
  • and P Tsigas. Self-stabilization of wait-free…
  • 2002
1 Excerpt

Simple waitfree muiltireader registers

  • anid S Moran.
  • Journaol of the Associ tio ; n of the Coruputihg…
  • 2002

Similar Papers

Loading similar papers…