ACM Home Page
Please provide us with feedback. Feedback
Software pipelining
Full text PdfPdf (4.72 MB)
Source ACM Computing Surveys (CSUR) archive
Volume 27 ,  Issue 3  (September 1995) table of contents
Pages: 367 - 432  
Year of Publication: 1995
ISSN:0360-0300
Authors
Vicki H. Allan  Utah State Univ., Logan
Reese B. Jones  Evans and Sutherland, Salt Lake City, UT
Randall M. Lee  DAKCS, Ogden, UT
Stephen J. Allan  Utah State Univ., Logan
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 201,   Citation Count: 63
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/212094.212131
What is a DOI?

ABSTRACT

Utilizing parallelism at the instruction level is an important way to improve performance. Because the time spent in loop execution dominates total execution time, a large body of optimizations focuses on decreasing the time to execute each iteration. Software pipelining is a technique that reforms the loop so that a faster execution rate is realized. Iterations are executed in overlapped fashion to increase parallelism.Let {ABC}n represent a loop containing operations A, B, C that is executed n times. Although the operations of a single iteration can be parallelized, more parallelism may be achieved if the entire loop is considered rather than a single iteration. The software pipelining transformation utilizes the fact that a loop {ABC}n is equivalent to A{BCA}n−1BC. Although the operations contained in the loop do not change, the operations are from different iterations of the original loop.Various algorithms for software pipelining exist. A comparison of the alternative methods for software pipelining is presented. The relationships between the methods are explored and possibilities for improvement highlighted.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
4
 
5
 
6
AIKEN, A. ANB NICOLAU, A. 1990 A realistic resource-constrained software pipehnmg algorithm Tech. Rep. RJ 7743, IBM Research Division, San Jose, CA, October
 
7
 
8
 
9
BANERJEE, U., SHEN, S., KUCK, D J., AND TOWLE, R. A 1979 Time and parallel precentor bounds for Fortran-like loops. IEEE Trans Comput C-28, 9 (Sept), 660 670
 
10
 
11
 
12
 
13
 
14
DAVIDSON, E. S. 1971. The design and control of pipelined function generators. In Proceedings of the 1971 Internatmnal IEEE Conference on Systems, Networks, and Computers' (Oaxtepec, Mexico, Jan.), 19-21.
15
 
16
17
 
18
19
 
20
FISHER, J. 1981. Trace scheduling: A technique for global microcode compaction. {EEE Trans. Comput. C-30, 7 (July), 478 490.
21
22
 
23
GAO, G. R., WONO, W.-B., AND NING, Q. 1991b. A timed Petri-net model for fine-grain loop scheduling. Tech. Rep. ACAPS Technical Memo 18, School of Computer Science, McGill University, Montreal, Canada, H3A 2A7, January.
24
 
25
26
27
 
28
JONES, R.B. 1991. Constrained software pipelining. Utah State University, Dept. of Computer Science, Logan, UT, Master's Thesis, Sept.
 
29
 
30
KUCK, D. J. AND PADUA, D.A. 1979. High-speed muir(processors and their compilers. In Proceedings of the 1979 International Conference on Parallel Processing, 5-16.
31
 
32
33
 
34
MATETI, P. ANU DEO, N. 1976. On algorithms for enumerating all circuits of a graph. SlAM J. Comput. 5, 1, 990-999.
 
35
36
 
37
 
38
O'NEILL, M. R. 1994. Software pipelining with stochastic search algorithms. Utah State University, Dept. of Computer Science, Logan, UT, Master's Thesis.
 
39
40
 
41
42
43
 
44
45
46
 
47
48
49
 
50
TAR JAN, R. 1972. Depth-first search and linear graph algorithms. SIAM d. Comput. 1, 2 (June), 146-160
51
 
52
53
54
 
55
56
57
 
58
WOLFE, M.J. 1990. Tzny--A Loop Restructuring Tool, User Manual Oregon Graduate Institute of Science and Technology, Beaverton, OR.
 
59
60
 
61
62

CITED BY  63

Collaborative Colleagues:
Vicki H. Allan: colleagues
Reese B. Jones: colleagues
Randall M. Lee: colleagues
Stephen J. Allan: colleagues