Exploiting advanced task parallelism in high performance fortran via a task library

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1685 LNCS, Issue , 1999, Pages 833-844

  Brandes, Thomas ^a  

^a FRAUNHOFER INSTITUTE FOR ALGORITHMS AND SCIENTIFIC COMPUTING SCAI   (Germany)

Author keywords

Data Parallelism; High Performance Fortran; Task Parallelism

Indexed keywords

MESSAGE PASSING; PARALLEL PROGRAMMING; SIGNAL PROCESSING;

DATA PARALLELISM; DETERMINISTIC COMMUNICATIONS; HIGH PERFORMANCE FORTRANS; PUBLIC DOMAINS; REAL-TIME SIGNAL PROCESSING; SINGLE PROCESSORS; TASK PARALLELISM; USER FRIENDLY;

FORTRAN (PROGRAMMING LANGUAGE);

EID: 84878623823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48311-x_118     Document Type: Conference Paper

References (14)

1. J. Barnes and P. Hut. A hierarchical O(NlogN) force calculation algorithm. Nature 4, 324:446-449, 1986.
2. T. Brandes. Implementation and Evaluation of Nested Task and Data Parallelism for High Performance Fortran within the ADAPTOR Compilation System. Working paper (unpublished), GMD, 1998. available via anonymous ftp as ftp.gmd.de:/GMD/adaptor/docs/tasking.ps.
3. T. Brandes and F. Zimmermann. ADAPTOR - A Transformation Tool for HPF Programs. In K. Decker and R. Rehmann, editors, Programming Environments for Massively Parallel Distributed Systems, pages 91-96. Birkhäuser Verlag, Apr. 1994.
4. B. Chapman, M. Haines, P. Mehrotra, H. Zima, and J. Van Rosendale. Opus: A Coordination Language for Multidisciplinary Applications. Scientific Programming, 6(4):345-361, 1997.
5. J. W. Cooley and J. W. Tukey. An Algorithm for the machine calculation of complex Fourier series. Mathematical Computing, 19:297-301, 1965.
6. P. Dinda, T. Gross, D. O'Hallaron, E. Segall, E. Stichnoth, J. Subhlok, J. Webb, and B. Yang. The CMU Task Parallel Program Suite. Technical Report CMU-CS-94-131, School of Computer Science, Carnegie Mellon University, Mar. 1994.
7. I. Foster, D. Kohr, K. R., and A. Choudhary. Double Standards: Bringing Task Parallelism to HPF via the Message Passing Interface. In P. Pittsburgh, editor, Supercomputing '96, Nov. 1996.
8. W. Groop, E. Lusk, and A. Skjellum. Using MPI: Portable Parallel Programming with the Message-Passing Interface. Scientific and Engineering Computation Series. The MIT Press, Cambridge, MA, 1994.
9. T. Gross, D. O'Hallaron, and J. Subhlok. Task Parallelism in a High Performance Fortran Framework. IEEE Parallel and Distributed Technology, 2(2):16-26, 1994.
10. High Performance Fortran Forum. High Performance Fortran Language Specification. Version 2.0, Department of Computer Science, Rice University, Jan. 1997.
11. HPF, a Coordination Layer for HPF Tasks. Technical Report Series on Computer Science CS-98-4, Universita ca' Foscari di Venezia, Mar. 1998. Paper submitted to Concurrency: Practice and Experience.
12. S. Ramaswamy and P. Banerjee. Automatic Generation of Efficient Array Redistribution Routines for Distributed Memory Multicomputers. In Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computations (FRON-TIERS'95), pages 342-394, Feb. 1995.
13. S. Ramaswamy, S. Spatnekar, and P. Banerjee. A Framework for Exploiting Task and Data Parallelism on Distributed Memory Multicomputers. IEEE Transaction on Parallel and Distributed Systems, 8(11):1098-1116, Nov. 1997. (Pubitemid 127763322)
14. J. Subhlok and B. Yang. A New Model for Integrated Nested Task and Data Parallel Programming. In PPOPP 97, 1997.