skip to main content
article
Free Access

A static performance estimator to guide data partitioning decisions

Published:01 April 1991Publication History
First page image

References

  1. 1 M. Annaratone, C. Pommerell, and R. Riihl. Interprocessor communication and performance in distributed memory parallel processors. Proceedings of the 16th Symposium on Computer Architecture, Jerusalem, pages 315-324, May 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 V. Balasundaram. A static performance estimator. Technical Report C3P-941, Caltech Concurrent Computation Program, Caltech, Pasadena, CA, August 1990.Google ScholarGoogle Scholar
  3. 3 V. Balasundaram, G. Fox, K. Kennedy, and U. Kremer. An interactive environment for data partitioning and distribution. Proceedings of the Fifth Distributed Memory Computing Conference, Charleston, S. Carolina, April 1990.Google ScholarGoogle ScholarCross RefCross Ref
  4. 4 V. Balasundaram, K. Kennedy, U. Kremer, K. McKinley, and J. Subhlok. The ParaScope editor: an interactive parallel programming tool. Supercomputing 89, Reno, Nevada, November 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 D. Callahan and K. Kennedy. Compiling programs for distributed-memory multiprocessors. Journal of Supercomputing, 2:151-169, October 1988.Google ScholarGoogle ScholarCross RefCross Ref
  6. 6 M. Chen, Y. Choo, and J. Li. Compiling parallel programs by optimizing performance. Journal of Supercomputing, 2:171-207, 1988.Google ScholarGoogle ScholarCross RefCross Ref
  7. 7 ParaSoft Corporation. EXPRESS user manual. 1989.Google ScholarGoogle Scholar
  8. 8 G. Fox, S. IIiranandani, K. Kennedy, C. Koelbel, U. Kremer, C. Tseng, and M. Wu. Fortran D language specification. Technical Report 90-141, Rice University, Itouston, TX, December 1990.Google ScholarGoogle Scholar
  9. 9 G. Fox, M. Johnson, G. Lyzenga, S. Otto, j. Salmon, and D. Walker. Solvzng Problems on Concurrent Processors, Vols. 1 and 2. Prentice Hall, Englewood Cliffs, NJ, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 S. Hiranandani, K. Kennedy, and C. Tseng. Compiler support for machine-independent parallel programming in Fortran D. in Compilers and Runlime Software for Scalable MuRiprocessors (J. Saltz and P. Mehrotra, eds.), to appear 1991.Google ScholarGoogle Scholar
  11. 11 K. Ikudome, G. Fox, A. Kolawa, and J.W. Flower. An automatic and symbolic parallelization system for distributed memory parallel computers. Proceedings of the Fifth Distributed Memory Computing Conference, Charleston, S. Carolina, April 1990.Google ScholarGoogle ScholarCross RefCross Ref
  12. 12 C. Koelbel, P. Mehrotra, and J. Van Rosendale. Supporting shared data structures on distributed memory architectures. Proceedings of the Second A CM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 177-186, March 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 U. Kremer. Automatic data partitioning and distribution for loosely synchronous problems in aa interactive programming environment. Technical Report In preparation, Rice University, Houston, TX.Google ScholarGoogle Scholar
  14. 14 J. Li and M. Chen. Generating explicit communication from shared memory program references. Supercompuling 90, New York, pages 865-877, Nov 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 P. Mehrotra and 3. Van Rosendale. Compiling high level constructs to distributed memory architectures. Proceedings of the Fourth Conference on Hypercube Concurrent Computers and Applications, March 1989.Google ScholarGoogle Scholar
  16. 16 W.It. Press, B.P. Flannery, S.A. Teukolsky. and W.T. Vetterling. Numerical recipes in C: the art of scientific computing. Cambridge University Press, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17 J. Ramanujan and P. Sadayappan. A methodology for parallelizing programs for complex memory multiprocessors. Supercomputing 89, R, eno, Nevada, November 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 A. Rogers and K. Pingali. Process decomposition through locality of reference. A CM SIGPLAN 89 Conference on Programming Language Design and Implementation, pages 69-80, June 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19 R. Riihl and M. Annaratone. Parallelization of Fortran code on distributed memory parallel processors. Proceedings of the A CM International Conference on Supercomputing, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20 V. Sarkar. Determining average program execution times and their variance. Proceedings of the SIGPLAN 89 conference on programming language design and implementation, pages 298-312, July 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21 It.P. Zima, H.J. Bast, and M. Gerndt. SUPERB: A tool for semi-automatic SIMD/MIMD parallelization. Parallel Computing, 6:1-18, 1988.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. A static performance estimator to guide data partitioning decisions

            Recommendations

            Comments

            Login options

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

            Sign in

            Full Access

            • Published in

              cover image ACM SIGPLAN Notices
              ACM SIGPLAN Notices  Volume 26, Issue 7
              July 1991
              223 pages
              ISSN:0362-1340
              EISSN:1558-1160
              DOI:10.1145/109626
              Issue’s Table of Contents
              • cover image ACM Conferences
                PPOPP '91: Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
                April 1991
                223 pages
                ISBN:0897913906
                DOI:10.1145/109625

              Copyright © 1991 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: 1 April 1991

              Check for updates

              Qualifiers

              • article

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader