Partitioning Parallel Programs for Macro-Dataflow

摘要

Partitioning techniques are necessary to execute functional programs at a coarse granularity. Fine granularity execution is inefficient on general purpose multiprocessors. There is a trade off between parallelism and the overhead of exploiting parallelism. A compile time partitioning approach to achieve this trade-off is presented.