Skip to main content
SpringerLink
Log in

A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2002)

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

Included in the following conference series:

Abstract

Several constructions have been proposed for implementing a Bounded Concurrent Timestamp System (BCTS). Some constructions are based on a recursively defined Precedence Graph. Such constructions have been viewed as hard to understand and to prove correct. Other constructions that are based on the Traceable Use abstraction first proposed by Dwork and Waarts have been regarded as simple and have therefore been preferred. The Dwork-Waarts (DW) algorithm, however, is not space-efficient. Haldar and Vitanyi (HV) gave a more space-efficient construction based on Traceable Use, starting with only safe and regular registers as building blocks. In this paper, we present a new algorithm by making simple modifications to DW. Our algorithm is simple and is more memory-efficient than the DW and HV algorithms.

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

Access this chapter

Log in via an institution
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. K. Abrahamson, On achieving consensus using a shared memory, Proc. 7th ACM Symposium on Principles of Distributed Computing, 291–302, 1988.

    Google Scholar 

  2. H. Attiya and J. Welch, Distributed computing: Fundamentals, simulations and advanced topics, McGraw-Hill Publishing Company, London, UK, 1998.

    Google Scholar 

  3. D. Dolev and N. Shavit, Bounded concurrent time-stamping, SIAM Journal of Computing, 26(2): 418–455, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  4. C. Dwork, M. Herlihy, S. Plotkin and O. Waarts, Time-lapse snapshots, SIAM Journal of Computing, 28(5): 1848–1874, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  5. C. Dwork and O. Waarts, Simple and efficient bounded concurrent timestamping and the traceable use abstraction, Journal of the ACM, Vol. 46, pp. 633–666, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Fischer, N. Lynch, J. Burns and A. Borodin, Distributed Fifo allocation of identical resources using small shared space, ACM Transactions on Programming Language Systems, 11(1): 90–114, 1989.

    Article  Google Scholar 

  7. R. Gawlick, N. Lynch, N. Shavit, Concurrent timestamping made simple, Proc. Israeli Symp. on Computing and Systems, 171–183, LNCS 601, Springer, 1992.

    Google Scholar 

  8. S. Haldar and P. Vitanyi, Bounded concurrent timestamp systems using vector clocks, Journal of the ACM, Vol. 49, pp. 101–126, 2002.

    Article  MathSciNet  Google Scholar 

  9. A. Israeli and M. Li, Bounded timestamps, Proc. 28th IEEE Symposium on Foundations of Computer Science, pp. 371–382, 1987.

    Google Scholar 

  10. A. Israeli and M. Pinhasov, A concurrent timestamp scheme which is linear in time and space, Proc. Workshop on Distributed Algorithms, 95–109, LNCS 647, Springer-Verlag, 1992.

    Google Scholar 

  11. L. Lamport, A new solution to Dijkstra’s concurrent programming problem, Communications of the ACM, 17, 1974.

    Google Scholar 

  12. M. Li, J. Tromp and P. Vitanyi, How to share concurrent wait-free variables, Journal of the ACM, 43(4): 723–746, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  13. G. Peterson, Concurrent reading while writing, ACM Transactions on Programming Language Systems, 5(1): 46–55, 1983.

    Article  MATH  Google Scholar 

  14. T. Petrov, A. Pogosyants, S. Garland, V. Luchangco and N. Lynch, Computer-assisted verification of an algorithm for concurrent timestamps, Formal Description Techniques and Protocol Specification, Testing and Verification, FORTE/PSTV’96, IFIP Procs., pp. 29–44, 1996.

    Google Scholar 

  15. V. Shikaripura, A. Kshemkalyani A simple memory-efficient bounded concurrent timestamping algorithm, Technical Report UIC-CS-02-04, June 2002.

    Google Scholar 

  16. P. Vitanyi and B. Awerbuch, Shared register access by asynchronous hardware, Proc. 27th IEEE Symp. on Foundations of Computer Science, pp. 233–243, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Univ. of Illinois at Chicago, Chicago, IL, 60607, USA

    Vivek Shikaripura & Ajay D. Kshemkalyani

Authors
  1. Vivek Shikaripura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ajay D. Kshemkalyani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada, K1S 5B6

    Prosenjit Bose  & Pat Morin  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shikaripura, V., Kshemkalyani, A.D. (2002). A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-36136-7_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00142-3

  • Online ISBN: 978-3-540-36136-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation