84 search results - page 7 / 17 » Nonblocking Concurrent Data Structures with Condition Synchr... |
SPAA
2010
ACM
14 years 6 days ago
2010
ACM
Traditional data structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. We introduce a new synchronization paradi...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
MICRO
2000
IEEE
13 years 11 months ago
2000
IEEE
Many data-parallel applications, including emerging media applications, have regular structures that can easily be expressed as a series of arithmetic kernels operating on data st...
JSA
2006
13 years 7 months ago
2006
This paper proposes a new concurrent data structure, called parallel hash table, for synchronizing the access of multiple threads to resources stored in a shared buffer. We prove ...
JPDC
2006
13 years 7 months ago
2006
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...