A Node Count-Independent Logical Clock for Scaling Lazy Release Consistency Protocol

  • Luciana Bezerra Arantes⋆
  • Bertil Folliot
  • Pierre Sens
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1685)


The use of per processor vector logical clocks in lazy release consistency (LRC) protocol implementation may restrict its scalability since the size of these clocks depends on the number of nodes of the system. We propose a new logical clock, the barrier-lock, whose concept is based on the causality of synchronization operations. Its size is proportional to the number of synchronization variables used by the application, being not affected by the number of nodes of the system.


Shared Memory Release Operation Distribute Shared Memory Vector Clock Synchronization Message 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    C. Amza, A. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony and W. Zwaenepoel. TreadMarks: Shared Memory Computing on Networks of Workstations. IEEE Computer, 29(2):18–28, February 1996.Google Scholar
  2. [2]
    D. Bailey, J. Barton, T. Lasinski and H. Simon. The NAS Parallel Benchmark. Technical Report 103863, NASA, July 1993.Google Scholar
  3. [3]
    B. Charon-Bost. Concerning the Size of Logical Clocks. Information Processing Letters, 39:11–16, July 1991.Google Scholar
  4. [4]
    C. Fidge. Logical Time in Distributed Computing Systems. IEEE Computer, 24(8):28–33, August 1991.Google Scholar
  5. [5]
    J. Fowler and W. Zwaenepoel. Causal Distributed Breakpoints. In the 10th International Conference on Distribute Computing Systems, pages 131–41, 1990.Google Scholar
  6. [6]
    F. Mattern. Virtual Time and Global States in Distributed Systems. In Workshop on Parallel and Distributed Algorithms, Elsevier (Holland), October 1988.Google Scholar
  7. [7]
    P. Singh, W. Weber and A. Gupta. SPLASH: Stanford Parallel Applications for Shared-memory. Computer Architecture News, 20(1):5–44, March 1992.Google Scholar
  8. [8]
    M. Singhal, M. and A. Kshemkalyani. An Efficient Implementation of Vector Clocks. Information Processing Letters, 33:47–53, August, 1992.Google Scholar
  9. [9]
    F. Torres-Rojas, F. and M. Ahamad, Plausible Clocks: Constant Size Logical Clocks for Distributed Systems. In the 10th International Workshop on Distributed Algorithms,Bologna(Italy), Octobre, 1996.Google Scholar
  10. [10]
    Y. Zhou, L. Iftode and K. Li. Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Virtual Memory Systems. In the 2nd Symposium on Operating Systems Design and Implementation, Octobre 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Luciana Bezerra Arantes⋆
    • 1
  • Bertil Folliot
    • 1
  • Pierre Sens
    • 1
  1. 1.LIP6 LaboratoryUniversit Pierre et Marie CurieParis Cedex 05France

Personalised recommendations