77 search results - page 9 / 16 » Symbolic prefetching in transactional distributed shared mem... |
CORR
2009
Springer
13 years 5 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...
CSCW
2008
ACM
13 years 9 months ago
2008
ACM
This paper describes an ethnographic study conducted to explore the possibilities for future design and development of technological support for trauma teams. We videotaped 10 tra...
IEEEPACT
2005
IEEE
14 years 1 months ago
2005
IEEE
Coherence misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. Memory streaming prov...
HPCA
1998
IEEE
13 years 11 months ago
1998
IEEE
The goal of this paper is to gain insight into the relative performance of communication mechanisms as bisection bandwidth and network latency vary. We compare shared memory with ...
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...