Sciweavers

12453 search results - page 4 / 2491
» Concurrent Data Structures
Sort
View
SPAA
2005
ACM
15 years 3 months ago
Concurrent cache-oblivious b-trees
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 ...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert...
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
14 years 11 months ago
The hyperring: a low-congestion deterministic data structure for distributed environments
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...
Baruch Awerbuch, Christian Scheideler
50
Voted
CONCURRENCY
2006
80views more  CONCURRENCY 2006»
14 years 10 months ago
How to bring together fault tolerance and data consistency to enable Grid data sharing
Gabriel Antoniu, Jean-François Deverge, S&e...
PLDI
2012
ACM
13 years 15 days ago
Concurrent data representation synthesis
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...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
PPOPP
2012
ACM
13 years 5 months ago
A methodology for creating fast wait-free data structures
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. ...
Alex Kogan, Erez Petrank