Improving software pipelining with unroll-and-jam

Proceedings of the Annual Hawaii International Conference on System Sciences

Volumn 1, Issue , 1996, Pages 183-192

  Carr, Steve ^a   Ding, Chen ^a   Sweany, Philip ^a  

^a Michigan Technological University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SYSTEMS SCIENCE;

COMPILER OPTIMIZATIONS; SOFTWARE PIPELINING;

SOFTWARE ENGINEERING;

EID: 84875571223     PISSN: 15301605     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HICSS.1996.495462     Document Type: Conference Paper

References (22)

1. [l]V. Allan, R. Jones, R. Lee, and S. Allan, “SoftwarePipelining,” ACM Computing Surveys, vol. 27, no. 3, September 1995.
2. M. Lam, “Software pipelining: An effective scheduling technique for VLIW machines,” SIGPLAN Notices, vol. 23, pp. 318-328, July 1988. Proceedings of the ACM SIGPLAN ’88 Conference on Programming Language Design and Implementation.
3. B. R. Rau, “Iterative modulo scheduling: An algorithm for software pipelining loops,’’ in Proceedings of the 27th International Symposium on Microarchitecture (MICRO-W), (San Jose, CA), pp. 63-74, December 1994.
4. N. J. Warter, S. A. Mahlke, W. mei W. Hwu, and B. R. Rau, “Reverse if-conversion,” SIGPLAN Notices,vol. 28, pp. 290-299, June 1993. Proceedings of the ACM SIGPLAN ’93 Conference on Programming Language Design and Implementation.
5. D. Callahan, J . Cocke, and K. Kennedy, “E s timating interlock and improving balance for pipelined machines,” Journal of Parallel and Distributed Computing, vol. 5, pp. 334-358, 1988.
6. S. Carr and K. Kennedy, “Improving the ratio of memory operations to floating-point operations in loops,” ACM Transactions on Programming Languages and Systems, vol. 16, no. 6, pp. 1768-1810, 1994.
7. S. Can, Memory-Hierarchy Management. PhD thesis, Rice University,Department of Computer Science, September 1992.
8. D. Callahan, K. Cooper, R. Hood, K. Kennedy, and L. Torczon, “Parascope: A parallel programming environment,” in proceedings of the First International Conference on Supercomputing, (Athens, Greece), June 1987.
9. P. H. Sweany and S. J. Beaty, “Overview of the Rocket retargetable C compiler,” Tech. Rep. CS-94-01, Department of Computer Science, Michigan Technological University,Houghton, January 1994.
10. [lo] A. Aiken and A. Nicolau, “Optimal loop par-allelization,” in Conference on Programming Language Design and Implementation, (Atlanta Georgia)] pp. 308-317, SIGPLAN’88, June 1988.
11. [ll]A. Aiken and A. Nicolau, “Perfect Pipelining: A New Loop Optimization Technique]” in Proceedings of the 1988 European Symposium on Programming, Springer Verlag Lecture Notes in Computer Science, #SOU, (Atlanta, GA), pp. 221-235, March 1988.
12. V. Allan, M. Rajagopalan, and R. Lee, “Software Pipelining: Petri Net Pacemaker,” in Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, (Orlando, FL), January 20-22 1993.
13. N. Warter, G. Haab, and J. Bockhaus, “Enhanced Modulo Schedulingfor Loops with Conditional Branches,” in Proceedings of the 25th Annual International Symposium on Microarchitecture (MICR0-25), (Portland, OR), pp. 170-179, December 1-4 1992.
14. D. Kuck, The Structure of Computers and Computations Volume 1. New York: John Wiley and Sons, 1978.
15. G. Goff, K. Kennedy, and C.-W. Tseng, “Practical dependence testing,’’ SIGPLAN Notices, vol. 26, pp. 15-29, June 1991. Proceedings of the ACM SIGPLAN’91Conferenceon Programming Language Design and Implementation.
16. El61 K. Kennedy and K. McKinley, “Optimizing for parallelism and memory hierarchy,” in Proceedings of the 1992 International Conference on Supercomputing, (Washington, DC), pp. 323-334, July 1992.
17. T. C. Mowry, M. S. Lam, and A. Gupta, “Design and evaluation of a compiler algorithm for prefetehing,” in Proceedings of the Fifth International Conference on Architectural Support for ProgrammingLanguages and Operating Systems, (Boston, Massachusetts), pp. 62-75, 1992.
18. [la] M. E. Wolf and M. S. Lam, “A data locality optimizing algorithm,” SIGPLAN Notices, vol. 26, pp. 30-44, June 1991. Proceedings of the ACM SIGPLAN’91 Conference on Programming Language Design and Implementation.
19. D. Callahan, S. Can, and K. Kennedy, “Improving register allocation for subscripted variables,” SIGPLAN Notices,vol. 25, pp. 53-65, June 1990. Proceedings of the ACM SIGPLAN’90 Conference on Programming Language Design and Implementation.
20. S. Carr and K. Kennedy, “Scalar replacement in the presence of conditional control flow,” Software Practice and Experience, vol. 24, pp. 51-77, Jan. 1994.
21. P. Kogge, The Architecture of Pipelined Computers. New York: McGraw-Hill, 1981.
22. S. Can, K. McKinley, and C.-W. Tseng, “Compiler optimizations for improving data locality,’’ in Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, (Santa Clara, California), 1994.