A UNIFIED APPROACH TO THE PARALLEL CONSTRUCTION OF SEARCH-TREES

被引：2
|
作者：
DAS, SK
MIN, KB
机构：
[1] Department of Computer Science, University of North Texas, Denton
来源：
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1995年 / 27卷 / 01期
关键词：
D O I：
10.1006/jpdc.1995.1072
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a unified parallel algorithm for constructing various search trees. The tree construction is based on a unified scheme, called bottom-level balancing, which constructs a perfectly balanced search tree having a uniform distribution of keys. The algorithm takes O(log log N) time using N/log log N processors on the EREW PRAM model, and O(1) time with N processors on the CREW PRAM model, where N is the number of keys in the tree. (C) 1995 Academic Press, Inc.
引用
收藏
页码：71 / 78
页数：8
相关论文
共 50 条
12345