Skip to main content
SpringerLink
Log in

Concurrent Knowledge and Logical Clock Abstractions

  • Conference paper
  • First Online:
FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2000)

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

  • 566 Accesses

Abstract

Vector and matrix clocks are exte sively used i asy chroous distributed systems.This paper asks,“how does the clock abstractio generalize?” and casts the problem in terms of concurrent knowledge. To this end, the paper motivates and proposes logical clocks of arbitrary dimensions. It then identifies and explores the conceptual link betwee such clocks and knowledge. It establishes the necessary and sufficient conditions on the size and dimension of clocks required to declare k -level concurrent knowledge about the most recent global facts for which this is possible without using control messages. It the gives algorithms to compute the latest global fact about which a specified level of knowledge is attainable in a given state, and to compute the earliest state in which a specified level of knowledge about a given global fact is attainable.

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. M. Chandy, L. Lamport, Finding global states of a distributed system, ACM Trans-actions on Computer Systems 3(1): 63–75, 1985.

    Article  Google Scholar 

  2. M. Chandy, J. Misra, How processes learn, Distributed Computing 1: 40–52, 1986.

    Article  MATH  Google Scholar 

  3. B. Charron-Bost, Concerning the size of clocks in distributed systems, Information Processing Letters 39: 11–16, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  4. C. Critchlow, K. Taylor, The inhibitio spectrum and the achievement of causal consistency, Distributed Computing 10(1): 11–27, 1996.

    Article  MathSciNet  Google Scholar 

  5. R. Fagin, J. Halpern, Y. Moses, M. Vardi, Reasoning about Knowledge,MIT Press, 1995.

    Google Scholar 

  6. C. Fidge, Timestamps in message-passing systems that preserve partial ordering, Australian Computer Science Communications 10(1): 56–66, Feb.1988.

    Google Scholar 

  7. J. Halpern, R. Fagin, Modeling knowledge and action in distributed systems, Dis-tributed Computing 3(4): 139–179, 1989.

    Google Scholar 

  8. J. Halpern, Y. Moses, Knowledge and commo knowledge in a distributed environment, Journal of the ACM 37(3): 549–587, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  9. N. Krishnakumar, A. Bernstei, Bounded ignorance in replicated systems, Proc. ACM Symp. on Principles of Database Systems 1991.

    Google Scholar 

  10. A. Kshemkalyani, Temporal interactions of intervals in distributed systems, Journal of Computer and System Sciences 52(2): 287–298, Apr.1996.

    Article  MathSciNet  Google Scholar 

  11. A. Kshemkalyani, Causality and atomicity in distributed computations, Distributed Computing 11(4): 169–189, Oct.1998.

    Article  Google Scholar 

  12. A. Kshemkalyani, On continuously attaining levels of concurrent knowledge without control messages, Tech. Rep.UIC-EECS-98-6, Univ. Illinois at Chicago,1998.

    Google Scholar 

  13. L. Lamport, Time,clocks,and the ordering of events in a distributed system, Communications of the ACM 21(7): 558–565, July 1978.

    Article  MATH  Google Scholar 

  14. F. Mattern, Virtual time and global states of distributed systems, Parallel and Distributed Algorithms North-Holland, pp 215–226, 1989.

    Google Scholar 

  15. S. Meldal, S. Sankar, J. Vera, Exploiting locality in maintaining potential causality, Proc. 10th ACM Symp. on Principles of Distributed Computing 231–239, 1991.

    Google Scholar 

  16. P. Panangade, K. Taylor, Concurrent commo knowledge: Defining agreement for asy chronous systems, Distributed Computing 6(2): 73–94, Sept.1992.

    Article  MathSciNet  Google Scholar 

  17. R. Parikh, P. Krasucki, Levels of knowledge in distributed computing, Sadhana Journal 17(1): 167–191, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  18. S. Sarin, N. Lynch, Discarding obsolete information in a distributed database system, IEEE Transactions on Software Engineering 13(1): 39–46, 1987.

    Article  Google Scholar 

  19. M. Singhal, A. Kshemkalyani, Efficient implementation of vector clocks, Information Processing Letters 43, 47–52, Aug.1992.

    Article  MATH  Google Scholar 

  20. G. Wuu, A. Bernstei, Effcient solutions to the replicated log and dictionary problems, Proc. 3rd ACM Symp. on Principles of Distributed Computing 232–242,1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of EECS, University of Illinois at Chicago, IL 60607-7053, Chicago, USA

    Ajay D. Kshemkalyani

Authors
  1. Ajay D. Kshemkalyani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Delhi, Hauz Khas, 110016, New Delhi, India

    Sanjiv Kapoor  & Sanjiva Prasad  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kshemkalyani, A.D. (2000). Concurrent Knowledge and Logical Clock Abstractions. In: Kapoor, S., Prasad, S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44450-5_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-44450-5_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44450-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation