Recursive Partitions On Multiprocessor

A recursive partitioning scheme (RP) involves partitioning a set of points in a k dimensional Euclidean space Ek. An RP scheme is specified hierarchically in terms of levels. Let h be the number of levels. At each level I, 021 <h-1, the region is split into a specified number of parts nl based on a specified coordinate CI for the level. The objective is to have an approximately equal distribution of points in the final regions. In this paper, we describe how an RP scheme can be maintained dynamically on a multiprocessor under the operations of additions and deletions of points. We have implemented the algorithm on the Intel iPSC2D4-MX hypercube. We present the results of the implementation for different RP schemes.