5 search results - page 1 / 1 » Efficient Algorithms for Checking the Atomicity of a Run of ... |
WDAG
1993
Springer
13 years 9 months ago
1993
Springer
CAV
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...
DC
2010
13 years 1 months ago
2010
In this paper, we present RAMBO, an algorithm for emulating a read/write distributed shared memory in a dynamic, rapidly changing environment. RAMBO provides a highly reliable, hi...
HPCA
1996
IEEE
13 years 9 months ago
1996
IEEE
Networks of workstations and high-performance microcomputers have been rarely used for running highperformance applicationslike multimedia, simulations,scientific and engineering ...
JSS
2008
13 years 5 months ago
2008
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 inclu...