A Scheme to Enforce Data Dependence on Large Multiprocessor Systems
IEEE Transactions on Software Engineering
Run-Time Parallelization and Scheduling of Loops
IEEE Transactions on Computers
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Time Stamp Algorithms for Runtime Parallelization of DOACROSS Loops with Dynamic Dependences
IEEE Transactions on Parallel and Distributed Systems
An efficient algorithm for the run-time parallelization of DOACROSS loops
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Effects of Parallelism Degree on Run-Time Parallelization of Loops
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
Exploiting Locality in the Run-Time Parallelization of Irregular Loops
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
| Hi-index | 0.00 |
In this work we propose a run-time approach for the efficient parallel execution of doacross loops with indirect array accesses by means of a graph partitioning strategy. Our approach focuses not only on extracting parallelism among iterations of the loop, but also on exploiting data access locality to improve memory hierarchy behavior and thus the overall program speedup. The effectiveness of our algorithm is assessed in an SGI Origin 2000.