77 search results - page 7 / 16 » Symbolic prefetching in transactional distributed shared mem... |
IEEEPACT
2006
IEEE
14 years 1 months ago
2006
IEEE
Transactional memory is an attractive design concept for scalable multiprocessors because it offers efficient lock-free synchronization and greatly simplifies parallel software....
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....
ICPP
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
The saturation strategy for symbolic state-space generation is very effective for globally-asynchronous locally-synchronous discrete-state systems. Its inherently sequential natu...
HPCC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract--Transactional Memory (TM) is an emerging technology which promises to make parallel programming easier. However, to be efficient, underlying TM system should protect only...