Sciweavers

JSS
2008

A parametrized algorithm that implements sequential, causal, and cache memory consistencies

13 years 3 months ago
A parametrized algorithm that implements sequential, causal, and cache memory consistencies
In this paper, we present an algorithm that can be used to implement sequential, causal, or cache consistency in distributed shared memory (DSM) systems. For this purpose it includes a parameter that allows us to choose the consistency model to be implemented. If all processes run the algorithm with the same value in this parameter, the corresponding consistency is achieved. (Additionally, the algorithm tolerates that processes use certain combination of parameter values.) This characteristic allows a concrete consistency model to be chosen, but implements it with the more efficient algorithm in each case (depending of the requirements of the applications). Additionally, as far as we know, this is the first algorithm proposed that implements cache coherence. In our algorithm, all the read and write operations are executed locally when implementing causal and cache consistency (i.e., they are fast). It is known that no sequential algorithm has only fast memory operations. In our algori...
Ernesto Jiménez, Antonio Fernández,
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2008
Where JSS
Authors Ernesto Jiménez, Antonio Fernández, Vicent Cholvi
Comments (0)