Skip to main content
SpringerLink
Log in

Fairness of shared objects

Extended abstract

  • Contributed Papers
  • Conference paper
  • First Online:
Distributed Computing (DISC 1998)

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

Included in the following conference series:

Abstract

Fairness in concurrent systems can be viewed as an abstraction that bridges low-level timing guarantees and make them available to programmers with a minimal loss of power and a maximal ease of use. We investigate the implementation and power of a range of fairness models that are appropriate to the synchronous, semi-synchronous and asynchronous contexts of various concurrent systems.

Part of this work was performed while visiting at AT&T Labs.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, H. Attiya, and G. Taubenfeld. Time-adaptive algorithms for synchronization. SIAM Journal on Computing, 26(2):539–556, April 1997.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Alur and T. Henzinger. Finitary fairness. In Proc. 9th IEEE Symp. on Logic in Computer Science, pages 52–61, 1994.

    Google Scholar 

  3. R. Alur and G. Taubenfeld. How to share an object: A fast timing-based solution. In Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing, pages 470–477, December 1993.

    Google Scholar 

  4. R. Alur and G. Taubenfeld. Fast timing-based algorithms. Distributed Computing, 10:1–10, 1996.

    Article  Google Scholar 

  5. H. Attiya and T. Djerassi-Shintel. Time bounds for decision problems in the presence of timing uncertainty and failures. Lecture Notes in Computer Science, 725, 1993.

    Google Scholar 

  6. H. Attiya, C. Dwork, N. Lynch, and L. Stockmeyer. Bounds on the time to reach agreement in the presence of timing uncertainty. In Proc. 23rd ACM Symp. on Theory of Computing, pages 359–369, May 1991.

    Google Scholar 

  7. H. Brit and S. Moran. Wait-freeom vs. bounded wait-freeom in public data structures. In Proc. 13th ACM Symp. on Principles of Distributed Computing, pages 52–60, August 1994.

    Google Scholar 

  8. J. N. Burns and N. A. Lynch. Bounds on shared-memory for mutual exclusion. Information and Computation, 107(2):171–184, December 1993. (Also, in Proc. of 18th Annual Allerton Conference on Communication, Control and Computing, 1980, pages 833–842.).

    Article  MATH  MathSciNet  Google Scholar 

  9. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288–323, 1988.

    Article  MathSciNet  Google Scholar 

  10. F. Fich, M. Herlihy, and N. Shavit. On the space complexity of randomized synchronization. In Proc. 12th ACM Symp. on Principles of Distributed Computing, pages 241–250, August 1993.

    Google Scholar 

  11. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374–382, April 1985.

    Article  MATH  MathSciNet  Google Scholar 

  12. N. Francez. Fairness. Springer-Verlag, 1986.

    Google Scholar 

  13. S. A. Friedberg and G. L. Peterson. An efficient solution to the mutual exclusion problem using weak semaphores. Information Processing Letters, 25(5):343–347, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  14. M. Herlihy. Wait-free synchronization. ACM Trans. on Programming Languages and Systems, 11(1):124–149, January 1991.

    Article  Google Scholar 

  15. A. Herzberg and S. Kutten. Efficient detection of message forwarding faults. In Proc. 8th ACM Symp. on Principles of Distributed Computing, pages 339–353, 1989.

    Google Scholar 

  16. D. N. Jayasimha and N. Dershowitz. Bounded fairness. Technical Report 615, Center for Supercomputing Research and Development, University of Illinois, Urbana, IL, December 1986.

    Google Scholar 

  17. L. Lamport. The mutual exclusion problem: Part I — a theory of interprocess communication. Journal of the ACM, 33:313–326, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  18. L. Lamport. A fast mutual exclusion algorithm. ACM Trans. on Computer Systems, 5(1):1–11, 1987.

    Article  Google Scholar 

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

    MathSciNet  Google Scholar 

  20. R. Lubitch and S. Moran. Closed schedulers: a novel technique for analyzing asynchronous protocols. Distributed Computing, 8(4):203–210, 1995.

    Article  Google Scholar 

  21. N. Lynch and N. Shavit. Timing-based mutual exclusion. In Proceedings of the 13th IEEE Real-Time Systems Symposium, pages 2–11, December 1992.

    Google Scholar 

  22. G. L. Peterson. New bounds on mutual exclusion problems. Technical Report TR68, University of Rochester, February 1980 (Corrected, Nov. 1994).

    Google Scholar 

  23. S. Ramamurthy, M. Moir, and J. H. Anderson. Real-time object sharing with minimal system support (extended abstract). In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 233–242, May 1996.

    Google Scholar 

  24. Paul G. Spirakis and Basil Tampakas. Efficient distributed algorithms by using the Archimedean time assumption. In 5th Annual Symposium on Theoretical Aspects of Computer Science, volume 294 of lncs, pages 248–263. Springer, 1988.

    Google Scholar 

  25. Paul M. B. Vitányi. Distributed elections in an Archimedean ring of processors (preliminary version). In Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pages 542–547, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Labs, 180 Park Av., 07932-0971, Florham Park, NJ

    Michael Merritt

  2. The Open University, 16 Klausner st., P.O.B. 39328, 61392, Tel-Aviv, Israel

    Gadi Taubenfeld

Authors
  1. Michael Merritt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gadi Taubenfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Shay Kutten

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Merritt, M., Taubenfeld, G. (1998). Fairness of shared objects. In: Kutten, S. (eds) Distributed Computing. DISC 1998. Lecture Notes in Computer Science, vol 1499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056491

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65066-9

  • Online ISBN: 978-3-540-49693-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation