COLT HPF , a Coordination Layer for HPF Tasks

This paper describes COLTHPF, a run{time support for the coordination of concurrent and communicating HPF tasks. COLTHPF is conceived for use by a compiler of a high-level coordination language to structure a set of data-parallel HPF tasks according to popular forms of task-parallelism, but it can also be exploited to implement libraries of skeletons. Since it requires only small changes to the run-time support of the HPF compiler used, COLTHPF is easily portable among diierent compilation systems. The paper outlines design and implementation issues, and discusses the main diierences from other approaches proposed to exploit task parallelism in the HPF framework. We show how COLTHPF can be used to implement common forms of parallelism, e.g. pipeline and processor farms, and we present experimental results regarding both synthetic micro-benchmarks and sample applications. The experiments were conducted on an SGI/Cray T3E using Adaptor, a public domain HPF compiler.

[1]  Stelios C. Orphanoudakis,et al.  Load Balancing Requirements in Parallel Implementations of Image Feature Extraction Tasks , 1993, IEEE Trans. Parallel Distributed Syst..

[2]  Marco Vanneschi,et al.  Variable grain architectures for MPP computation and structured parallel programming , 1997, Proceedings. Third Working Conference on Massively Parallel Programming Models (Cat. No.97TB100228).

[3]  Anthony J. G. Hey Experiments in MIMD Parallelism , 1989, PARLE.

[4]  Marco Vanneschi,et al.  A methodology for the development and the support of massively parallel programs , 1992, Future Gener. Comput. Syst..

[5]  Peter G. Harrison,et al.  Parallel Programming Using Skeleton Functions , 1993, PARLE.

[6]  Sachin S. Sapatnekar,et al.  A Framework for Exploiting Task and Data Parallelism on Distributed Memory Multicomputers , 1997, IEEE Trans. Parallel Distributed Syst..

[7]  Jaspal Subhlok,et al.  Optimal mapping of sequences of data parallel tasks , 1995, PPOPP '95.

[8]  Thomas R. Gross,et al.  Task Parallelism in a High Performance Fortran Framework , 1994, IEEE Parallel & Distributed Technology: Systems & Applications.

[9]  Thomas R. Gross,et al.  Exploiting task and data parallelism on a multicomputer , 1993, PPOPP '93.

[10]  Guy L. Steele,et al.  The High Performance Fortran Handbook , 1993 .

[11]  Alok N. Choudhary,et al.  A Library-Based Approach to Task Parallelism in a Data-Parallel Language , 1997, J. Parallel Distributed Comput..

[12]  Jaspal Subhlok,et al.  Optimal latency-throughput tradeoffs for data parallel pipelines , 1996, SPAA '96.

[13]  Murray Cole,et al.  Algorithmic Skeletons: Structured Management of Parallel Computation , 1989 .

[14]  Samuel T. Chanson,et al.  Performance Models for the Processor Farm Paradigm , 1997, IEEE Trans. Parallel Distributed Syst..

[15]  Peter A. Dinda,et al.  The CMU task parallel program suite , 1994 .

[16]  H. T. Kung,et al.  Computational models for parallel computers , 1988, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[17]  Salvatore Orlando,et al.  P3 L: A structured high-level parallel language, and its structured support , 1995, Concurr. Pract. Exp..