Sciweavers

LCPC
2004
Springer
14 years 11 days ago
A Geometric Approach for Partitioning N-Dimensional Non-rectangular Iteration Spaces
Abstract. Parallel loops account for the greatest percentage of program parallelism. The degree to which parallelism can be exploited and the amount of overhead involved during par...
Arun Kejariwal, Paolo D'Alberto, Alexandru Nicolau...
PPOPP
2005
ACM
14 years 17 days ago
A novel approach for partitioning iteration spaces with variable densities
Efficient partitioning of parallel loops plays a critical role in high performance and efficient use of multiprocessor systems. Although a significant amount of work has been don...
Arun Kejariwal, Alexandru Nicolau, Utpal Banerjee,...