Further Reading
- Muchnick, Steven S. Advanced Compiler Design and Implementation. Morgan Kaufmann. 1997.
- Morel, E., and Renvoise, C. Global Optimization by Suppression of Partial Redundancies. Communications of the acm, Vol. 22, Num. 2, Feb. 1979.
- Knoop, J., Ruthing, O., and Steffen, B. Lazy Code Motion. ACM SIGPLAN Notices Vol. 27, Num. 7, Jul. 1992, '92 Conference on PLDI.
- Paleri, V. K., Srikant, Y. N., and Shankar, P. A Simple Algorithm for Partial Redundancy Elimination. SIGPLAN Notices, Vol. 33(12). pages 35–43 (1998).
- Kennedy, R., Chan, S., Liu, S.M., Lo, R., Peng, T., and Chow, F. Partial Redundancy Elimination in SSA Form. ACM Transactions on Programming Languages Vol. 21, Num. 3, pp. 627-676, 1999.
- VanDrunen, T., and Hosking, A.L. Value-Based Partial Redundancy Elimination, Lecture Notes in Computer Science Vol. 2985/2004, pp. 167 - 184, 2004.
- Cai, Q. and Xue, J. Optimal and Efficient Speculation-Based Partial Redundancy Elimination". International Symposium on Code Generation and Optimization (CGO'03), 91-104, 2003.
- Xue, J. and Knoop, J. A Fresh Look at PRE as a Maximum Flow Problem. International Conference on Compiler Construction (CC'06), pages 139—154, Vienna, Austria, 2006.
- Xue, J. and Cai Q. A lifetime optimal algorithm for speculative PRE. ACM Transactions on Architecture and Code Optimization Vol. 3, Num. 3, pp. 115-155, 2006.
Read more about this topic: Partial Redundancy Elimination
Famous quotes containing the word reading:
“The unread story is not a story; it is little black marks on wood pulp. The reader, reading it, makes it live: a live thing, a story.”
—Ursula K. Le Guin (b. 1929)
“Learning is acquired by reading books; but the much more necessary learning, the knowledge of the world, is only to be acquired by reading men, and studying all the various editions of them.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)