Parallel scheduling of recursively defined arrays
Journal of Symbolic Computation
Overview of the force scientific parallel language
Scientific Programming
Improved Time and Parallel Processor Bounds for Fortran-Like Loops
IEEE Transactions on Computers
The Burroughs Scientific Processor (BSP)
IEEE Transactions on Computers
On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations
IEEE Transactions on Computers
High-Speed Multiprocessors and Compilation Techniques
IEEE Transactions on Computers
The Complexity of Horizontal Word Encoding in Microprogrammed Machines
IEEE Transactions on Computers
On the Analysis and Synthesis of VLSI Algorithms
IEEE Transactions on Computers
Measuring the Parallelism Available for Very Long Instruction Word Architectures
IEEE Transactions on Computers
Fast Execution of Loops with IF Statements
IEEE Transactions on Computers
Verification by parallelization of parametric code
Algebraic and proof-theoretic aspects of non-classical logics
Automating verification of loops by parallelization
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 15.01 |
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.