Coordination languages and their significance
Communications of the ACM
The high performance Fortran handbook
The high performance Fortran handbook
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
A new model for integrated nested task and data parallel programming
PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
A library-based approach to task parallelism in a data-parallel language
Journal of Parallel and Distributed Computing
Efficient run-time support for irregular block-structured applications
Journal of Parallel and Distributed Computing - Special issue on irregular problems in supercomputing applications
A coordination language for mixed task and and data parallel programs
Proceedings of the 1999 ACM symposium on Applied computing
Applied Mathematics and Computation
Mixed data and task parallelism with HPF and PVM
Cluster Computing
Approaches for Integrating Task and Data Parallelism
IEEE Concurrency
Multiple Data Parallelism with HPF and KeLP
HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Opus: A Coordination Language for Multidisciplinary Applications
Scientific Programming
Dynamic reconfiguration of scientific components using aspect oriented programming: a case study
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Hi-index | 0.00 |
This paper presents BCL, a border-based coordination language focused on the solution of numerical applications. Our approach provides a simple parallelism model. Coordination and computational aspects are clearly separated. The former are established using the coordination language and the latter are coded using HPF (together with only a few extensions related to coordination). This way, we have a coordinator process that is in charge of both creating the different HPF tasks and establishing the communication and synchronization scheme among them. In the coordination part, processor and data layouts are also specified. Data distribution belonging to the different HPF tasks is known at the coordination level. This is the key for an efficient implementation of the communication among them. Besides that, our system implementation requires no change to the runtime support of the underlying HPF compiler. By means of some examples, the suitability and expressiveness of the language are shown. Some experimental results also demonstrate the efficiency of the model.