Abstract. A loop with irregular assignment computations contains loopcarried output data dependences that can only be detected at run-time. In this paper, a load-balanced method based on the inspector-executor model is proposed to parallelize this loop pattern. The basic idea lies in splitting the iteration space of the sequential loop into sets of conflictfree iterations that can be executed concurrently on different processors. As will be demonstrated, this method outperforms existing techniques. Irregular access patterns with different load-balancing and reusability properties are considered in the experiments.
In this paper we present our experience in implementing several irregular problems using a high-leve...
Many scientific applications involve array operations that are sparse in nature, ie array elements d...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Compute...
In this paper, we present two new run-time algorithms for the parallelization of loops that have ind...
[[abstract]]A run-time technique based on the inspector-executor scheme is proposed in this paper to...
Abstract—Parallelization and locality optimization of affine loop nests has been successfully addres...
When the inter-iteration dependency pattern of the iterations of a loop cannot be determined statica...
Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: ...
Current parallelizing compilers do a reasonable job of extracting parallelism from programs with reg...
Different parallelization methods for irregular reductions on shared memory multiprocessors have bee...
We consider the problem of scheduling parallel loops that are characterized by highly varying execut...
Reordering of data is becoming more and more significant in order to achieve a higher performance in...
This is a post-peer-review, pre-copyedit version of an article published. The final authenticated ve...
In this paper we give a new run--time technique for finding an optimal parallel execution schedule f...
In this paper we present our experience in implementing several irregular problems using a high-leve...
Many scientific applications involve array operations that are sparse in nature, ie array elements d...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Compute...
In this paper, we present two new run-time algorithms for the parallelization of loops that have ind...
[[abstract]]A run-time technique based on the inspector-executor scheme is proposed in this paper to...
Abstract—Parallelization and locality optimization of affine loop nests has been successfully addres...
When the inter-iteration dependency pattern of the iterations of a loop cannot be determined statica...
Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: ...
Current parallelizing compilers do a reasonable job of extracting parallelism from programs with reg...
Different parallelization methods for irregular reductions on shared memory multiprocessors have bee...
We consider the problem of scheduling parallel loops that are characterized by highly varying execut...
Reordering of data is becoming more and more significant in order to achieve a higher performance in...
This is a post-peer-review, pre-copyedit version of an article published. The final authenticated ve...
In this paper we give a new run--time technique for finding an optimal parallel execution schedule f...
In this paper we present our experience in implementing several irregular problems using a high-leve...
Many scientific applications involve array operations that are sparse in nature, ie array elements d...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...