Advertisement

Space-optimum conflict-free construction of 1-writer 1-reader multivalued atomic variable

  • S. Haldar
  • P. S. Subramanian
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 857)

Abstract

A buffer-based shared variable construction is conflict-free if, in each execution of the shared variable, no reading of any buffer overlaps with a writing of that buffer. This paper presents a conflict-free construction of a 1-writer 1-reader multivalued atomic shared variable from four safe buffers and four additional safe bits. It is also shown that the construction is space optimum.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    B. Awerbuch, L.M. Kirousis, E. Kranakis, P.M.B. Vitanyi: A proof technique for register atomicity. In: K.V. Nori, S. Kumar (eds.) Foundations of Software Technology and Theoretical Computer Science. Proceedings, India 1988. (Lect. Notes Comput. Sci., vol. 338, pp. 286–303) Berlin Heidelberg New York: Springer 1988Google Scholar
  2. [2]
    J.E. Bums, G.L. Peterson: The ambiguity of choosing. Proceedings of the 8th Annual Symposium on Principles of Distributed Computing, pp. 145–157 (1989)Google Scholar
  3. [3]
    S. Haldar, K. Vidyasankar: Conflict-free construction of 1-writer multireader multivalued atomic variable. Report#9116, Department of Computer Science, Memorial University of Newfoundland, Canada, Nov 1991Google Scholar
  4. [4]
    P. Jayanti, A. Sethi, E. Lloyd: Minimal shared information for concurrent reading and writing. In: S. Toueg, P.G. Spirakis, L. Kirousis (eds.) Workshop on Distributed Algorithms. Proceedings, Greece 1991 (Lect. Notes Comput. Sci., vol. 579, pp.212–228) Berlin Heidelberg New York: Springer 1991Google Scholar
  5. [5]
    L.M. Kirousis, E. Kranakis, P.M.B. Vitanyi: Atomic multireader register. In: J. van Leeuwen (ed.) Workshop on Distributed Algorithms. Proceedings, The Netherlands 1987. (Lect. Notes Comput. Sci., vol. 312, pp. 278–296) Berlin Heidelberg New York: Springer 1987Google Scholar
  6. [6]
    L. Lamport: On interprocess communication — Part I: Basic formalism, Part II: Algorithms. Distributed Computing 1, 77–101 (1986)CrossRefGoogle Scholar
  7. [7]
    J. Tromp: How to construct an atomic variable. In: J. Bermond, M. Raynal (eds) Workshop in Distributed Algorithms. Proceedings, France 1989. (Lect. Notes Comput. Sci., vol. 392, pp. 292–302) Berlin Heidelberg New York: Springer 1989Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • S. Haldar
    • 1
  • P. S. Subramanian
    • 1
  1. 1.Theoretical Computer Science GroupTata Institute of Fundamental ResearchBombayIndia

Personalised recommendations