1075 search results - page 84 / 215 » Parallel Programming with Transactional Memory |
134
click to vote
POPL
1998
ACM
15 years 9 months ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
143
click to vote
SPAA
1995
ACM
15 years 8 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
133
click to vote
ICLP
1999
Springer
15 years 9 months ago
1999
Springer
A central service of a constraint programming system is search. In almost all constraint programming systems search is based on trailing, which is well understood and known to be ...
257
click to vote
ASPLOS
2011
ACM
14 years 8 months ago
2011
ACM
Deterministic replay systems record and reproduce the execution of a hardware or software system. In contrast to replaying execution on uniprocessors, deterministic replay on mult...
159
click to vote
ICS
2000
Tsinghua U.
15 years 8 months ago
2000
Tsinghua U.
Memory system bottlenecks limit performance for many applications, and computations with strided access patterns are among the hardest hit. The streams used in such applications h...