Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/IPPS.1992.223026 | Beverly Hills, CA |
Keywords | Field | DocType |
b-link tree,parallel computer,shared memory multiprocessors,db-tree algorithm,distributed data-balanced dictionary based,data-balanced dictionary,concurrent dictionary data structure,interior node,message passing,balance,database theory,writing,distributed databases,algorithms,data structures,parallel processing,parallel programming,nodes,data management,structures,tree data structures,dictionaries,parallel algorithms,data engineering | Data structure,Shared memory,Parallel algorithm,Computer science,Parallel computing,Tree (data structure),Distributed algorithm,Distributed database,Message passing,Memory architecture,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-8186-2672-0 | 22 | 2.58 |
References | Authors | |
18 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Theodore Johnson | 1 | 22 | 2.58 |
| Adrian Colbrook | 2 | 403 | 114.95 |