12453 search results - page 18 / 2491 » Concurrent Data Structures |
WDAG
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. First-in-first-out (FIFO) queues are among the most fundamental and highly studied concurrent data structures. The most effective and practical dynamic-memory concurren...
106
click to vote
ICSE
2010
IEEE-ACM
15 years 4 months ago
2010
IEEE-ACM
We present views, a new approach to controlling concurrency. Fine-grained locking is often necessary to increase concurrency. Correctly implementing fine-grained locking with tod...
112
click to vote
SOCA
2010
IEEE
14 years 10 months ago
2010
IEEE
In asynchronous event systems, the production of an event is decoupled from its consumption via an event queue. The loose coupling of such systems allows great flexibility as to ...
102
click to vote
DAWAK
2001
Springer
15 years 4 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
105
click to vote
PPOPP
1990
ACM
15 years 3 months ago
1990
ACM
Toprogrammassivelyconcurrent MIMDmachines, programmersneed tools for managingcomplexity. One important tool that has been used in the sequential programmingworld is hierarchies of...