[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/113445.113458acmconferencesArticle/Chapter ViewAbstractPublication PagespldiConference Proceedingsconference-collections
Article
Free access

Fortran at ten gigaflops: the connection machine convolution compiler

Published: 01 May 1991 Publication History
First page of PDF

References

[1]
Allen, Frances E. and Cocke, John. A Catalogue of Optimizing Transformations. In Rustin, Randall (ed.), Design and Optimization of Compilers (Proceedings of the Courant Computer Science Symposium 5, March 1971). Prentice-Hall (Englewood Cliffs, N.J., 1972), 1-30.
[2]
Baker, Lawrence J. Hypercube Performance for 2-D Seismic Finite-Difference Modeling. Proc. Third Conference on Hypercube Concurrent Computers and Applications. ACM (Pasadena, 1988), 1146-1156.
[3]
Gallivan, Kyle; Jalby, William; and Gannon, Dennis. On the Problem of Optimizing Data Transfers for Complex Memory Systems. Proc. 1988 International Conference on Supercomputing. ACM (St. Malo, France, July 1988), 238-253.
[4]
Gannon, Dennis; Jalby, William; and Gallivan, Kyle. Strategies for Cache and Local Memory Management by Global Program Transformations. Proc. 1987 international Conf. on Supercomputing (Athens, 1987).
[5]
Hillis, W. Daniel. The Connection Machine. MIT Press (Cambridge, Massachusetts, 1985).
[6]
Hudak, David E., and Abraham, Santosh G. Compiler Techniques for Data Partitioning of Sequentially Iterated Parallel Loops. Proc. 1990 International Conference on Supercomputing. ACM SIGARCH (June 1990), 187-200.
[7]
The 1990 Gordon Bell Prize Winners. IEEE Software 8, 2 (March 1991), 4-5.
[8]
Ikudawa, K.; Fox, G.C.; Kolawa, A.; and Flower, J.W. An Automatic and Symbolic Parallelization System for Distributed Memory Parallel Computers. Proc. Fifth Distributed Memory Computing Conference. iEEE Computer Society (Charleston, April 1990), 1105-1114.
[9]
Koelbel, Charles; Mahrotra, Piyush; and Van Rosendale, John. Supporting Shared Data Structures on Distributed Memory Architectures. Proc. Second ACM SIGPLAN Syrup. on Principles and Parctice of Parallel Programming (PPOPP) (Seattle, March 1990), 177-186.
[10]
Koelbel, Charles; Mahrotra, Piyush; Slatz, joel; and Berryman, Harry. Parallel Loops on Distributed Machines. Proc. Fifth Distributed Memory Computing Conference. IEEE Computer Society (Charleston, April 1990), 1017-1027.
[11]
Socha, David G. An Approach to Compiling Single- Point Iterative Programs for Distributed Memory Computers. Proc. Fifth Distributed Memory Computing Conference. IEEE Computer Society (Charleston, April 1990), 1017-1027.
[12]
Society for Industrial and Applied Mathematics. Both Gordon Bell Prize Winners Tackle Oil Industry Problems. Siam News 23, 3 (May 1990).
[13]
Solchenbach, Karl. Parallel CFD Algorithms on SUPRENUM. Proc. Third International Conference on Supercomputing. International Supercomputing Institute, Inc. (1988), 313-322.
[14]
Thinking Machines Corporation. Connection Machine Model CM-2 Technical Summary. Technical report HA87- 4 (Cambridge, Massachusetts, April 1987).
[15]
Wolfe, Michael. More Iteration Space Tiling. Proc. Supercomputing '89. IEEE Computer Society and ACM SiGARCH (Reno, Nov. 1989), 655-664.
[16]
Wolfe, Michael. Optimizing Supercompiters for Supercomputers. MiT Press (Cambridge, Mass., 1989).

Cited By

View all
  • (2011)The pochoir stencil compilerProceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures10.1145/1989493.1989508(117-128)Online publication date: 4-Jun-2011
  • (2010)A Performance Study for Iterative Stencil Loops on GPUs with Ghost Zone OptimizationsInternational Journal of Parallel Programming10.1007/s10766-010-0142-539:1(115-142)Online publication date: 30-Jun-2010
  • (2009)Performance modeling and automatic ghost zone optimization for iterative stencil loops on GPUsProceedings of the 23rd international conference on Supercomputing10.1145/1542275.1542313(256-265)Online publication date: 8-Jun-2009
  • Show More Cited By

Index Terms

  1. Fortran at ten gigaflops: the connection machine convolution compiler

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      PLDI '91: Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
      May 1991
      356 pages
      ISBN:0897914287
      DOI:10.1145/113445
      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]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 01 May 1991

      Permissions

      Request permissions for this article.

      Check for updates

      Qualifiers

      • Article

      Conference

      PLDI91
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 406 of 2,067 submissions, 20%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)333
      • Downloads (Last 6 weeks)25
      Reflects downloads up to 28 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2011)The pochoir stencil compilerProceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures10.1145/1989493.1989508(117-128)Online publication date: 4-Jun-2011
      • (2010)A Performance Study for Iterative Stencil Loops on GPUs with Ghost Zone OptimizationsInternational Journal of Parallel Programming10.1007/s10766-010-0142-539:1(115-142)Online publication date: 30-Jun-2010
      • (2009)Performance modeling and automatic ghost zone optimization for iterative stencil loops on GPUsProceedings of the 23rd international conference on Supercomputing10.1145/1542275.1542313(256-265)Online publication date: 8-Jun-2009
      • (2009)A Multilevel Parallelization Framework for High-Order Stencil ComputationsProceedings of the 15th International Euro-Par Conference on Parallel Processing10.1007/978-3-642-03869-3_61(642-653)Online publication date: 23-Aug-2009
      • (2007)An Approach for Enhancing Inter-processor Data Locality on Chip MultiprocessorsTransactions on High-Performance Embedded Architectures and Compilers I10.1007/978-3-540-71528-3_14(214-233)Online publication date: 21-Jul-2007
      • (2005)Optimizing inter-processor data locality on embedded chip multiprocessorsProceedings of the 5th ACM international conference on Embedded software10.1145/1086228.1086271(227-236)Online publication date: 18-Sep-2005
      • (2005)An MPI prototype for compiled communication on Ethernet switched clustersJournal of Parallel and Distributed Computing10.1016/j.jpdc.2005.04.01465:10(1123-1133)Online publication date: 1-Oct-2005
      • (2005)Optimizing Fortran 90 shift operations on distributed-memory multicomputersLanguages and Compilers for Parallel Computing10.1007/BFb0014198(161-175)Online publication date: 9-Jun-2005
      • (2005)Massively parallel computing: Data distribution and communicationParallel Architectures and Their Efficient Use10.1007/3-540-56731-3_9(68-92)Online publication date: 28-May-2005
      • (2004)Cache-Efficient Multigrid AlgorithmsThe International Journal of High Performance Computing Applications10.1177/109434200404129518:1(115-133)Online publication date: 1-Feb-2004
      • 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

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media