Loop unrolling optimization for software pipelining

[1] Allen V H, Jones R B, Lee R M, et al. Software pipelining [J]. ACM Computing Surveys, 1995,27(3):367~432 [2]Weiss S, Smith J E. A study of scalar compilation techniques for pipelined supercomputers[J]. ACM Transactions on Mathematical Software, 1990, 16(3):223~245 [3]Rau B R. Iterative modulo scheduling . HPL-94-115, 1994 [4]Mowry T C, Lam M S, Gupta A. Design and evaluation of a compiler algorithm for prefetching . In:Proceeding of the Fifth International Conference on Architectural Support for Programming Languages and Operating Systems . Massachusetts:ACM Press, 1992. 62~73 [5]Roy J, Sun C, Wu C Y. Open research compiler for itanium processor famil y(IPF) . In:MICRO-34 Tutorial . Texas:ACM Press, 2001 [6]Intel Corporation. Intel IA-64 architecture software developer’s manual. Volume 3:Instruction set reference [M]. Intel Corp, 2000 [7]Intel Corporation. Intel IA-64 architecture software developer’s manual. Volume 1:IA-64 application architecture [M]. Intel Corp, 2000 [8]Sanchez F, Cortadella J,Badia R M. Optimal exploration of the unrolling degree for software pipelining . UPC-DAC-1996-41, 1996 [9]Vivek Sarkar. Optimized unrolling of nested loops . In:Proceedings of the 14th International Conference on Supercomputing . New Mexico:ACM Press, 2000. 153~166