An Efficient Technique to Remove Transformations
暂无分享,去创建一个
[1] Yiya Yang,et al. Anatomy of the Design of an Undo Support Facility , 1992, Int. J. Man Mach. Stud..
[2] Dan R. Olsen,et al. Macros by example in a graphical UIMS , 1988, IEEE Computer Graphics and Applications.
[3] Mary Lou Soffa,et al. Automatic generation of global optimizers , 1991, PLDI '91.
[4] Craig Chambers,et al. Debugging optimized code with dynamic deoptimization , 1992, PLDI '92.
[5] Rajiv Gupta,et al. Techniques for integrating parallelizing transformations and compiler based scheduling methods , 1992, Proceedings Supercomputing '92.
[6] Mary Lou Soffa,et al. An approach to ordering optimizing transformations , 1990, PPOPP '90.
[7] Joe D. Warren,et al. The program dependence graph and its use in optimization , 1987, TOPL.
[8] Barbara M. Chapman,et al. Knowledge-Based Parallelization for Distributed Memory Systems , 1991, ACPC.
[9] George B. Leeman. A formal approach to undo operations in programming languages , 1986, TOPL.
[10] Warren Harrison. Tools for multiple-CPU environments , 1990, IEEE Software.
[11] Ken Kennedy,et al. The parascope editor: an interactive parallel programming tool , 1993, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).
[12] Mary Lou Soffa,et al. Incremental global reoptimization of programs , 1992, TOPL.
[13] Mary Lou Soffa,et al. Undoing Code Transformations in an Independent Order , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.
[14] Chyi-Ren Dow. Pivot: a program parallelization and visualization environment , 1994 .