559 search results - page 44 / 112 » Algorithms and Data Structures for External Memory |
160
click to vote
PPOPP
2006
ACM
15 years 8 months ago
2006
ACM
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
146
click to vote
ADC
2008
Springer
15 years 8 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
150
click to vote
PPOPP
2006
ACM
15 years 8 months ago
2006
ACM
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...
114
click to vote
FCCM
2006
IEEE
15 years 8 months ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
147
Voted
PLDI
2012
ACM
13 years 4 months ago
2012
ACM
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...