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

Authors:
Luciana Bezerra Arantes;Bertil Folliot;Pierre Sens
Affiliations:
-;-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 7
Cited 0

Logical Time in Distributed Computing Systems

Computer - Distributed computing systems: separate resources acting as one
Concerning the size of logical clocks in distributed systems

Information Processing Letters
SPLASH: Stanford parallel applications for shared-memory

ACM SIGARCH Computer Architecture News
An efficient implementation of vector clocks

Information Processing Letters
TreadMarks: Shared Memory Computing on Networks of Workstations

Computer
Performance evaluation of two home-based lazy release consistency protocols for shared virtual memory systems

OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Plausible Clocks: Constant Size Logical Clocks for Distributed Systems

WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.