Name
Abstract | ||
|---|---|---|
The main goal of this paper is to show that a large number of processors can be used effectively to speed up simple Fortran-like loops consisting of assignment statements. A practical method is given by which one can check whether or not a statement is dependent upon another. The dependence structure of the whole loop may be of different types. For each type, a set of time and processor upper bounds is given. We also show how a loop can sometimes be transformed to change its dependence structure. Finally, we give a result on the possible splitting up of a given recurrence system into a number of smaller subsystems. These results can be used to modify and sometimes improve the bounds for the loops as demanded by special circumstances. |
Year | DOI | Venue |
|---|---|---|
1979 | 10.1109/TC.1979.1675434 | Computers, IEEE Transactions |
Keywords | Field | DocType |
Analysis of programs,Fortran-like loops,data dependence,parallel computation,processor bounds,program speedup,recurrence relations,time bounds,Analysis of programs,Fortran-like loops,data dependence,parallel computation,processor bounds,program speedup,recurrence relations,time bounds | Computer science,Recurrence relation,Parallel computing,Parallel processing,Fortran,Data dependence,Bounds checking,Speedup | Journal |
Volume | Issue | ISSN |
C | 9 | 0018-9340 |
Citations | PageRank | References |
77 | 39.24 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Banerjee, U. | 1 | 77 | 39.24 |
| Shyh-Ching Chen | 2 | 295 | 260.23 |
| Kuck, David J | 3 | 169 | 63.95 |
| Towle, R.A. | 4 | 77 | 39.24 |