Key points are not available for this paper at this time.
The authors present a method of parallel program design using large-grain data-flow constructs that approaches these problems head-on. The resultant modules can be implemented in virtually any language, and efficient, automatic scheduling of these modules is possible for both shared- and distributed-memory processors. The methods also show promise for sequential design.>
DiNucci et al. (2003) studied this question.