Concurrent operations on B*-trees with overtaking
Journal of Computer and System Sciences
Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
Transputer reference manual
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Dictionary machines with a small number of processors
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
PROTEUS: A HIGH-PERFORMANCE PARALLEL-ARCHITECTURE SIMULATOR
PROTEUS: A HIGH-PERFORMANCE PARALLEL-ARCHITECTURE SIMULATOR
Grid-based distributed search structure
Proceedings of the 44th annual Southeast regional conference
| Hi-index | 0.00 |
In this paper we describe a new algorithm for maintaining a balanced search tree on a message-passing MIMD architecture; the algorithm is particularly well suited for implementation on a small number of processors. We introduce a (2B驴2, 2B) search tree that uses a bidirectional ring of O(log n) processors to store n entries. Update operations use a bottom-up node-splitting scheme, which performs significantly better than top-down search tree algorithms. The bottom-up algorithm requires many fewer messages and results in less blocking due to synchronization than top-down algorithms. Additionally, for a given cost ratio of computation to communication the value of B may be varied to maximize performance. Implementations on a parallel-architecture simulator are described.