A Distributed Data-balanced Dictionary Based on the B-link Tree (1992)
Download From
IEEE
Download Links
- [www.lcs.mit.edu]
- [ftp.cis.ufl.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 6th International Parallel Processing Symposium |
| Citations: | 24 - 5 self |
BibTeX
@INPROCEEDINGS{Johnson92adistributed,
author = {Theodore Johnson and Adrian Colbrook},
title = {A Distributed Data-balanced Dictionary Based on the B-link Tree},
booktitle = {In Proceedings of the 6th International Parallel Processing Symposium},
year = {1992},
pages = {319--325}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Many concurrent dictionary data structures have been proposed, but usually in the context of shared memory multiprocessors. In this paper, we present an algorithm for a concurrent distributed B-tree that can be implemented on message passing parallel computers. Our distributed B-tree (the dB-tree) replicates the interior nodes in order to improve parallelism and reduce message passing. We show how the dB-tree algorithm can be used to build an efficient, highly parallel, data-balanced distributed dictionary, the dE-tree. Keywords: Concurrent dictionary data structures, Message passing multiprocessor systems, Balanced search trees, B-link trees, Replica coherency. MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-530 c fl Massachusetts Institute of Technology 1992 Adrian Colbrook was supported in part by the National Science Foundation under grant CCR-8716884, by the Defense Advanced Research Projects Agency (DARPA) under Contract N00014-89-J-1988, by an equipment grant...
