Article

Free access

High-level management of communication schedules in HPF-like languages

Authors:

Siegfried Benkner,

Piyush Mehrotra,

John Van Rosendale,

Hans ZimaAuthors Info & Claims

ICS '98: Proceedings of the 12th international conference on Supercomputing

Pages 109 - 116

https://doi.org/10.1145/277830.277855

Published: 13 July 1998 Publication History

PDF eReader

References

[1]

G. AgrawM and J. Saltz. InterprocedurM Compilation of Irregular Applications for Distributed Memory Machines. In Proceedings of the Supercomputing Conference, San Diego, CA, December, 1995.

Digital Library

Google Scholar

[2]

S. Barros, D. Dent, L. Isaksen, G. Robinson, G. Mozdzynski, and F. Wollenweber. The IFS model: A parallel production weather code. Parallel Computing 21, 1995.

Digital Library

Google Scholar

[3]

S. Benkner. HPF+: High Performance Fortran for Advanced Industrial Applications. In Proceedings of the International Conference on High Performance Computing and Networking (HPCN'98), Amsterdam, April 1998, Springer Verlag.

Digital Library

Google Scholar

[4]

S. Benkner, K. Sanjari, V. Sipkova, and B. Velkov. Parallelizing Irregular Applications with the Vienna HPF+ Compiler VFC. In Proceedings of the b, ternational Conference on High Performance Computing and Networking (HPUN'98), Amsterdam, April 1998, Springer Verlag.

Digital Library

Google Scholar

[5]

S. Benkner, et.al. Vienna Fortran Compilation System- Version 1.2- User's Guide, February 1996.

Google Scholar

[6]

Benkner, S. Vienna Fortran 90 and its Compilation. Ph.D. Thesis. Technical Report TR 94-8, University of Vienna, Institute of Software Technology and P~rMlel Systems, November 1994.

Google Scholar

[7]

S. Benkner, B. Ch~pm~n, ~nd H. Zima. "Vienn~ Fortran 90", In Proceedings of the Scalable High Performance Computing Conference, SHPCC-92, Williamsburg, VA, USA, April 1992, IEEE Computer Society Press.

Google Scholar

[8]

Z. Bozkus, A. Choudhary, G. Fox, T. Haupt, and S. Ranka. Fortran 90D/HPF compiler for distributed memory MIMD computers: Design, implementation, and performance results. In Proceedings of the 1993 A UM International Conference on Supercomputing, July 1993.

Digital Library

Google Scholar

[9]

B. Chapman, P. Mehrotra, and H. Zima. Programming in Vienna Fortran. Scientific Programming 1(1)::11-50, Fall 1992.

Google Scholar

[10]

B. Chapman, P. Mehrotra, and H. Zima. Extending HPF for Advanced Data Parallel Applications. IE- EE Parallel and Distributed Technology, Fall 1994, pp.59-70.

Digital Library

Google Scholar

[11]

J. Clinckemaillie, B. Eisner, G. LonsdMe, S. Meliciani, S. Vlachoutsis, F. de Bruyne, M. Holzner. Performance Issues of the Parallel PAM-CRASH Code. Journal of Supercomputing Applications and ttigh-Performance Computing, Vol.ll, No.l, 1997.

Google Scholar

[12]

R. Das, J. Saltz, A manual for PARTi runtime primitives - Revision 2. Internal Research Report, University of Maryland, Dec. 1992

Google Scholar

[13]

R. Das, J. Saltz, and R. yon Hanxleden. Slicing Analysis and Indirect Accesses to Distributed Arrays. Technical Report CS-TR-3076, UMIACS-TR- 93-42, University of Maryland, College Park, MD, 1993.

Digital Library

Google Scholar

[14]

R. Das, A. Susman, P. Havlak, J. Saltz. Compiler Analysis and Optimization of Indirect Array Accesses. In Proceedings of the 5th Workshop on Compilers for Parallel Computers. Malaga, Spain, June 1995.

Google Scholar

[15]

R. yon Hanxleden, K. Kennedy, C. Koelbel, R. D~s, and J. Saltz. Compiler Analysis for Irregular Problems in Fortran D. In Proceedings of the 5th Workshop on Languages and Compilers for Parallel Computing, New Haven, CT, August 1992.

Digital Library

Google Scholar

[16]

R. yon Hanxleden and K. Kennedy. Give-N-Take: A balanced code placement framework. In A CM S1GPLAN '9d Program Language Design and Implementation, June 1994.

Digital Library

Google Scholar

[17]

High Performance Fortran Forum. High Performance Fortran Language Specification Version 1.0. Technical Report, Rice University, ttouston, TX, May 3, 1993.

Google Scholar

[18]

High Performance Fortran Forum. High Performance Fortran Language Specification Version 2.0. Technical Report, Rice University, Houston, TX, January 31, 1997.

Google Scholar

[19]

C. Koelbel and P. Mehrotra. Compiling global name~space parallel loops for distributed execution. IEEE Transactions on Parallel and Distributed Systems, 2(4):440-451, October 1991.

Digital Library

Google Scholar

[20]

A. Lain and P. Banerjee. Exploiting Spatial Regularity in Irregular Iterative Applications. In Proceedings of the 9th International Parallel Processing Symposium, Santa Barbara, CA, April 1995.

Digital Library

Google Scholar

[21]

P. Banerjee, J. A. Chandy, M. Gupta, J. G. Holm, A. Lain, D. /I. Palermo, S. Ramaswamy, and E. Su. The PARADIGM Compiler for Distributed- Memory Message Passing Multicomputers, In Proceedings of the First International Workshop on Parallel Processing, Bangalore, India, December, 1994.

Google Scholar

[22]

R. Ponnusamy, J. Saltz, A. Choudhary, Runtime Compilation Techniques for Data Partitioning and Communication Schedule Reuse. Technical Report, UMIACS-TR-93-32, University of Maryland, April 1993.

Digital Library

Google Scholar

[23]

J. Saltz, K. Crowley, R. Mirchandaney, and H. Berryman. Run-time scheduling and execution of loops on message passing machines. Journal of Parallel and Distributed Computing, 8(2):303-312, 1990.

Digital Library

Google Scholar

[24]

J. Saltz, R. Das, B. Moon, S. Sharma, Y-S. Hwang, R. Ponnusamy, M. Uysal: A Manual for the CHA- OS Runtime Library, Technical Report, University of Maryland, College Park, MD 20742, May 1994.

Digital Library

Google Scholar

[25]

H. gima, P. Brezany, B. Chapman, P. Mehrotra, and A. Schwald. Vienna Fortran- a language specification. ICASE Internal Report 21, ICASE, Hampton, VA, 1992.

Google Scholar

[26]

H. Zima and B. Chapman. Compiling for Distributed Memory Systems. Proceedings of the IEEE, Special Section on Languages and Compilers for Parallel Machines, pp. 264-287, February ~993.

Google Scholar

Cited By

View all

Mintz THernandez OKartsaklis CBernholdt DEisenbach MPophale S(2013)Toward Abstracting the Communication Intent in Applications to Improve Portability and ProductivityProceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum10.1109/IPDPSW.2013.66(385-393)Online publication date: 20-May-2013
https://dl.acm.org/doi/10.1109/IPDPSW.2013.66
Zima HHall MChen CChame JKranzlmüller DBode AHegering HCasanova HGerndt M(2009)Model-guided autotuning of high-productivity languages for petascale computingProceedings of the 18th ACM international symposium on High performance distributed computing10.1145/1551609.1551611(151-166)Online publication date: 11-Jun-2009
https://dl.acm.org/doi/10.1145/1551609.1551611
Benkner SSipkova V(2009)Language and Compiler Support for Hybrid-Parallel Programming on SMP ClustersProceedings of the 4th International Symposium on High Performance Computing10.1007/3-540-47847-7_4(11-24)Online publication date: 18-May-2009
https://dl.acm.org/doi/10.1007/3-540-47847-7_4
Show More Cited By

Recommendations

High-Level Management of Communication Schedules in HPF-Like Languages
Part-compilation in high-level languages
Abstract
Many programming languages include the ability to divide large programs into smaller segments, which are compiled separately. When a small modification is made to a large program, then the affected segment only has to be re-compiled.

This paper ...
Macro processing in high-level languages

A macro language is proposed. It enables macro processing in high-level programming languages. Macro definitions in this language refer to the grammars of the respective programming languages. These macros introduce new constructs in programming ...

Comments

Information & Contributors

Information

Published In

ICS '98: Proceedings of the 12th international conference on Supercomputing

July 1998

464 pages

ISBN:089791998X

DOI:10.1145/277830

Chairmen:
Greg Egan
Monash Univ.
,
Richard Brent
Oxford Univ.; and Australian National Univ., Canberra, Australia
,
Dennis Gannon
Indiana Univ.

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: 13 July 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS98

Sponsor:

SIGARCH
IEEE-CS

ICS98: 1998 International Conference on Supercomputing

Melbourne, Australia

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
269
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)7

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mintz THernandez OKartsaklis CBernholdt DEisenbach MPophale S(2013)Toward Abstracting the Communication Intent in Applications to Improve Portability and ProductivityProceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum10.1109/IPDPSW.2013.66(385-393)Online publication date: 20-May-2013
https://dl.acm.org/doi/10.1109/IPDPSW.2013.66
Zima HHall MChen CChame JKranzlmüller DBode AHegering HCasanova HGerndt M(2009)Model-guided autotuning of high-productivity languages for petascale computingProceedings of the 18th ACM international symposium on High performance distributed computing10.1145/1551609.1551611(151-166)Online publication date: 11-Jun-2009
https://dl.acm.org/doi/10.1145/1551609.1551611
Benkner SSipkova V(2009)Language and Compiler Support for Hybrid-Parallel Programming on SMP ClustersProceedings of the 4th International Symposium on High Performance Computing10.1007/3-540-47847-7_4(11-24)Online publication date: 18-May-2009
https://dl.acm.org/doi/10.1007/3-540-47847-7_4
Benkner S(2006)Optimizing irregular HPF applications using halosParallel and Distributed Processing10.1007/BFb0097986(1015-1024)Online publication date: 28-Oct-2006
https://doi.org/10.1007/BFb0097986
Mehrotra PVan Rosendale JZima H(2006)High Performance Fortran: Status and prospectsApplied Parallel Computing Large Scale Scientific and Industrial Problems10.1007/BFb0095356(345-356)Online publication date: 20-Oct-2006
https://doi.org/10.1007/BFb0095356
Nikolopoulos DArtiaga EAyguadé ELabarta J(2003)Scaling non-regular shared-memory codes by reusing custom loop schedulesScientific Programming10.1155/2003/37973911:2(143-158)Online publication date: 1-Apr-2003
https://dl.acm.org/doi/10.1155/2003/379739
Deitz SChamberlain BChoi SSnyder L(2003)The design and implementation of a parallel array operator for the arbitrary remapping of dataACM SIGPLAN Notices10.1145/966049.78152638:10(155-166)Online publication date: 11-Jun-2003
https://dl.acm.org/doi/10.1145/966049.781526
Deitz SChamberlain BChoi SSnyder LEigenmann RRinard M(2003)The design and implementation of a parallel array operator for the arbitrary remapping of dataProceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/781498.781526(155-166)Online publication date: 11-Jun-2003
https://dl.acm.org/doi/10.1145/781498.781526
Benkner SSipkova V(2003)Exploiting Distributed-Memory and Shared-Memory Parallelism on Clusters of SMPs with Data Parallel ProgramsInternational Journal of Parallel Programming10.1023/A:102178211886131:1(3-19)Online publication date: 1-Feb-2003
https://dl.acm.org/doi/10.1023/A%3A1021782118861
Nikolopoulos DPolychronopoulos CAyguadé ESlocomb C(2001)Scaling irregular parallel codes with minimal programming effortProceedings of the 2001 ACM/IEEE conference on Supercomputing10.1145/582034.582050(16-16)Online publication date: 10-Nov-2001
https://dl.acm.org/doi/10.1145/582034.582050
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

High-Level Management of Communication Schedules in HPF-Like Languages

Part-compilation in high-level languages

Macro processing in high-level languages