Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/109025.109126acmconferencesArticle/Chapter ViewAbstractPublication PagesicsConference Proceedingsconference-collections
Article
Free access

Analysis and transformation in the ParaScope editor

Published: 01 June 1991 Publication History
First page of PDF

References

[1]
F. Allen, M. Burke, P. Charles, Ft. Cytron, and J. Ferrante. An overview of the PTRAN analysis system for multiprocessing, in Proceedings of the First International Conference on Supercomputing. Springer-Verlag, Athens, Greece, June 1987.
[2]
F. Allen and J. Cocke. A catalogue of optimizing transformations. In J. Rustin, editor, Design and Optimization o} Compilers. Prentice-Hall, 1972.
[3]
J. R. Allen. Dependence Analysis }or Subscripted Variables and Its Application to Program Transformations. PhD thesis, Rice University, April 1983.
[4]
J. R. Allen and K. Kennedy. Automatic translation of Fortran pro6ramn to vectar form. A CM Transactions on Programming Languages and Systems, 9(4):491-542, October 1987.
[5]
V. Balasundaram, G. Fox, K. Kennedy, and U. Kremer. An interactive environment for data partitioning and distribution. In Proceedings of the 5th Distributed Memory Computing Conference, Charleston, SC, April 1990.
[6]
V. Balasundaxazn, G. Fox, K. Kennedy, and U. Kremer. A static performance estimator to guide data partitioning decisions, in Proceedings of the Third A CM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Williamsburg, VA, April 1991.
[7]
V. Balasundaram and K. Kennedy. A technique for summarizing data access and its use in parallehsm enhancing transformations. In Proceedings of the A CM SIGPLAN '89 ConJerence on Program Language Design and Implementation, Portland, OR, June 1989.
[8]
V. Balasundaram, K. Kennedy, U. Kremer, K. S. MCKinley, and J. Subhlok. The ParaScope Editor: An interactive parallel programming tool. In Proceedings of Supercomputing '89, Reno, NV, November 1989.
[9]
U. Banerjee. Unimodular transformations of double loops. In Proceedings of the Third Workshop on Languages and Compilers }or Parallel Computing, Irvine, CA, August 1990.
[10]
M. Burke. An interval-based approach to exhaustive and incremental interprocedural data-flow analysis. A CM Trans actions on Programming Languages and Systems, 12(3):341- 395, 1990.
[11]
M. Burke, K. Cooper, K. Kennedy, and L. Torczon. Interprocedural optimization: Eliminating unnecessary recompilation. Technical Report TR90-126, Dept. of Computer Science, Rice University, 1990.
[12]
D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In Proceedings of the A CM SIGPLAN '90 Conference on Program Language Design and Implementation, White Plains, NY, June 1990.
[13]
D. Callahan, J. Cocke, and K. Kennedy. Estimating interlock and improving balance for pipelined machines. Journal of Parallel and Distributed Computing, 5(4):334-358, August 1988.
[14]
D. Callahan, K. Cooper, R. Hood, K. Kennedy, and L. Torczon. ParaScope: A parallel programming environment. The International Journal of Supercomputer Applications, 2(4):84-99, Winter 1988.
[15]
D. Callahan, K. Cooper, K. Kennedy, and L. Torczon. Interprocedural constant propagation. In Proceedings o} the SIGPLAN '86 Symposium on Compiler Construction, PMo Alto, CA, July 1986.
[16]
D. Callahan and K. Kennedy. Analysis of interprocedura} side effects in a parMlel programming environment. In Proceedings of the First International Conference on Supercomgating. Springer-Verlag, Athens, Greece, June 1987.
[17]
D. Callahan, K. Kennedy, and J. Subhlok. Analysis of of event synchronization in a parallel programming tool. In Proceedings o.f the Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seattle, WA, March 1990.
[18]
D. Chen, H. Su, and P. Yew. The impact of synchronization and granularity on parallel systems. In Proceedings of the 17th Annual international Symposium on Computer Architecture, Seattle, WA, May 1990.
[19]
K. Cooper, M. Hall, and L. Torczon. An experiment with inline substitution. Technical Report TR90-128, Dept. of Computer Science, Rice University, July 1990. To appear in SoJtware~Practice and Expe~'ience.
[20]
K. Cooper, K. Kennedy, and L. Torczon. The impact of interprocedural analysis and optimization in the }Rn programming environment. A CM Transactions on Programm~ng Languages and Systems, 8(4):491-523, October 1986.
[21]
R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. An ctficicnt m~thod of zomputin8 static single assignment form. In ConJerence Record of the Sixteenth A CM Symposium on the Principles of Programming Languages, Austin, TX, June 1989.
[22]
}. Ferrante, K. Ottenstein, and J. Warren. The program dependence graph and its use in optimization. A CM Transactions on Programming Languages and Systems, 9(3):319- 349, July 1987.
[23]
K. Fletcher, K. Kennedy, K. S. MCKinley, and S. Warren. The ParaScope Editor: User interface goals. Technical Report TR90-113, Dept. of Computer Science, Rice University, 1990.
[24]
D. Gannon, W. }alby, and K. GMlivan. Strategies for cache and local memory management by globM program transformotions. In Proceedings of the First International Conference on Supercomputing. Springer-Verlag, Athens, Greece, June 1987.
[25]
G. (3off, K. Kennedy, and C. Tseng. Practical dependence testing. In Proceedings of the A CM SIGPLAN '91 Conference on Program Language Design and Implementation, Toronto, Canada, June 1991.
[26]
V. Guarna, D. Gannon, Y. Gaur, and D. Jablonowski. Faust: An environment for programming parallel scientific applications. In Proceedings of Supercomputing '88, Orlando, FL, November 1988.
[27]
M. Haghighat and C. Polychronopoulos. Symbolic dependence analysis for high performance parallelizing compilers. In Proceedings of the Third Workshop on Languages and Compilers }or Parallel Computing, Irvine, CA, August 1990.
[28]
P. Havlak and K. Kennedy. An implementation of interprocedural bounded regular section analysis. IEEE Transactions on Parallel and Distributed Systems, 2(3), July 1991.
[29]
S. Hiranandani, K. Kennedy, and C. Tseng. Compiler support for machine-independent parallel programming in Fortran D. Technical Report TR90-149, Dept. of Computer Science, Rice University, February 1991. To appear in J. Saltz and P. Mehrotra, editors, Compilers and Runtime Software }or Scalable Mult~processors, Elsevier, 1991.
[30]
1%. Hood, K. Kennedy, and J. Mellor-Crummey. Parallel program debugging with on-the-fly anomaly detection. In Proceedings of Supercomputing '90, New York, NY, November 1990.
[31]
F. Irigoin and R. Trlolet. Supernode partitioning. In Conference Record of the Fifteenth A CM Symposium on the Principles of Programming Languages, San Diego, CA. January 1988.
[32]
K. Kennedy and K. S. MCKinley. Loop distribution with arbitrary control flow. in Proceedings of Supercomputing '90, New York, NY, November 1990.
[33]
K. Kennedy, K. S. MCKinley, and C. Tseng. Interactive parallel programming using the ParaScope Editor. IEEE Transactions on Parallel and Distributed Systems, 2(3), July 1991.
[34]
U. Kremer, H. Zima, H.-J. Bast, and M. Gerndt. Advanced tools and techniques for automatic parallelization. Parallel Computing, 7:387-393, 1988.
[35]
D. Kuck. The Structure of Computcr~ and Computations, Volume I. John Wiley and Sons, New York, NY, 1978.
[36]
D. Kuck, R. Kuhn, B. Leasure, and M. J. Wolfe. The structure of an advanced rctargetable vectorizer. In Supercomputers: Design and Applications, pages 163-178. IEEE Computer Society Press, Silver Spring, MD, 1984.
[37]
D. Kuck, R. Kuhn, D. Padua, B. Leasure, and M. J. Wolfe. Dependence graphs and compiler optimizations. In Conference Record of the Eighth A CM Symposium on the Pmnczpies of Programming Languages, Williamsburg, VA, january 1981.
[38]
D. Kuck, Y. Muraoka, and S. Chen. On the number of operations simultaneously executable in Fortran-like programs and their resulting speedup. IEEE Transactions on Computers, C-21(12):1293-1310, December 1972.
[39]
L. Lamport. The parallel execution of DO loops. Communications of the A CM, 17(2):83-93, February 1974.
[40]
B. Leasure, editor. PCF Fortran: Language Definition, version 3.i. The Parallel Computing Forum, Champaign, IL, August 1990.
[41]
D. Loveman. Program improvement by source-to-source transformations. Journal of the A CM. 17(2):121-145. January 1977.
[42]
K. S. McKinley. Evaluating the potential for automatic parallel code generation. Technical Report TR90-148, Dept. of Computer Science, Rice University, December 1990.
[43]
Y. Muraoka. ParaIIehsm Exposure and Exploitation in Programs. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, February 1971. Report No. 71-424.
[44]
C. Polychronopoulos, M. Girkar, M. Haghighat, C. Lee, B. Leung, and D. Schouten. The ~tructure of Parafrase-2: An advanced parallelizing compiler for C and Fortran. In D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers }or Parallel Computzng. The MIT Press, 1990.
[45]
C. Rosene. Incremental Dependence Analysis. PhD thesis, Rice University, March 1990.
[46]
B. Ryder and M. Carroll. An incremental algorithm for software analysis. In Proceed,ngs of the Second A CM S{GSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, Polo Alto, CA, December 1986.
[47]
B. Ryder and M. Paull. Incremental data flow analysis algorithms. A CM Transactions on Programming Languages and Systems, 10(1):1-50, January 1988.
[48]
B. Shei and D. Cannon. SIGMACS: A programmable programming environment. In Proceedings o/ the Third Workshop on Languages and Compilers .for Parallel Computing, Irvine, CA, August 1990.
[49]
J. Singh and J. Hennessy. An empirical investigation of the effectiveness of and limitations of automatic parallelization. In Proceedings of the International Symposium on Shared Memory Multiprocessors, Tokyo, Japan, April 1991.
[50]
K. Smith and W. Appelbe. PAT - an interactive Fortran parallelizing assistant tool. In Proceedzngs of the 1988 international Conference on Parallel Processing, St. Charles, IL, August 1988.
[51]
K. Smith, W. Appelbe, and K. Stirewalt. Incremental dependence analysis for interactive parallelization. In Proceedings of the 1990 A CM International Conference on Supercomparing, Amsterdam, The Netherlands, June 1990.
[52]
J. Subhlok. Analysis of Synchronization in a Parallel Programming Environment. PhD thesis, Rice University, August 1990.
[53]
M. Wegman and K. Zadeck. Constant propagation with conditional branches. Technical Report CS-89-36, Brown University, May 1989.
[54]
M. E. Wolf and M. Lain. Maximizing parallelism via loop transformations. In Proceedings o} the Third Workshop on Languages and Compilers }or Parallel Computing, Irvine, CA, August 1990.
[55]
M. J. Wolfe. Optimizing Supercompilers for Supercomputers. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, October 1982.
[56]
M. J. Wolfe. Loop skewing: The wavefront method revisited. International Journal of Parallel Programming, 15(4):279- 293, August 1986.
[57]
M. J. Wolfe. More iteration space tiling. In Proceedings of Supercomputing '89, RenD, NV, November 1989.
[58]
F. Zadeck. Incremental data flow analysis in a structured program editor. In Proceedings of the SIGPLAN '84 Symposium on Compiler Construction, Montreal, Canada, June 1984.
[59]
H. Zima, H.-J. Bast, and M. Gerndt. SUPERB: A tool for semi-automatic MIMD/SIMD parallelization. Parallel Computing, 6:1-18, 1986.

Cited By

View all
  • (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
  • (2010)Inferring arbitrary distributions for data and computationProceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion10.1145/1869542.1869550(51-60)Online publication date: 17-Oct-2010
  • (2010)QoS Algorithm for Localised Routing Based on Bandwidth as the Dominant Metric for Candidate Path SelectionProceedings of the 2010 10th IEEE International Conference on Computer and Information Technology10.1109/CIT.2010.85(321-328)Online publication date: 29-Jun-2010
  • Show More Cited By

Index Terms

  1. Analysis and transformation in the ParaScope editor

                      Recommendations

                      Comments

                      Information & Contributors

                      Information

                      Published In

                      cover image ACM Conferences
                      ICS '91: Proceedings of the 5th international conference on Supercomputing
                      June 1991
                      470 pages
                      ISBN:0897914341
                      DOI:10.1145/109025
                      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 June 1991

                      Permissions

                      Request permissions for this article.

                      Check for updates

                      Qualifiers

                      • Article

                      Conference

                      ICS91
                      Sponsor:

                      Acceptance Rates

                      Overall Acceptance Rate 629 of 2,180 submissions, 29%

                      Contributors

                      Other Metrics

                      Bibliometrics & Citations

                      Bibliometrics

                      Article Metrics

                      • Downloads (Last 12 months)24
                      • Downloads (Last 6 weeks)3
                      Reflects downloads up to 12 Sep 2024

                      Other Metrics

                      Citations

                      Cited By

                      View all
                      • (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
                      • (2010)Inferring arbitrary distributions for data and computationProceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion10.1145/1869542.1869550(51-60)Online publication date: 17-Oct-2010
                      • (2010)QoS Algorithm for Localised Routing Based on Bandwidth as the Dominant Metric for Candidate Path SelectionProceedings of the 2010 10th IEEE International Conference on Computer and Information Technology10.1109/CIT.2010.85(321-328)Online publication date: 29-Jun-2010
                      • (2009)Towards concurrency refactoring for x10ACM SIGPLAN Notices10.1145/1594835.150422644:4(303-304)Online publication date: 14-Feb-2009
                      • (2009)Towards concurrency refactoring for x10Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/1504176.1504226(303-304)Online publication date: 14-Feb-2009
                      • (2009)Refactoring sequential Java code for concurrency via concurrent librariesProceedings of the 31st International Conference on Software Engineering10.1109/ICSE.2009.5070539(397-407)Online publication date: 16-May-2009
                      • (2007)Creating Explicit Communication in SoC Models Using Interactive Re-CodingProceedings of the 2007 Asia and South Pacific Design Automation Conference10.1109/ASPDAC.2007.357791(50-55)Online publication date: 23-Jan-2007
                      • (2005)Construction of thinned gated single-assignment formLanguages and Compilers for Parallel Computing10.1007/3-540-57659-2_28(477-499)Online publication date: 31-May-2005
                      • (2000)Compiler analysis of irregular memory accessesACM SIGPLAN Notices10.1145/358438.34932235:5(157-168)Online publication date: 1-May-2000
                      • (2000)Compiler analysis of irregular memory accessesProceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation10.1145/349299.349322(157-168)Online publication date: 1-Aug-2000
                      • Show More Cited By

                      View Options

                      View options

                      PDF

                      View or Download as a PDF file.

                      PDF

                      eReader

                      View online with eReader.

                      eReader

                      Get Access

                      Login options

                      Media

                      Figures

                      Other

                      Tables

                      Share

                      Share

                      Share this Publication link

                      Share on social media