Article

Free access

Compile-time generation of regular communications patterns

Author:

Charles KoelbelAuthors Info & Claims

Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing

Pages 101 - 110

https://doi.org/10.1145/125826.125890

Published: 01 August 1991 Publication History

PDF eReader

References

[1]

F. Andrd, J. Pazat, and H. Thomas. Pandore: A system to manage data distribution. In Proceedings of the 1990 A CM Internatzonal Conference on Supercomputing, Amsterdam, The Netherlands, June 1990.

Digital Library

Google Scholar

[2]

V. Balasundaram, G. Fox, K. Kennedy, and U. Kremer. An interactive environment for data partitioning and distribution. In Proceedzngs of the 5th Distributed Memory Computing Conference, Charleston, SC, April 1990.

Crossref

Google Scholar

[3]

D. Callahan and K. Kennedy. Compiling programs for distributed-memory multiprocessors. Journal of Supercomputing, 2:151-169, October 1988.

Crossref

Google Scholar

[4]

A. Cheung and A. Reeves. The Paragon multicomputer environment: A first implementation. Technical Report EE-CEG-89-9~ Cornell University Computer Engineering Group, Ithaca, NY, July 1989.

Google Scholar

[5]

G. Fox, S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, C. Tseng, and M. Wu. Fortran D language specification. Technical Report TR90-141, Dept. of Computer Science, Rice University, December 1990.

Google Scholar

[6]

M. Gem&.Automatic Parallelization for Distribute&Memory Multiprocessing Systems. PhD thesis, University of Bonn, December 1989.

Google Scholar

[7]

C. Koelbel. Compiling Programs for Nonshared Memory Machines. PhD thesis, Purdue University, West Lafayette, IN, August 1990.

Digital Library

Google Scholar

[8]

C. Koelbel, P. Mehrotra, and J. Van Rosendale. Supporting shared data structures on distributed memory machines. In Proceedings of the Second A CM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seattle, WA, March 1990.

Digital Library

Google Scholar

[9]

J. Li and M. Chen. Generating explicit communication from shared-memory program references. In Proceedzngs of Supercomputzng '90, New York, NY, November 1990.

Digital Library

Google Scholar

[10]

M. Quinn and P. Hatcher. Data parallel programming on multicomputers. IEEE Software, 7(5):69- 76, September 1990.

Digital Library

Google Scholar

[11]

A. Rogers and K. Pingali. Process decomposition through locality of reference. In Proceedings of the SIGPLAN '89 Conference on Program Language Design and Implementation, Portland, OR, June 1989.

Digital Library

Google Scholar

[12]

M. Rosing, lZ. Schnabel, and R. Weaver. Expressing complex parallel algorithms in DINO. In Proceedings of the ~th Conference on Hypercube Concurrent Computers and Applicatzons, Monterey, CA, March 1989.

Google Scholar

[13]

P. S. Tseng. A parallelizing compiler for distributed memory parallel computers. In Proceedings of the SIGPLAN '90 Conference on Program Language Design and Implementatzon, White Plains, NY, June 1990.

Google Scholar

[14]

H. Zima, H.-J. Bast, and M. Gerndt. SUPERB: A tool for semi-automatic MIMD/SIMD parallelization. Parallel Computing, 6:1-18, 1988.

Crossref

Google Scholar

Cited By

View all

Hiranandani SKennedy KMellor-Crummey JSethi A(2014)Compilation techniques for block-cyclic distributionsACM International Conference on Supercomputing 25th Anniversary Volume10.1145/2591635.2667169(205-216)Online publication date: 10-Jun-2014
https://dl.acm.org/doi/10.1145/2591635.2667169
Midkiff S(2012)Automatic Parallelization: An Overview of Fundamental Compiler TechniquesSynthesis Lectures on Computer Architecture10.2200/S00340ED1V01Y201201CAC0197:1(1-169)Online publication date: 28-Jan-2012
https://doi.org/10.2200/S00340ED1V01Y201201CAC019
Lee JSato M(2010)Implementation and Performance Evaluation of XcalableMPProceedings of the 2010 39th International Conference on Parallel Processing Workshops10.1109/ICPPW.2010.62(413-420)Online publication date: 13-Sep-2010
https://dl.acm.org/doi/10.1109/ICPPW.2010.62
Show More Cited By

Index Terms

Recommendations

Compile-time evaluation and code generation for semantics-directed compilers (denotational)
Compiling regular patterns
ICFP '03: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming

Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing tree-structured data such as XML. A compiler for such a language must address not only the familiar problems of pattern optimization for ML-...
Compiling regular patterns

Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing tree-structured data such as XML. A compiler for such a language must address not only the familiar problems of pattern optimization for ML-...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing

August 1991

920 pages

ISBN:0897914597

DOI:10.1145/125826

Conference Chair:
Ray Elliott

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 August 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '91

Sponsor:

SIGARCH
IEEE-CS

SC '91: International Conference for High Performance Computing, Networking, Storage and Analysis

November 18 - 22, 1991

New Mexico, Albuquerque, USA

Acceptance Rates

Supercomputing '91 Paper Acceptance Rate 83 of 215 submissions, 39%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
249
Total Downloads

Downloads (Last 12 months)54
Downloads (Last 6 weeks)16

Reflects downloads up to 20 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hiranandani SKennedy KMellor-Crummey JSethi A(2014)Compilation techniques for block-cyclic distributionsACM International Conference on Supercomputing 25th Anniversary Volume10.1145/2591635.2667169(205-216)Online publication date: 10-Jun-2014
https://dl.acm.org/doi/10.1145/2591635.2667169
Midkiff S(2012)Automatic Parallelization: An Overview of Fundamental Compiler TechniquesSynthesis Lectures on Computer Architecture10.2200/S00340ED1V01Y201201CAC0197:1(1-169)Online publication date: 28-Jan-2012
https://doi.org/10.2200/S00340ED1V01Y201201CAC019
Lee JSato M(2010)Implementation and Performance Evaluation of XcalableMPProceedings of the 2010 39th International Conference on Parallel Processing Workshops10.1109/ICPPW.2010.62(413-420)Online publication date: 13-Sep-2010
https://dl.acm.org/doi/10.1109/ICPPW.2010.62
Hu CLi JWang JLi YDing LLi J(2006)Communication Generation for Irregular Parallel ApplicationsProceedings of the international symposium on Parallel Computing in Electrical Engineering10.1109/PARELEC.2006.24(263-270)Online publication date: 13-Sep-2006
https://dl.acm.org/doi/10.1109/PARELEC.2006.24
Kaushik SHuang CSadayappan P(2005)Incremental generation of index sets for array statement execution on distributed-memory machinesLanguages and Compilers for Parallel Computing10.1007/BFb0025883(251-265)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0025883
Germain CDelaplace F(2005)Automatic vectorization of communications for data-parallel programsEURO-PAR '95 Parallel Processing10.1007/BFb0020483(429-440)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0020483
Venkatachar ARamanujam JThirumalai A(2005)Generalized overlap regions for communication optimization in data-parallel programsLanguages and Compilers for Parallel Computing10.1007/BFb0017266(404-419)Online publication date: 10-Jun-2005
https://doi.org/10.1007/BFb0017266
Kaushik SHuang CSadayappan P(2005)Compiling array statements for efficient execution on distributed-memory machines: Two-level mappingsLanguages and Compilers for Parallel Computing10.1007/BFb0014201(209-223)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0014201
Thirumalai ARamanujam J(2005)Fast address sequence generation for data-parallel programs using integer latticesLanguages and Compilers for Parallel Computing10.1007/BFb0014200(191-208)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0014200
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
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

Compile-time evaluation and code generation for semantics-directed compilers (denotational)

Compiling regular patterns

Compiling regular patterns