Optimal parallel algorithms for constructing and maintaining a balancedm-way search tree |
| |
| Authors: | Eliezer Dekel Shietung Peng S. Sitharma Lyengar |
| |
| Affiliation: | (1) Programs in Computer Science, University of Texas at Dallas, Dallas, USA;(2) Computer Science Dept, Lousiana State University, Lousiana, USA |
| |
| Abstract: | We present parallel algorithms for constructing and maintaining balancedm-way search trees. These parallel algorithms have time complexity O(1) for ann processors configuration. The formal correctness of the algorithms is given in detail. |
| |
| Keywords: | Parallel algorithms MIMD search trees |
| 本文献已被 SpringerLink 等数据库收录！ |
