Article

Free access

Analysis of local enumeration and storage schemes in HPF

Authors:

Henk J. Sips,

Kees van Reeuwijk,

Will DenissenAuthors Info & Claims

ICS '96: Proceedings of the 10th international conference on Supercomputing

Pages 10 - 17

https://doi.org/10.1145/237578.237580

Published: 01 January 1996 Publication History

PDF eReader

References

[1]

High Performance Fortran Forum, High Performance Fortran Language Specification, version 1.1, Rice University, Houston, Texas, November 1994.

Google Scholar

[2]

S. Chatterjee, J. R. Gilbert, F. J.E. Long, R. Schreiber, and S.-H Teng, "Generating local addresses and communication sets for data.parallel programs", in Journal of Parallel and Distributed Computing, Vol.26, no.l, pp. 72-84, April 1995 (first presented at PPoPP'93).

Digital Library

Google Scholar

[3]

E.M. Paalvast, H.J. Sips, and A.J. van Gemund, "Automatic parallel program generation and optimization from data decompositions," in Proc. 1991 Int. Conf. on Parallel Processing, August 1991, pp. II 124-131.

Google Scholar

[4]

A. Thirumalai and J. Ramanujam, "Fast address sequence generation for data-parallel programs using integer lattices," Proc. of the 8-th int. Workshop on Languages and Compilers for Parallel Computing, August 1995.

Digital Library

Google Scholar

[5]

C. Ancourt, F. Irigoin, F. Coelho, and R. Keryell, "A linear algebra framework for static HPF code distribution'', Technical report, no. A-278-CRI, Ecole des Mines, November 1995 (an early version was also presented at the Fourth Int. Workshop on Compilers for Parallel Computers, Delft, the Netherlands, Dec. 1993).

Google Scholar

[6]

Y. Mah~o and J.-L. Pazat, "Distributed array management for HPF compilers", High Performance Computing Symposium, Montreal, Canada, July 1995.

Google Scholar

[7]

J.M. Stichnoth, D. O'Hallaron, and T.R. Gross, "Generating communication for array statements: Design, implementation and evaluation", Journal of Parallel and Distributed Computing, vol.21, pp. 150-159, 1994.

Digital Library

Google Scholar

[8]

S.K.S. Gupta, S.D. Kaushik, C.-H. Huang, P. Sadayappan, "On compiling array expressions for efficient execution on distributed-memory machines", Tech. Report OSU-CISRC-4/94-TR19, Ohio State Univ.,1994.

Google Scholar

[9]

S.D. Kaushik, C.-H. Huang, P. Sadayappan, "Compiling array statements for efficient execution on distributed memory machines: two-level mappings," Proc. of the 8-th Int. Workshop on Languages and Compilers for Parallel Computing, August 1995.

Digital Library

Google Scholar

[10]

K. Kennedy, N. Nedeljkovic,A. Sethi, "A linear time algorithm for computing the memory access sequence in data"parallel programs," Proc. $ymp. on Principles and Practice of Parallel Programming, 1995, pp 102-111.

Digital Library

Google Scholar

[11]

K. Kennedy, N. Nedeljkovic, A. Sethi, "Efficient address generation for block-cyclic distributions," in Proc. oJ the Intl. Conf. on $upercomp., June 1995, pp.180- 184.

Digital Library

Google Scholar

[12]

C. van Reeuwijk, H.J. Sips, W. Denissen, E.M. Paalvast, "An implementation framework for HPF distributed arrays on message passing computer systems," CP Technical Report series, TR9506, Delft University of Technology, November 1994, (to appear in IEEE Transactions on Parallel and Distributed Systems).

Digital Library

Google Scholar

[13]

S. Benkner, "Handling block-cyclic distributed arrays in Vienna Fortran 90," Proceedings International Conference on Parallel Architectures and Compilation Techniques, Limmassol, Cyprus, June 1995.

Digital Library

Google Scholar

[14]

S. Midkiff, "Local iteration set computation for blockcyclic distributions," Proceedings of the 2j-th International Conference on Parallel Processing, August 1995.

Google Scholar

[15]

s. Ben He,sen, H. Bal, "integrating task and data parallelism using shared objects," lO-th International Conference on Supercomputing, Philadelphia, May 1996.

Digital Library

Google Scholar

Cited By

View all

Chavarría-Miranda DAgarwal KStraatsma TEpema D(2013)Scalable PGAS metadata management on extreme scale systemsProceedings of the 13th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing10.1109/CCGrid.2013.83(103-111)Online publication date: 13-May-2013
https://dl.acm.org/doi/10.1109/CCGrid.2013.83
Coelho FGermain CPazat J(2005)State of the art in compiling HPFThe Data Parallel Programming Model10.1007/3-540-61736-1_45(104-133)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-61736-1_45
Hwang G(2004)An efficient algorithm for communication set generation of data parallel programs with block-cyclic distributionParallel Computing10.1016/j.parco.2004.02.00130:4(473-501)Online publication date: 1-Apr-2004
https://dl.acm.org/doi/10.1016/j.parco.2004.02.001
Show More Cited By

Index Terms

Analysis of local enumeration and storage schemes in HPF
1. Computing methodologies
  1. Concurrent computing methodologies
    1. Concurrent programming languages
2. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language types
        Concurrent programming languages

Recommendations

Analysis of local enumeration and storage schemes in HPF
Special issues on languages and compilers for parallel computers
Efficient Dynamic Local Enumeration for HPF
LCPC '00: Proceedings of the 13th International Workshop on Languages and Compilers for Parallel Computing-Revised Papers

In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF array alignment functions can introduce local storage inefficiencies. ...
Enumeration schemes for vincular patterns

We extend the notion of an enumeration scheme developed by Zeilberger and Vatter to the case of vincular patterns (also called ''generalized patterns'' or ''dashed patterns''). In particular we provide an algorithm which takes in as input a set B of ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICS '96: Proceedings of the 10th international conference on Supercomputing

January 1996

406 pages

ISBN:0897918037

DOI:10.1145/237578

Chairman:
Pen Chung Yew
Univ. of Minnesota

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: 01 January 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS96

Sponsor:

SIGARCH

ICS96: 1996 International Conference on Supercomputing

May 25 - 28, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

ICS '96 Paper Acceptance Rate 50 of 116 submissions, 43%;

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

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
185
Total Downloads

Downloads (Last 12 months)39
Downloads (Last 6 weeks)3

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chavarría-Miranda DAgarwal KStraatsma TEpema D(2013)Scalable PGAS metadata management on extreme scale systemsProceedings of the 13th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing10.1109/CCGrid.2013.83(103-111)Online publication date: 13-May-2013
https://dl.acm.org/doi/10.1109/CCGrid.2013.83
Coelho FGermain CPazat J(2005)State of the art in compiling HPFThe Data Parallel Programming Model10.1007/3-540-61736-1_45(104-133)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-61736-1_45
Hwang G(2004)An efficient algorithm for communication set generation of data parallel programs with block-cyclic distributionParallel Computing10.1016/j.parco.2004.02.00130:4(473-501)Online publication date: 1-Apr-2004
https://dl.acm.org/doi/10.1016/j.parco.2004.02.001
Gwan-Hwan Hwang (2002)An efficient algorithm for computing communication sets for data parallel programs with block-cyclic distributionProceedings. International Conference on Parallel Processing Workshop10.1109/ICPPW.2002.1039785(623-631)Online publication date: 2002
https://doi.org/10.1109/ICPPW.2002.1039785
Borowiec J(2000)Object-Oriented Implementation of Data-Parallelism on Global NetworksLanguages and Compilers for Parallel Computing10.1007/3-540-48319-5_8(120-130)Online publication date: 12-May-2000
https://doi.org/10.1007/3-540-48319-5_8
Tseng EGaudiot J(1999)Communication Generation for Aligned and Cyclic(K) Distributions Using Integer LatticeIEEE Transactions on Parallel and Distributed Systems10.1109/71.75278010:2(136-146)Online publication date: 1-Feb-1999
https://dl.acm.org/doi/10.1109/71.752780
Hwang GLee J(1999)Communication set generations with CSD calculus and expression-rewriting frameworkParallel Computing10.1016/S0167-8191(99)00037-X25:9(1105-1130)Online publication date: 1-Sep-1999
https://dl.acm.org/doi/10.1016/S0167-8191%2899%2900037-X
Gwan-Hwan Hwang Jenq Kuen Lee (1998)An expression-rewriting framework to generate communication sets for HPF programs with block-cyclic distributionProceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing10.1109/IPPS.1998.669891(62-68)Online publication date: 1998
https://doi.org/10.1109/IPPS.1998.669891
Pavlovic VSharma RHuang T(1997)Visual Interpretation of Hand Gestures for Human-Computer InteractionIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/34.59822619:7(677-695)Online publication date: 1-Jul-1997
https://dl.acm.org/doi/10.1109/34.598226

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

Analysis of local enumeration and storage schemes in HPF

Efficient Dynamic Local Enumeration for HPF

Enumeration schemes for vincular patterns