Name
Abstract | ||
|---|---|---|
Several techniques for the storage of large data structures in main memory have been proposed and, although none is optimal in every situation, tree structures have become a commonly adopted algorithm. A scheme for maintaining a balanced search tree on a distributed memory parallel architecture is described. A general 2P−2−2P (for integer P≥3) search tree is introduced with a linear array of up to [log2N/(P−2)]+1 processors being used to implement such a search tree. As many as ([log2N/(P−2)]+1)/2 operations can execute concurrently. Several examples of 2P−2−2P search trees have been implemented on an array of transputer processors. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1007/3-540-53504-7_92 | ICCI |
Keywords | DocType | ISBN |
concurrent data structure,distributed memory,tree structure,concurrent data structures | Conference | 3-540-53504-7 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adrian Colbrook | 1 | 403 | 114.95 |
| Colin Smythe | 2 | 11 | 10.15 |
| D H Pitt | 3 | 0 | 1.01 |