12453 search results - page 4 / 2491 » Concurrent Data Structures |
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to a parallel or distributed setting and present three concurrent CO B-trees. Our ...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
CONCURRENCY
2006
13 years 8 months ago
2006
PLDI
2012
ACM
11 years 11 months ago
2012
ACM
We describe an approach for synthesizing data representations for concurrent programs. Our compiler takes as input a program written using concurrent relations and synthesizes a r...
PPOPP
2012
ACM
12 years 4 months ago
2012
ACM
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...