Optimal Parallel Algorithms for Constructing Balanced m-Way Search Tree

In this paper two cost-optimal parallel algorithms are presented for constructing a B-tree for a sorted list of N keys. These two parallel algorithms are designed on the shared-memory SIMD computer: one, based on the EREW model, uses N/loglog N processors and requires O(loglog N) time; the other, based on the CREW model, uses N processors and requires O(1) time.