A distributed data-balanced dictionary based on the B-link tree

Many concurrent dictionary data structures have been proposed, but usually in the context of shared memory multiprocessors. The paper presents an algorithm for a concurrent distributed B-tree that can be implemented on message passing parallel computers. This distributed B-tree (the dB-tree) replica...

Full description

Saved in:
Bibliographic Details
Published inProceedings Sixth International Parallel Processing Symposium pp. 319 - 324
Main Authors Johnson, T., Colbrook, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1992
Subjects
Costs
Data engineering
Data structures
Delay
Dictionaries
Memory architecture
Message passing
Parallel processing
Tree data structures
Writing
Online AccessGet full text

Cover

More Information
Summary:Many concurrent dictionary data structures have been proposed, but usually in the context of shared memory multiprocessors. The paper presents an algorithm for a concurrent distributed B-tree that can be implemented on message passing parallel computers. This distributed B-tree (the dB-tree) replicates the interior nodes in order to improve parallelism and reduce message passing. It is shown how the dB-tree algorithm can be used to build an efficient, highly parallel, data-balanced distributed dictionary, the dE-tree.< >
ISBN:0818626720
9780818626722
DOI:10.1109/IPPS.1992.223026