Skip to main content

On the power of multi-objects

  • Contributed Papers
  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1320))

Included in the following conference series:

Abstract

In the standard “single-object” model of shared-memory computing, it is assumed that a process accesses at most one shared object in each of its steps. A (more powerful) variant is the “multi-object” model in which each process may access an arbitrary finite number of shared objects simultaneously in each atomic step. In this paper, we present results that relate the synchronization power of a type in the multi-object model to its synchronization power in the single-object model. Afek, Merritt, and Taubenfeld considered the case where one could access up to a given number of objects simultaneously as well as the case where one could access any finite number of objects simultaneously in a single atomic step. We consider only the case where one may access an arbitrary finite number of objects simultaneously.

Although the types fetch&add and swap have the same synchronization power in the single-object model, Afek, Merritt, and Taubenfeld showed that their synchronization powers differ in the multi-object model [AMT96]. We prove that this divergence phenomenon is exhibited only by types at levels 1 and 2; all higher level types have the same unbounded synchronization power in the multi-object model.

This paper identifies all possible relationships between a type's synchronization power in the single-object model and its synchronization power in the multi-object model, where as many objects of one type as required may be accessed in a single atomic step.

Work supported by NSF grant CCR-9410421, and Dartmouth College Startup grant.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. Atomic snapshots of shared memory. Journal of the ACM, 40(4):873–890, 1993.

    Article  Google Scholar 

  2. Y. Afek, M. Merritt, and G. Taubenfeld. The power of multi-objects. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, May 1996.

    Google Scholar 

  3. J. Anderson. Composite registers. Distributed Computing, 6(3):141–154, 1993.

    Article  Google Scholar 

  4. B. Chor, A. Israeli, and M. Li. Wait-free consensus using asynchronous hardware. SIAM Journal on Computing, 23(4):701–712, August 1994.

    Article  Google Scholar 

  5. D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77–97, January 1987.

    Article  Google Scholar 

  6. M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. JACM, 32(2):374–382, 1985.

    Article  Google Scholar 

  7. M.P. Herlihy and J.M. Wing. Linearizability: A Correctnes Condition for Concurrent Objects. ACM TOPLAS, 12(3):463–492, 1990.

    Article  Google Scholar 

  8. M.P. Herlihy. Wait-free synchronization. ACM TOPLAS, 13(1):124–149, 1991.

    Article  Google Scholar 

  9. M.C. Loui and H.H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in computing research, 4:163–183, 1987.

    Google Scholar 

  10. M. Merritt and G. Taubenfeld. Atomic m-register operations. Distributed Computing, 7:213–221, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marios Mavronicolas Philippas Tsigas

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jayanti, P., Khanna, S. (1997). On the power of multi-objects. In: Mavronicolas, M., Tsigas, P. (eds) Distributed Algorithms. WDAG 1997. Lecture Notes in Computer Science, vol 1320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030693

Download citation

  • DOI: https://doi.org/10.1007/BFb0030693

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63575-8

  • Online ISBN: 978-3-540-69600-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics