A computational model for divide-and-conquer strategies on parallel architectures

A novel computational model is presented in graph-theoretic terms for the implementation of divide-and-conquer strategies on parallel architectures. Standard applications, such as sorting and segmentation in image analysis, are shown to fit the model. The utilization of this model as part of a mapping strategy would eliminate a major hurdle in the implementation of several new applications in parallel computers.<
>