William Pugh
Evan Rosser
- AKMC94.Vikram S. Adve, Charles Koelbel, and John M. Mellor-Crummey. Performance analysis of dataparallel programs. Technical Report CRPC- TR94404, Center for Research on Parallel Computation, Rice University, May 1994.Google Scholar
- HKMCS94.Seema Hiranandani, Ken Kennedy, John Mellor- Crummey, and Ajay Sethi. Compilation techniques for block-cyclic distributions. In Proc. of the 1994 International Conference on Supercomputing, 1994. Google ScholarDigital Library
- HKT93.Seema Hiranandani, Ken Kennedy, and Chau-Wen Tseng. Preliminary experiences with the fortran-d compiler. In Supercomputing '93, November 1993. Google ScholarDigital Library
- KMP+95.Wayne Kelly, Vadim Maslov, William Pugh, Evan Rosser, Tatiana Shpeisman, and David Wonnacott. The Omega Library interface guide. Technical Report CS-TR-3445, Dept. of Computer Science, University of Maryland, College Park, March 1995. The Omega library is available from http://www.cs.umd.edu/projects/omega. Google ScholarDigital Library
- KMR90.Charles Koebel, Piyush Mehrotra, and J. Van Rosendale. Supporting shared data structures on distributed memory machine s. In Proc. of the 2nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, June 1990. Google ScholarDigital Library
- KPR95.Wayne Kelly, William Pugh, and Evan Rosser. Code generation for multiple mappings. In The 5th Symposium on the Frontiers of Massively Parallel Computation, pages 332-341, McLean, Virginia, February 1995. Google ScholarDigital Library
- KPRS96.Wayne Kelly, William Pugh, Evan Rosser, and Tatiana Shpeisman. Transitive closure of infinite graphs and its applications. International J. of Parallel Programming, 24(6):579-598, December 1996. Google ScholarDigital Library
- Kri.Jens Krinke. Program slicing page. http://www.cs.tu-bs.de/-krinke/Slicing/slicing.htmlGoogle Scholar
- Li92.Zhiyuan Li. Array privatization for parallel execution of loops. In Proc. of the 1998 International Conference on Supercomputing, pages 313- 322, July 1992. Google ScholarDigital Library
- MA97.Maraig Manjikian and Tarek SS. Abdelrahman. Fusion of loops for parallelism and locality. IEEE Transactions on Parallel and Distributed Systems, February 1997. Google ScholarDigital Library
- PEH+93.David A. Padua, Rudolf Eigenmann, Jay Hoelflinger, Paul Peterson, Peng Tu, Stephen Weatherford, and Keith Faigin. Polaris: A newgeneration parallelizing compiler for mpps. CSRD Rpt. 1306, Dept. of Computer Science, University of Illinois at Urbana-Champaign, June 1993.Google Scholar
- Pug92.William Pugh. The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 8:102-114, August 1992. Google ScholarDigital Library
- PW93.William Pugh and David Wonnacott. An exact method for analysis of value-based array data dependences. In Lecture Notes in Computer Science 768: Sixth Annual Workshop on Programming Languages and Compilers for Parallel Computing, Portland, OR, August 1993. Springer-Verlag. Google ScholarDigital Library
- PW95.William Pugh and David Wonnacott. Going beyond integer programming with the Omega test to eliminate false data dependences. IEEE Transactions on Parallel and Distributed Systems, pages 204-211, February 1995. Google ScholarDigital Library
- Ros90.Carl Rosene. Incremental Dependence Analysis. PhD thesis, Dept. of Computer Science, Rice University, March 1990. Google ScholarDigital Library
- SHFG95.M. Snir, P Hochschild, D. D. Prye, and K. J. Gildea. The communication software and parallel environment of the ibm sp2. IBM Systems Journal, 34(2):205-221, 1995. Google ScholarDigital Library
- Tip95.Frank Tip. A survey of program slicing techniques. Journal of Programming Languages, 3(3):121-189, September 1995.Google Scholar
- TP92.Peng Tu and David Padua. Array privatization for shared and distributed memory machines. In Workshop on Languages, Compilers, and Run-Time Environments for Distn'buted Memory Multiprocessors, September 1992.Google Scholar
- Wei84.M. Weiser. Program slicing. IEEE Transactions on Software Engineering, pages 352-357, July 1984.Google Scholar
Index Terms
- Iteration space slicing and its application to communication optimization
Recommendations
Abstract Program Slicing: An Abstract Interpretation-Based Approach to Program Slicing
In the present article, we formally define the notion of abstract program slicing, a general form of program slicing where properties of data are considered instead of their exact value. This approach is applied to a language with numeric and reference ...
Unified Communication Optimization Strategies for Sparse Triangular Solver on CPU and GPU Clusters
SC '23: Proceedings of the International Conference for High Performance Computing, Networking, Storage and AnalysisThis paper presents a unified communication optimization framework for sparse triangular solve (SpTRSV) algorithms on CPU and GPU clusters. The framework builds upon a 3D communication-avoiding (CA) layout of Px × Py × Pz processes that divides a sparse ...
A brief survey of program slicing
Program slicing is a technique to extract program parts with respect to some special computation. Since Weiser first proposed the notion of slicing in 1979, hundreds of papers have been presented in this area. Tens of variants of slicing have been ...
Comments