An Algebraic Model for Divide-and-Conquer and its Parallelism

Authors:

Zhijing G. Mou and Paul Hudak

Abstract:

A formal algebraic model for divide-and-conquer algorithms is presented.  The model reveals the internal structure of divide-and-conquer functions, leads to high-level and functional-styled algorithms specification, and simplifies complexity analysis.  Algorithms developed under the model contain vast
amounts of parallelism and can be mapped fairly easily to parallel computers.

Bibtex:

 @article{mou88
    ,author={Mou, Z.G. and Hudak, P.}
    ,title={An Algebraic Model for Divide-and-Conquer and its Parallelism}
    ,journal={Journal of Supercomputing}
    ,volume=2
    ,number=3
    ,year=1988
    } 

Links:

DivaCon.pdf