1156 search results - page 7 / 232 » Efficient Barriers for Distributed Shared Memory Computers |
CORR
2009
Springer
14 years 11 months ago
2009
Springer
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
HPCC
2005
Springer
15 years 6 months ago
2005
Springer
Distributed JVM systems enable concurrent Java applications to transparently run on clusters of commodity computers by supporting Java’s shared-memory model over multiple JVMs di...
104
click to vote
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
Synchronization operations, such as fence and locking, are used in many parallel operations accessing shared memory. However, a process which is blocked waiting for a fence operat...
136
click to vote
ICPP
1999
IEEE
15 years 5 months ago
1999
IEEE
The probability of failures in software distributed shared memory (SDSM) increases as the system size grows. This paper introduces a new, efficient message logging technique, call...
110
click to vote
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
In this paper, we propose a new, efficient logging protocol, called lazy logging, and a fast crash recovery protocol, called the prefetch-based crash recovery (PCR), for software ...