Article

Free access

Extending high performance Fortran for the support of unstructured computations

Authors:

Andreas Müller,

Roland RühlAuthors Info & Claims

ICS '95: Proceedings of the 9th international conference on Supercomputing

Pages 127 - 136

https://doi.org/10.1145/224538.224552

Published: 03 July 1995 Publication History

PDF eReader

References

[1]

MPIF (Message Passing Interface Forum). Document for a Standard Message-Passing Interface. Technical Report, Oak Ridge National Laboratory, TN, Apr. 1994.

Google Scholar

[2]

C. Koelbel, D. Loveman, R. Schreiber, G. Steele, Jr, and M. Zosel. The Htgh Perfi)rmance Fortran Handbook. The MIT Press, 1994.

Digital Library

Google Scholar

[3]

H. Berryman, J. Saltz, and J. Scroggs. Execution time support for adaptive scientific algorithms on distributed memory architectures. Concurrency: Practice and Experience, 3(3), June 1991.

Digital Library

Google Scholar

[4]

S. Hirandani, K. Kennedy, and C. W. Tseng. Compiler optimizations for Fortran D on MIMD distributed-memory machines. In Proc. Supercomputing 91, Albuquerque, NM, November 1991. ACM-IEEE.

Digital Library

Google Scholar

[5]

C. Koetbel, P. Mehrotra, and J. van Rosendale. Supporting shared memory data structures on distributed memory architectures. In Second Symposium on Principles and Practice of Parallel Programming, page 177, Seattle, WA, March 1990. ACM SIGPLAN.

Digital Library

Google Scholar

[6]

R. Rtlhl. A Parallelizmg Compiler for Distributed-Memory Parallel Processors. PhD thesis, ETH-Ziirich, 1992. Published by Hartung- Gorre Verlag, Konstanz, Germany.

Google Scholar

[7]

C. Cl6men~on, K. M. Decker, A. Endo, J. Fritscher, G. Jost, N. Masuda, A. MUller, R. RaM, W. Sawyer, E. de Sturler, B. J. N. Wylie, and F. Zimmermann. Application-Driven Development of an Integrated Tool Environment for Distributed Memory Parallel Processors. In R. Rao and C. P. Ravikumar, editors, Proceedings of the First International Workshop on Parallel Processing (Bangalore, India, December 27-30), 1994. (to appear).

Google Scholar

[8]

I. Beg, W. Ling, A. Mailer, P. Przybyszewski, R. Rtihl, and W. Sawyer. PLUMP: Parallel Library for Unstructured Mesh Problems. In Proceedings of the IFIP WG 10.3 International Workshop and Summer School on Parallel Algorithms for Irregularly Structured Problems, Geneva, Switzerland, August 30, 1994. Kluwer Academic Publishers, Aug. 1994.

Google Scholar

[9]

C. C16men~on, A. Endo, J. Fritscher, A. Mallet, R. Rfihl, and B. J. N. Wylie. The "Annai" Environment for Portable Distributed Parallel Programming. In H. E1-Rewini and B. D. Shrive{', editors, Proceedings of the 28th Hawaii Internattonal Conference on System Sciences, Volume H (Maui, Hawaii, USA, 3-6 January, 1995), pages 242-251. IEEE Computer Society Press, Jan. 1995. ISBN 0-8186-6935-7.

Digital Library

Google Scholar

[10]

B. J. N. Wylie and A. Endo. Design and realization of the Annai integrated parallel programming environment performance monitor and analyzer. Technical Report CSCS-TR-94-07, CSCS, CH-6928 Manno, Switzerland, Aug. 1994.

Google Scholar

[11]

C. Cltmen~;on, J. Fritscher, and R. RaM, Execution Control, Visualization and Replay of Massively Parallel Programs within Annai's Debugging Tool. Technical Report CSCS-TR-94-09, CSCS, CH-6928 Manno, Switzerland, Nov. 1994.

Google Scholar

[12]

M. Annaratone, M. Fillo, M. Halbherr, R. Rfihl, P. Steiner, and M. Viredaz. The K2 distributed memory parallel processor: Architecture, compiler, and operating system. In Proc. Supercomputing' 91, Albuquerque, NM, Nov. 1991. ACM-IEEE.

Digital Library

Google Scholar

[13]

R. RUhl. Evaluation of compiler generated parallel programs on three multicomputers. In Proc. A CM International Conference on Supercomputing, Washington DC, July 1992.

Digital Library

Google Scholar

[14]

C. Pommerell. Solution of Large Unsymmetric Systems of Linear Equations. PhD thesis, ETH-Zfirich, 1992. Published by Hartung- Gorre Verlag, Konstanz, Germany.

Google Scholar

[15]

C. Pommerell and R. Rtihl. Migration ofVectorized Iterative Solvers to Distributed Memory Architectures. In Colorado Conference on Iterative Methods (Breckenridge, Colorado, April 1994), 1994. Preliminary proceedings, accepted for publication in SIAM J. Sci. Comput.

Google Scholar

[16]

Y. Saad. Krylov subspace methods on supercomputers. SIAM Jr. Sci. Stat. Comput., 10(6):1200--1232, Nov. 1989.

Digital Library

Google Scholar

[17]

J. Saltz, R. Mirchandaney, and K. Crowley. Run-time parallelization and scheduling of loops. Journal of Parallel and Distributed Computing, April 1990.

Crossref

Google Scholar

[18]

K. Crowley, J. Saltz, R. Mirchandaney, and H. Berryman. Run-time scheduling and execution of loops on message passing machines. Technical Report 89-7, ICASE, NASA Langley Research Center, January 1989.

Google Scholar

[19]

R. Das, J. Saltz, and R. Hanxleden. Slicing analysis and indirect access to distributed arrays. In Proceedings of the 6th Workshop on Languages and Compilers for Parallel Computing, Portland, OR, Aug. 1993.

Digital Library

Google Scholar

[20]

C. Chase and A. Reeves. Data remapping for distributed-memory multicomputers. In Scalable High Performance Computing ConJerence, pages pp 137-144, 1992.

Crossref

Google Scholar

[21]

B. Chapman, P. Mehrotra, and H. Zima. Extending HPF for advanced data parallel applications. Technical Report TR 94-7, Institute for Software Technology and Parallel Systems, University of Vienna, Austria, 1994.

Digital Library

Google Scholar

[22]

U. Banerjee. Speedup of ordinary programs. PhD thesis, University of Illinois at Urbana-Champaign, October 1979.

Digital Library

Google Scholar

[23]

Y. Saad. SPARSKiT: A basic tool kit for sparse matrix computation. Technical Report CSRD Report no. 1029, University of illinois, CSRD, August 1990.

Google Scholar

[24]

J. Field, G. Ramalingam, and F. Tip. Parametric program slicing, in Proc. POPL 95, 22nd Symposium Principles of Programming Languages. ACM SIGPLAN-SIGACT, 1994.

Digital Library

Google Scholar

[25]

C. C16men~on, K. M. Decker, A. Endo, J. Fritscher, T. Maruyama, N. Masuda, A. Mailer, R. RaM, W. Sawyer, E, de Sturler, B. J. N. Wylie, and F. Zimmermann. Architecture and Programmability of the NEC Cenju-3. In Proceedings of the 16th SPEEDUP Workshop, 1994. SPEEDUP Journal 8(2).

Google Scholar

[26]

C. Pommerell, M. Annaratone, and W. Fichtner. A set of new mapping and coloring heuristics for distributed-memory parallel processors. SIAM J. Sci. Stat. Comput., 13:194-226, 1992.

Digital Library

Google Scholar

Cited By

View all

Jackson AStrand P(2013)MDMPProceedings of the 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing10.1109/SYNASC.2013.71(496-502)Online publication date: 23-Sep-2013
https://dl.acm.org/doi/10.1109/SYNASC.2013.71
Feng MLin CGupta R(2012)PLDSACM Transactions on Architecture and Code Optimization10.1145/2086696.20867178:4(1-21)Online publication date: 26-Jan-2012
https://dl.acm.org/doi/10.1145/2086696.2086717
Kulkarni MPingali KRamanarayanan GWalter BBala KChew L(2008)Optimistic parallelism benefits from data partitioningACM SIGPLAN Notices10.1145/1353536.134631143:3(233-243)Online publication date: 1-Mar-2008
https://dl.acm.org/doi/10.1145/1353536.1346311
Show More Cited By

Index Terms

Recommendations

Efficient parallel implementations of near Delaunay triangulation with High Performance Fortran: Research Articles

Unstructured mesh generation exposes highly irregular computation patterns, which imposes a challenge in implementing triangulation algorithms on parallel machines. This paper reports on an efficient parallel implementation of near Delaunay ...
Optimization and Performance of a Fortran 90 MPI-Based Unstructured Code on Large-Scale Parallel Systems

The message-passing interface (MPI) has become the standard in achieving effective results when using the message passing paradigm of parallelization. Codes written using MPI are extremely portable and are applicable to both clusters and massively ...
High Performance Fortran

Fortran-90, its basis in Fortran-77, its implications for parallel machines, and the extensions developed for it by the High Performance Fortran Forum (HPFF), a coalition of computer vendors, government laboratories, and academic groups founded in 1992 ...

Comments

Information & Contributors

Information

Published In

ICS '95: Proceedings of the 9th international conference on Supercomputing

July 1995

448 pages

ISBN:0897917286

DOI:10.1145/224538

Chairman:
Mateo Valero
Univ. Polite`cnica de Catalunya

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 July 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS95

Sponsor:

Univ Politecnica del Catalunya
SIGARCH
Oregon Graduate Institute

ICS95: 1995 International Conference on Supercomputing

July 3 - 7, 1995

Barcelona, Spain

Acceptance Rates

ICS '95 Paper Acceptance Rate 49 of 120 submissions, 41%;

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
354
Total Downloads

Downloads (Last 12 months)42
Downloads (Last 6 weeks)4

Reflects downloads up to 18 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jackson AStrand P(2013)MDMPProceedings of the 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing10.1109/SYNASC.2013.71(496-502)Online publication date: 23-Sep-2013
https://dl.acm.org/doi/10.1109/SYNASC.2013.71
Feng MLin CGupta R(2012)PLDSACM Transactions on Architecture and Code Optimization10.1145/2086696.20867178:4(1-21)Online publication date: 26-Jan-2012
https://dl.acm.org/doi/10.1145/2086696.2086717
Kulkarni MPingali KRamanarayanan GWalter BBala KChew L(2008)Optimistic parallelism benefits from data partitioningACM SIGPLAN Notices10.1145/1353536.134631143:3(233-243)Online publication date: 1-Mar-2008
https://dl.acm.org/doi/10.1145/1353536.1346311
Kulkarni MPingali KRamanarayanan GWalter BBala KChew L(2008)Optimistic parallelism benefits from data partitioningACM SIGOPS Operating Systems Review10.1145/1353535.134631142:2(233-243)Online publication date: 1-Mar-2008
https://dl.acm.org/doi/10.1145/1353535.1346311
Kulkarni MPingali KRamanarayanan GWalter BBala KChew L(2008)Optimistic parallelism benefits from data partitioningACM SIGARCH Computer Architecture News10.1145/1353534.134631136:1(233-243)Online publication date: 1-Mar-2008
https://dl.acm.org/doi/10.1145/1353534.1346311
Kulkarni MPingali KRamanarayanan GWalter BBala KChew LEggers SLarus J(2008)Optimistic parallelism benefits from data partitioningProceedings of the 13th international conference on Architectural support for programming languages and operating systems10.1145/1346281.1346311(233-243)Online publication date: 1-Mar-2008
https://dl.acm.org/doi/10.1145/1346281.1346311
Gardner JConnolly AMcBride CSchopf JBair RWilkins-Diehr NSanielevici S(2007)Enabling rapid development of parallel tree search applicationsProceedings of the 5th IEEE workshop on Challenges of large applications in distributed environments10.1145/1273404.1273410(1-10)Online publication date: 25-Jun-2007
https://dl.acm.org/doi/10.1145/1273404.1273410
Moreira JEswar KKonuru RNaik V(2005)Supporting dynamic data and processor repartitioning for irregular applicationsParallel Algorithms for Irregularly Structured Problems10.1007/BFb0030114(237-248)Online publication date: 16-Jun-2005
https://doi.org/10.1007/BFb0030114
Clémençon CFritscher JMeehan MRühl R(2005)An implementation of race detection and deterministic replay with MPIEURO-PAR '95 Parallel Processing10.1007/BFb0020462(155-166)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0020462
Dekeyser JKokoszko BLevaire JMarquet P(2005)Irregular data-parallel objects in C++Vector and Parallel Processing — VECPAR'9610.1007/3-540-62828-2_113(65-80)Online publication date: 5-Aug-2005
https://doi.org/10.1007/3-540-62828-2_113
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Efficient parallel implementations of near Delaunay triangulation with High Performance Fortran: Research Articles

Optimization and Performance of a Fortran 90 MPI-Based Unstructured Code on Large-Scale Parallel Systems

High Performance Fortran