Fast execution of loops with if statements
Pages 126 - 132
Abstract
In this paper we show how to execute in parallel loops containing IF statements. We give an architectural model of parallel computation and describe the design of a hardware Boolean Recurrence Solver. Our method of handling such loops is then compared with those used by some of the existing supercomputers.
References
[1]
U. Banerjee, D. Gajski, and D. Kuck, "Accessing sparse arrays in parallel memories," J. VLSI and Computer Systems, vol. 1, no. 1, pp. 69-100, Spring 1983.
[2]
U. Banerjee, "Data dependence in ordinary programs," M.S. thesis, Univ. of Illinois at Urbana-Champaign, Dept. of Computer Sci. Rpt. No. 76-837, Nov. 1976.
[3]
U. Banerjee, "Speedup of ordinary programs," Ph.D. thesis, Univ. of Illinois at Urbana-Champaign, Dept. of Computer Sci. Rpt. No. 79-989, Oct. 1979.
[4]
U. Banerjee, S. C. Chen, D. J. Kuck, and R. A. Towle, "Time and parallel processor bounds for Fortran-like loops," IEEE Trans. Computers, vol. C-28, no. 9, pp. 660-670, Sept. 1979.
[5]
R. P. Brent and H. T. Kung, "Regular layout for parallel adders," IEEE Trans. Computers, vol. C-31, pp. 260-269, Mar. 1982.
[6]
K. Kennedy, "Automatic translation of Fortran programs to vector form," Rice Tech. Rpt. No. 476-029-4, Rice Univ., Houston, TX, Oct. 1980.
[7]
R. E. Ladner and M. J. Fischer, "Parallel prefix computations," J. ACM, vol. 27, no. 4, pp. 831-838, 1980.
Index Terms
- Fast execution of loops with if statements
Recommendations
Fast Execution of Loops with IF Statements
A parallel method of execution for a certain class of loops containing IF statements is described. We replace a given loop by an equivalent set of five loops, four of which are vectorizable; the fifth loop is executed in hardware as a Boolean ...
Parallel Region Execution of Loops with Irregular Dependencies
ICPP '94: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02Several compile time transformations of loops with simple dependencies have been developed in order to expose possible parallelism in these loops. However, once an irregular data dependence is detected, no attempt is usually made to extract any parallel ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1984 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 January 1984
Published in SIGARCH Volume 12, Issue 3
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations2Total Citations
- 448Total Downloads
- Downloads (Last 12 months)88
- Downloads (Last 6 weeks)13
Reflects downloads up to 14 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in