The input/output complexity of sorting and related problems
Communications of the ACM
Parallel algorithms for red-black trees
Theoretical Computer Science
Performance of B+ tree concurrency control algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
Concurrency Control in B-Trees with Batch Updates
IEEE Transactions on Knowledge and Data Engineering
Parallel Dictionaries in 2-3 Trees
Proceedings of the 10th Colloquium on Automata, Languages and Programming
External memory data structures
Handbook of massive data sets
Concurrent cache-oblivious b-trees
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
An Efficient Implementation of Search Trees on [lg N + 1] Processors
IEEE Transactions on Computers
Provably good multicore cache performance for divide-and-conquer algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fundamental parallel algorithms for private-cache chip multiprocessors
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Cache-efficient dynamic programming algorithms for multicores
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
A Bridging Model for Multi-core Computing
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Parallel external memory model - a parallel model for multi-core architectures
Parallel external memory model - a parallel model for multi-core architectures
Low depth cache-oblivious algorithms
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Resource oblivious sorting on multicores
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Geometric algorithms for private-cache chip multiprocessors
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
Computational geometry in the parallel external memory model
SIGSPATIAL Special
| Hi-index | 0.00 |
We present the parallel buffer tree, a parallel external memory (PEM) data structure for batched search problems. This data structure is a non-trivial extension of Arge's sequential buffer tree to a private-cache multiprocessor environment and reduces the number of I/O operations by the number of available processor cores compared to its sequential counterpart, thereby taking full advantage of multicore parallelism. The parallel buffer tree is a search tree data structure that supports the batched parallel processing of a sequence of N insertions, deletions, membership queries, and range queries in the optimal OhOf(psortN + K/PB) parallel I/O complexity, where K is the size of the output reported in the process and psortN is the parallel I/O complexity of sorting N elements using P processors.