Skip to main content

Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions

  • Conference paper
  • First Online:
Distributed Computing (DISC 1999)

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

Included in the following conference series:

Abstract

The cost of usingmessag e-passing to implement linearizable read/write objects for shared memory multiprocessors with drifting clocks is studied. We take as cost measures the response times for perform- ing read and write operations in distributed implementations of virtual shared memory consistingof such objects. A collection of necessary con- ditions on these response times are presented for a large family of as- sumptions on the network delays. The assumptions include the common one of lower and upper bounds on delays, and bounds on the difference between delays in opposite directions. In addition, we consider broadcast networks, where each message sent from one node arrives at all other nodes at approximately the same time.

The necessary conditions are stated in the form of “gaps” on the values that the response times may attain in any arbitrary execution of the system; the ends of the gap intervals depend solely on the delays in a particular execution, and on certain fixed parameters of the system that express each specific delay assumptions. The proofs of these necessary conditions are comprehensive and modular; they consist of two major components. The first component is independent of any particular type of delay assumptions; it constructs a “counter-example” execution, which respects the delay assumptions only if it is not linearizable. The second component must be tailored for each specific delay assumption; it derives necessary conditions for any linearizable implementation by requiring that the “counter-example” execution does not respect the specific delay assumptions.

Our results highlight inherent limitations on the best possible cost for each specific execution of a linearizable implementation. Moreover, our results imply lower bounds on the worst possible such costs as well; inter- estingly, for the last two assumptions on mesage delays, these worst-case lower bounds are products of the drifting factor of the clocks and the delay uncertainty inherent for the specific assumption.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Attiya, A. Herzberg, and S. Rajsbaum, “Optimal Clock Synchronization under Different Delay Assumptions,” SIAM Journal on Computing, Vol. 25,No. 2, pp. 369–389, April 1996.

    Article  MATH  MathSciNet  Google Scholar 

  2. H. Attiya and J. L. Welch, “Sequential Consistency versus Linearizability,” ACM Transactions on Computer Systems, Vol. 12,No. 2, pp. 91–122, May 1994.

    Article  Google Scholar 

  3. S. Chaudhuri, R. Gawlick, and N. Lynch, “Designing Algorithms for Distributed Systems Using Partially Synchronized Clocks,” Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pp. 121–132, August 1993.

    Google Scholar 

  4. D. Dolev, R. Reischuk, and H. R. Strong, “Observable Clock Synchronization,” Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pp. 284–293, August 1994.

    Google Scholar 

  5. R. Friedman, “Implementing High-Level Synchronization Operations in Hybrid Consistency,” Distributed Computing, Vol. 9,No. 3, pp. 119–129, December 1995.

    Article  Google Scholar 

  6. J. Halpern and I. Suzuki, “Clock Synchronization and the Power of Broadcasting,” Proceedings of the 28th Annual Allerton Conference on Communication, Control and Computing, pp. 588–597, October 1990.

    Google Scholar 

  7. M. Herlihy and J. Wing, “Linearizability: A Correctness Condition for Concurrent Objects,” ACM Transactions on Programming Languages and Systems, Vol. 12,No. 3, pp. 463–492, July 1990.

    Article  Google Scholar 

  8. J. Kleinberg, H. Attiya, and N. Lynch, “Trade-offs Between Message Delivery and Quiesce Times in Connection Management Protocols,” Proceedings of the 3rd Israel Symposium on the Theory of Computing and Systems, pp. 258–267, January 1995.

    Google Scholar 

  9. M. J. Kosa, “Making Operations of Concurrent Data Types Fast,” Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pp. 32–41, August 1994.

    Google Scholar 

  10. J. Lundelius and N. Lynch, “An Upper and Lower Bound for Clock Synchronization,” Information and Control, Vol. 62, pp. 190–204, August/September 1984.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Mavronicolas and N. Papadakis, “Trade-off Results for Connection Management,” Proceedings of the 11th International Symposium on Fundamentals of Computation Theory, pp. 340–351, Lecture Notes in Computer Science, Vol. 1279, Springer-Verlag, Krakow, Poland, September 1997.

    Chapter  Google Scholar 

  12. M. Mavronicolas and D. Roth, “Efficient, Strongly Consistent Implementations of Shared Memory,” Proceedings of the 6th International Workshop on Distributed Algorithms (WDAG’92), pp. 346–361, Lecture Notes in Computer Science, Vol. # 647, Springer-Verlag, November 1992.

    Google Scholar 

  13. B. Patt-Shamir and S. Rajsbaum, “A Theory of Clock Synchronization,” Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pp. 810–819, May 1994.

    Google Scholar 

  14. K. Sugihara and I. Suzuki, “Nearly Optimal Clock Synchronization under Unbounded Message Transmission Time,” Proceedings of the 3rd International Conference on Parallel Processing, pp. 14–17, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eleftheriou, M., Mavronicolas, M. (1999). Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions. In: Jayanti, P. (eds) Distributed Computing. DISC 1999. Lecture Notes in Computer Science, vol 1693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48169-9_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-48169-9_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66531-1

  • Online ISBN: 978-3-540-48169-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics