A node count-independent logical clock for scaling lazy release consistency protocol

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 1999.

Cite

CITATION STYLE

APA

Arantes, L. B., Folliot, B., & Sens, P. (1999). A node count-independent logical clock for scaling lazy release consistency protocol. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 815–822). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_115

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free