An HPF Case Study of a Domain-Decomposition Based Irregular Application
by C. Germain ,J. Laminie, M. Pallud, D.Etiemble
Abstract:
Data-parallel languages, in particular HPF, provide a highlevel view of operators overs parallel data structures and hide the details of data partitioning and communication. One of the most difficult issues in compiling such languages is managing irregular data-dependent parallelism. This paper presents the study of a realistic, but non adaptive irregular application. We show that HPF can easily express the natural parallelism of the application. Experimental results and a detailed examination of the compiler process are presented.
Keywords: software
Source:
C. Germain, J. Laminie, M. Pallud, D. Etiemble, An HPF Case Study of a Domain-Decomposition Based Irregular Application. In V. Malyshkin (ed.),
Parallel Computing Technologies: Proceedings of the 4th International Conference,
Lect. Notes in Comp. Sci., Vol. 1277, Springer, 1997, pp. 201-209
