Run time methods are studied to automatically parallelize and schedule iterations of a do loop in certain cases, where compile-time information is inadequate. The methods presented involve execution time preprocessing of the loop. At compile-time, these methods set up the framework for performing a loop dependency analysis. At run time, wave fronts of concurrently executable loop iterations are identified. Using this wavefront information, loop iterations are reordered for increased parallelism. Symbolic transformation rules are used to produce: inspector procedures that perform execution time preprocessing and executors or transformed versions of source code loop structures. These transformed loop structures carry out the calculations plan...
Discussed are how loop level parallelism is detected in a nonprocedural dataflow program, and how a ...
In this paper, we survey loop parallelization algorithms, analyzing the dependence representations t...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
The class of problems that can be effectively compiled by parallelizing compilers is discussed. This...
Dependencies between loop iterations cannot always be characterized during program compilation. Doac...
[[abstract]]A run-time technique based on the inspector-executor scheme is proposed in this paper to...
While automatic parallelization of loops usually relies on compile-time analysis of data dependences...
Loops are the main source of parallelism in scientific programs. Hence, several techniques were dev...
In this paper we give a new run--time technique for finding an optimal parallel execution schedule f...
In this paper, we present two new run-time algorithms for the parallelization of loops that have ind...
When the inter-iteration dependency pattern of the iterations of a loop cannot be determined statica...
The goal of parallelizing, or restructuring, compilers is to detect and exploit parallelism in seque...
Parallelizing compilers promise to exploit the parallelism available in a given program, particularl...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
Current parallelizing compilers do a reasonable job of extracting parallelism from programs with reg...
Discussed are how loop level parallelism is detected in a nonprocedural dataflow program, and how a ...
In this paper, we survey loop parallelization algorithms, analyzing the dependence representations t...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
The class of problems that can be effectively compiled by parallelizing compilers is discussed. This...
Dependencies between loop iterations cannot always be characterized during program compilation. Doac...
[[abstract]]A run-time technique based on the inspector-executor scheme is proposed in this paper to...
While automatic parallelization of loops usually relies on compile-time analysis of data dependences...
Loops are the main source of parallelism in scientific programs. Hence, several techniques were dev...
In this paper we give a new run--time technique for finding an optimal parallel execution schedule f...
In this paper, we present two new run-time algorithms for the parallelization of loops that have ind...
When the inter-iteration dependency pattern of the iterations of a loop cannot be determined statica...
The goal of parallelizing, or restructuring, compilers is to detect and exploit parallelism in seque...
Parallelizing compilers promise to exploit the parallelism available in a given program, particularl...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
Current parallelizing compilers do a reasonable job of extracting parallelism from programs with reg...
Discussed are how loop level parallelism is detected in a nonprocedural dataflow program, and how a ...
In this paper, we survey loop parallelization algorithms, analyzing the dependence representations t...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...