article

Free access

Compiling Fortran 8x array features for the connection machine computer system

Authors:

Kathleen Knobe,

Guy L. Steele, Jr.Authors Info & Claims

ACM SIGPLAN Notices, Volume 23, Issue 9

Pages 42 - 56

https://doi.org/10.1145/62116.62121

Published: 01 January 1988 Publication History

Abstract

The Connection Machine® computer system supports a data parallel programming style, making it a natural target architecture for Fortran 8x array constructs. The Connection Machine Fortran compiler generates VAX code that performs scalar operations and directs the Connection Machine to perform array operations. The Connection Machine virtual processor mechanism supports elemental operations on very large arrays. Most array operators and intrinsic functions map into single instructions or short instruction sequences. Noncontiguous array sections, array-valued subscripts, and parallel constructs such as WHERE and FORALL are also readily accommodated on the Connection Machine. In addition to such customary optimizations as common subexpression elimination, the CM Fortran compiler minimizes data motion for aligning array operations, minimizes transfers between the Connection Machine and the VAX and minimizes context switching for masked computations.

References

[1]

Alien, Randy. Dependence Analysis for tubac~ipfed Variables and its Application to Program Transformaflons. Ph.D. thesis. Rice University (Houston, Texas, April 1983).

Digital Library

[2]

Alien, Randy, and Kennedy, Ken. Vector" Register Allocation. Technical Report. Rice University (Houston, Texas, April 1988).

[3]

Draft Proposed Revised American National Standard Programmin9 Language Fortran, ANSI X3.9-198x edition. American National Standards Institute, Inc. (Washington, D. C., 1987).

[4]

Batcher, K. E. Design of a massively parallel processor. IEEE Transactions on Computers C-~9, 9 (September 1980), 836-840.

[5]

Bouknight, W. J., Denenberg, Stewart A., Mcintyre, David E., Randall, J. M., Sameh, Amed H., and Slotnick, Daniel L. The ILLIAC IV system. Proceedings of the IEEE 60, 4 (April 1972).

[6]

Chow, Frederick C. A Portable Machlne-Independent Global Optimizer--Design and Measurements. Technical Report 83-254. Stanford University (Stanford, California, December 1983).

[7]

Gilman, Leonard, and Rose, Alien J. APL: An Interactive Approach, second edition. Wiley (New York, 1976).

Digital Library

[8]

Gottlieb, R., Kimball, K., Jaskiewiez, T., and Swift, R. A new way to speed up eL supercomputer. Electronics 58, 30 (July 1985), 56-58.

[9]

Hillis, W. Daniel. The Connection Machine. MIT Press (Cambridge, Massachusetts, 1985).

Digital Library

[10]

HiUis, W. Daniel, and Steele, Guy L., Jr. Data parallel algorithms. Con~munications of the A CM ~9, 12 (December 1986), 1170-1183.

Digital Library

[11]

Knobe, Kathleen, Loveman, David B., Marcus, Mark, and Wells, Ian. A Fortran Compiler for fhe Massively Parallel Processor. Technical Report CADD-8402-2101. Massachusetts Computer Associates (COMPASS) (Wakefield, Massachusetts, February 1984).

[12]

Kruskal, C. P., Rudolph, L., and Snlr, M. The power of parallel prefix. IEEE Transactions on Computers C-3~, 10 (October 1985), 965-968.

[13]

Loveman, David B. Fortran on processor array computers: The MPP as a case study. In Computers in Aerospace Conference IV. American Institute of Aeronautics and Astronautics (October 1983).

[14]

Mace, Mary E. Memory Storage Pa~terns in Parallel Processing. Kluwer Academic PubLishers (Boston, 1987).

Digital Library

[15]

Millstein, Robert E. Control structures in illiac IV Fortran. Corn. munications of the ACM 16, 10 (October 1973), 621-627.

Digital Library

[16]

Morel, E., and Renvoise, C. Global optimization by suppression of partial redundancies. Communications of fhe A CM ~, 2 (February 1979), 96-103.

Digital Library

[17]

Potter, J. L., editor. The Massively Parallel Processor. Scientific Computation Series. MIT Press (Cambridge, Massachusetts, 1985).

Digital Library

[18]

Presberg, David L., and Johnson, Neil W. The Paralyzer: IV- TRAN's paralIelism analyser and synthesizer. A CM SIGPLAN Notices 10, 3 (March 1975), 9-16.

Digital Library

[19]

Reeves, A. P., and Brunner, J. D. The Language Parallel Pascal and Other Aspects of the Massively Parallel Processor. Technical Report. Cornell University (Ithaca, New York, December 1982).

[20]

Reeves, Anthony P. Parallel Pascal and the Massively Parallel Processor, pages 230-260. In The Massively Parallel Processor, Scientific Computation Series. MIT Press (Cambridge, Massachusetts, 1985), 230-260.

[21]

Russell, R.M. The Cray-1 computer system. Communications of the ACM ~1 (1978), 63-78.

Digital Library

[22]

Connection Machine Model CM-~ Technical Summary}. Thinking Machines Corporation (Cambridge, Massachusetts, April 1987).

[23]

Connection Machine Parallel Instruction Set (PARIS), Release ~, Revision 7. Thinking Machines Corporation (Cambridge, Massachusetts, :July 1986).

Cited By

Bodin FEssafi HPic M(1997)A specific compilation scheme for image processing architectureProceedings Fourth IEEE International Workshop on Computer Architecture for Machine Perception. CAMP'9710.1109/CAMP.1997.631890(56-60)Online publication date: 1997
https://doi.org/10.1109/CAMP.1997.631890
Crowl LLeBlanc T(1994)Parallel programming with control abstractionACM Transactions on Programming Languages and Systems10.1145/177492.17758416:3(524-576)Online publication date: 1-May-1994
https://dl.acm.org/doi/10.1145/177492.177584
Willhoft R(1991)Comparison of the functional power of APL2 and FORTRAN 90ACM SIGAPL APL Quote Quad10.1145/114055.11409421:4(343-357)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/114055.114094
Show More Cited By

Index Terms

Compiling Fortran 8x array features for the connection machine computer system
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
      1. Systolic arrays
2. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language types

Recommendations

Compiling Fortran 8x array features for the connection machine computer system
PPEALS '88: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems

The Connection Machine® computer system supports a data parallel programming style, making it a natural target architecture for Fortran 8x array constructs. The Connection Machine Fortran compiler generates VAX code that performs scalar operations and ...
Optimizing CM Fortran Compiler for Connection Machine Computers

This paper describes the techniques that are used in the CM Fortran 1.0 compiler to map the fine-grained array parallelism of Fortran 90 onto the Connection Machine architectures, and presents performance results to illustrate the effectiveness of the ...
Compiling machine-independent parallel programs

Initial evidence is presented that explicitly parallel, machine-independent programs can automatically be translated into parallel machine code that is competitive in performance with hand-written code.The programming language used is Modula-2*, an ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 23, Issue 9

Proceedings of the ACM/SIGPLAN PPEALS 1988

Sept. 1988

246 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/62116

Editor:
Richard L. Wexelblat
Philips Labs., Briarcliff Manor, NY

Issue’s Table of Contents

PPEALS '88: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
January 1988
246 pages
ISBN:0897912764
DOI:10.1145/62115
Editor:
Richard L. Wexelblat
Philips Labs., Briarcliff Manor, NY

Copyright © 1988 ACM.

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 1988

Published in SIGPLAN Volume 23, Issue 9

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

48
Total Citations
View Citations
424
Total Downloads

Downloads (Last 12 months)75
Downloads (Last 6 weeks)18

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bodin FEssafi HPic M(1997)A specific compilation scheme for image processing architectureProceedings Fourth IEEE International Workshop on Computer Architecture for Machine Perception. CAMP'9710.1109/CAMP.1997.631890(56-60)Online publication date: 1997
https://doi.org/10.1109/CAMP.1997.631890
Crowl LLeBlanc T(1994)Parallel programming with control abstractionACM Transactions on Programming Languages and Systems10.1145/177492.17758416:3(524-576)Online publication date: 1-May-1994
https://dl.acm.org/doi/10.1145/177492.177584
Willhoft R(1991)Comparison of the functional power of APL2 and FORTRAN 90ACM SIGAPL APL Quote Quad10.1145/114055.11409421:4(343-357)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/114055.114094
Willhoft RSchulz C(1991)Comparison of the functional power of APL2 and FORTRAN 90Proceedings of the international conference on APL '9110.1145/114054.114094(343-357)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/114054.114094
Skillicorn D(1991)Models for practical parallel computationInternational Journal of Parallel Programming10.1007/BF0140784020:2(133-158)Online publication date: Apr-1991
https://doi.org/10.1007/BF01407840
Zedan H(1990)Key references in distributed computer systems 1959–1989Distributed Computer Systems10.1016/B978-0-408-02938-4.50016-4(193-295)Online publication date: 1990
https://doi.org/10.1016/B978-0-408-02938-4.50016-4
Greenlaw RSnyder L(1990)Achieving speedups for APL on an SIMD distributed memory machineInternational Journal of Parallel Programming10.1007/BF0140783319:2(111-127)Online publication date: 1-Dec-1990
https://dl.acm.org/doi/10.1007/BF01407833
Tuck R(1989)An optimally portable SIMD programming languageProceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation10.1109/FMPC.1988.47505(617-624)Online publication date: 1989
https://doi.org/10.1109/FMPC.1988.47505
Diaconescu RZima H(2010)Locality Awareness in a High-Productivity Programming LanguagePetascale Computing10.1201/9781584889106.ch22(463-485)Online publication date: 31-Jan-2010
https://doi.org/10.1201/9781584889106.ch22
Diaconescu RZima H(2007)An Approach To Data Distributions in ChapelInternational Journal of High Performance Computing Applications10.1177/109434200707845121:3(313-335)Online publication date: 1-Aug-2007
https://dl.acm.org/doi/10.1177/1094342007078451
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents