175 search results - page 18 / 35 » Scalable Fault-Tolerant Distributed Shared Memory |
HPCA
2007
IEEE
14 years 10 months ago
2007
IEEE
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by eliminating the need for locks and their associated problems (deadlock, livelock, pr...
CCGRID
2008
IEEE
14 years 4 months ago
2008
IEEE
Distributed applications tend to have a complex design due to issues such as concurrency, synchronization and communication. Researchers in the past have proposed abstractions to ...
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
Our recent work on uniprocessor and single-node multiprocessor (SMP) active memory systems uses address remapping techniques in conjunction with extended cache coherence protocols...
PODC
2010
ACM
14 years 1 months ago
2010
ACM
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
ISCA
1996
IEEE
14 years 1 months ago
1996
IEEE
Parallel workstations, each comprising 10-100 processors, promise cost-effective general-purpose multiprocessing. This paper explores the coupling of such small- to medium-scale s...