Nothing Special   »   [go: up one dir, main page]

skip to main content
article
Free access

Using an architectural knowledge base to generate code for parallel computers

Published: 01 September 1989 Publication History

Abstract

The authors present a reconfigurable compiler for distributed memory parallel computers that performs automatic program partitioning, mapping, and communication code generation under the guidance of directives supplied by the programmer.

References

[1]
Aho, A.V., Sethi, R., and Ullman, J.D. Compilers: Principles, techniques, and tools. Addison-Wesley, Reading, MA, 1986.
[2]
Cattell, R.G.G., Newcomer, J.M., and Leverett, B.W. Code generation in a machine-independent compiler. ACM SIGPLAN Notices 14, 8 (Aug. 1979), 65-74.
[3]
Glanville, R.S., and Graham, S.L. A new method for compiler code generation. In 5th Annual ACM Symposium on Principles of Programruing Languages (Tucson, Ariz., Jan. 23-25, 1978), pp. 231-240.
[4]
Mills, H., et al. Principles of Computer Programming: A Mathematical Approach. Allyn & Bacon, Newton, Mass., 1987.
[5]
Rymarczyk, J.W. Coding guidelines for pipelined processors. In Proceedings of the Symposium on Architectural Support for Programming t,anguages and Operating Systems (Palo Alto, Calif., Mar. 1-3, 1982), pp. ~ 2-19.
[6]
Tanenbaum, A.S., et al. A practical tool kit for making portable compilers. Commun. ACM 26, 9 (Sept. 1983), 654-660.
[7]
Terrano, A.E. On the grain-size dependence of interprocessor communication demand. Submitted to IEEE Trans. Comput.
[8]
Wulf, W., et al, The Design of an Optimizing Compiler. American Elsevier, New York, 1975.

Cited By

View all

Recommendations

Reviews

Michael Wolfe

The authors present a reconfigurable compiler for distributed memory parallel computers. Like similar projects underway elsewhere, this compiler presents the user with a single address space programming model; the user also annotates the program with directives to guide the partitioning phase. The compiler then automatically distributes the data arrays onto a distributed memory processor system and maps the computation and communication onto the processors. The unique element of this project is the use of Prolog in the two code generators. The first code generator partitions data and generates code for control flow, using appropriate rules describing the parallel system architecture. The second code generator generates code for the computation (like a sequential code generator) and uses Prolog rules describing the detailed processor architecture. The bulk of the paper describes the code generated for two examples (iterative solution of a PDE and an FFT). The authors do not describe the types of rules used in the compiler or the level of effort needed to port the compiler to a new architecture. No references to other published work on this project are given. This paper is a reasonable high-level introduction to this project but does not give nearly enough specifics to satisfy any detailed interest in the subject matter.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

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 September 1989
Published in CACM Volume 32, Issue 9

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)48
  • Downloads (Last 6 weeks)10
Reflects downloads up to 26 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (1994)Reflective interconnection networksComputers and Electrical Engineering10.1016/0045-7906(94)90043-420:4(289-308)Online publication date: 1-Jul-1994
  • (1992)Optimal and near optimal tree scheduling for parallel systemsProceedings of the 1992 Fourth IEEE Symposium on Parallel and Distributed Processing10.1109/SPDP.1992.242755(112-119)Online publication date: 1-Dec-1992
  • (1992)Efficient parallel implementation of sequence analysis algorithms using a global address space modelMathematical and Computer Modelling: An International Journal10.1016/0895-7177(92)90152-B16:6-7(51-77)Online publication date: 1-Jun-1992
  • (1991)Precursor for parallel developmentProceedings of the 19th annual conference on Computer Science10.1145/327164.327216(85-93)Online publication date: 1-Apr-1991
  • (1991)Three new-generation software environmentsCommunications of the ACM10.1145/103701.10370834:6(46-59)Online publication date: 1-Jun-1991
  • (1990)Writing retargetable parallel programs for low and high level vision using a global address space[1990] Proceedings. 10th International Conference on Pattern Recognition10.1109/ICPR.1990.119437(591-595)Online publication date: 1990
  • (1990)MOPPS: a scheme for managing parallel scientific programs in a distributed architectureDigest of Papers Compcon Spring '90. Thirty-Fifth IEEE Computer Society International Conference on Intellectual Leverage10.1109/CMPCON.1990.63713(387-394)Online publication date: 1990

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media