A parametrized algorithm that implements sequential, causal, and cache memory consistencies
comunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7038
comunitat-uji-handle3:10234/8634
comunitat-uji-handle4:
INVESTIGACIONAquest recurs és restringit
http://dx.doi.org/10.1016/j.jss.2007.03.012 |
Metadades
Títol
A parametrized algorithm that implements sequential, causal, and cache memory consistenciesData de publicació
2008Editor
ElsevierISSN
1641212Cita bibliogràfica
Journal of Systems and Software, 81, 1, p. 120-131Tipus de document
info:eu-repo/semantics/articleParaules clau / Matèries
Resum
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 ... [+]
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 algorithm, however, all the write operations and some read operations are fast when implementing sequential consistency. The algorithm uses propagation and full replication, where the values written by a process are propagated to the rest of the processes. It works in a cyclic turn fashion, with each process of the DSM system, broadcasting one message in turn. The values written by the process are sent in the message (instead of sending one message for each write operation): However, unnecessary values are excluded. All this permits the amount of message traffic owing to the algorithm to be controlled. © 2007 Elsevier Inc. All rights reserved. [-]
Drets d'accés
http://rightsstatements.org/vocab/CNE/1.0/
info:eu-repo/semantics/restrictedAccess
info:eu-repo/semantics/restrictedAccess
Apareix a les col.leccions
- LSI_Articles [362]