Coarse grained parallel (CGP) computing models such as the coarse grained multicomputer (CGM), bulk synchronous parallel (BSP), and LogP models have received considerable attention recently from the parallel computing community. This paper examines a new application of CGP algorithms, namely in heterogeneous systems, and shows that this approach to heterogeneous computing has a number of advantages over traditional approaches. A hetegerogeneous CGP model of computation is defined, and a number of algorithms and basic communication operations are developed for this model. These algorithms have been implemented in the form of a reusable and extendable library which simplifies the task of programming heterogeneous systems. Empirical results are given which show that this approach performs very well in practice.

Additional Metadata
Keywords Bulk synchronous' parallel, Coarse grained multicomputer, Heterogeneous computing, Parallel algorithms
Persistent URL dx.doi.org/10.1145/330560.331004
Conference 1998 ACM Symposium on Applied Computing, SAC 1998
Citation
Morin, P. (1998). Coarse grained parallel computing on heterogeneous systems. In Proceedings of the ACM Symposium on Applied Computing (pp. 628–634). doi:10.1145/330560.331004