Name
Abstract | ||
|---|---|---|
Many concurrent dictionary data structures have been proposed, but usuallyin the context of shared memory multiprocessors. In this paper, we present analgorithm for a concurrent distributed B-tree that can be implemented on messagepassing computer systems. Our distributed B-tree (the dB-tree) replicates theinterior nodes in order to improve parallelism and reduce message passing. ThedB-tree stores some redundant information in its nodes to permit the use of lazyupdates to maintain... |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1142/S0129053394000238 | International Journal of High Speed Computing |
Keywords | Field | DocType |
data structure,message passing | Replica,Data structure,Shared memory,Computer science,Parallel computing,Message passing,Distributed computing | Journal |
Volume | Issue | Citations |
6 | 4 | 2 |
PageRank | References | Authors |
0.54 | 15 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Theodore Johnson | 1 | 97 | 35.24 |
| Adrian Colbrook | 2 | 403 | 114.95 |