Name
Abstract | ||
|---|---|---|
The authors describe a new concurrent B-tree algorithm. The algorithm is designed to work well in large-scale parallel or distributed systems in which the number of processors sharing the tree is large or the communication delay between processors (or between processors and the global memory for a shared-memory system) is large relative to the speed of local computation. The basis of the algorithm is an abstraction that is similar to coherent shared memory, but provides a weaker semantics; this abstraction is called multiversion memory. Multi-version memory uses caches but weakens the semantics of ordinary shared memory by allowing process reading data to be given an old version of the data. This semantics is adequate for the non-leaf nodes in the B-tree algorithms presented. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1109/SPDP.1990.143621 | Dallas, TX |
Keywords | Field | DocType |
distributed system,algorithm design and analysis,shared memory,parallel systems,databases,distributed systems,memory management,parallel algorithms,data structures,computer science,technology management,abstraction | Interleaved memory,Uniform memory access,Shared memory,Computer science,Parallel computing,Cache-only memory architecture,Distributed memory,Theoretical computer science,Memory management,Memory map,Distributed shared memory,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-8186-2087-0 | 14 | 4.87 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| William E. Weihl | 1 | 2614 | 903.11 |
| Paul Wang | 2 | 14 | 4.87 |