Sciweavers

559 search results - page 26 / 112
» Algorithms and Data Structures for External Memory
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
15 years 22 days ago
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
Gerth Stølting Brodal, Erik D. Demaine, Jer...
WDAG
2010
Springer
216views Algorithms» more  WDAG 2010»
15 years 5 days ago
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
Francois Carouge, Michael F. Spear
138
Voted
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 6 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 6 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
120
Voted
PLDI
2003
ACM
15 years 7 months ago
CCured in the real world
CCured is a program transformation system that adds memory safety guarantees to C programs by verifying statically that memory errors cannot occur and by inserting run-time checks...
Jeremy Condit, Matthew Harren, Scott McPeak, Georg...