Results 1  10
of
419,990
for loop parallelization and loop tiling
, 1996
"... Unité de recherche associée au CNRS n°1398 Combining retiming and scheduling techniques for loop parallelization and loop tiling ..."
Abstract
 Add to MetaCart
Unité de recherche associée au CNRS n°1398 Combining retiming and scheduling techniques for loop parallelization and loop tiling
Loop Parallelization in the Polytope Model
 CONCUR '93, Lecture Notes in Computer Science 715
, 1993
"... . During the course of the last decade, a mathematical model for the parallelization of FORloops has become increasingly popular. In this model, a (perfect) nest of r FORloops is represented by a convex polytope in Z r . The boundaries of each loop specify the extent of the polytope in a dis ..."
Abstract

Cited by 106 (26 self)
 Add to MetaCart
. During the course of the last decade, a mathematical model for the parallelization of FORloops has become increasingly popular. In this model, a (perfect) nest of r FORloops is represented by a convex polytope in Z r . The boundaries of each loop specify the extent of the polytope in a
Optimal loop parallelization
 In ACM SIGPLAN ’88 Conf. on Programming Language Design and Implementation
, 1988
"... aikenQsvax.cs.cornell.edu ..."
The Loop Parallelizer LooPo
 Proc. Sixth Workshop on Compilers for Parallel Computers, volume 21 of Konferenzen des Forschungszentrums Jülich
, 1996
"... . We report on a prototype for testing different methods of spacetime mapping loop nests. LooPo admits perfect or imperfect loop nests in a number of imperative languages, takes data dependences from the user or derives them itself from the source code, provides a choice of strategies for sched ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
for scheduling and allocating the loop nest's iterations, and produces synchronous or asynchronous parallel target code for sharedmemory or distributedmemory machines. 1 Why LooPo? LooPo is not meant to be yet another parallelizing compiler. It is a prototype system whose purpose is to assist us
Loop Parallelization Algorithms
, 2001
"... This chapter is devoted to a comparative survey of loop parallelization algorithms. Various algorithms have been presented in the literature, such as those introduced by Allen and Kennedy, Wolf and Lam, Darte and Vivien, and Feautrier. These algorithms make use of different mathematical tools. Also ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This chapter is devoted to a comparative survey of loop parallelization algorithms. Various algorithms have been presented in the literature, such as those introduced by Allen and Kennedy, Wolf and Lam, Darte and Vivien, and Feautrier. These algorithms make use of different mathematical tools
The Bouclettes loop parallelizer
, 1995
"... Bouclettes is a source to source loop nest parallelizer. It takes as input Fortran uniform, perfectly nested loops and gives as output an HPF (High Performance Fortran) program with data distribution and parallel ($HPF! INDEPENDENT) loops. This paper presents the tool and the underlying parallelizat ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Bouclettes is a source to source loop nest parallelizer. It takes as input Fortran uniform, perfectly nested loops and gives as output an HPF (High Performance Fortran) program with data distribution and parallel ($HPF! INDEPENDENT) loops. This paper presents the tool and the underlying
Loop Parallelization for Reconfigurable Architectures
"... Abstract—Reconfigurable Computing (RC) is one of the research directions that focuses on accelerating applications. In the presented approach we assume the Molen machine organization and the Molen programming paradigm as our framework. Molen combines a general purpose processor (GPP) and a Field Pro ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
algorithm computes the optimal degree of parallelism for a kernel K called from inside a loop or loop nest, in order to achieve the maximum performance, taking into consideration the resource constraints. The input data for the algorithm consists of profiling information about the execution times
Quantifier Elimination in Automatic Loop Parallelization
 In Proceedings A3L
, 2005
"... We present an application of quantifier elimination techniques in the automatic parallelization of nested loop programs. The technical goal is to simplify affine inequalities whose coefficients may be unevaluated symbolic constants. The values of these socalled structure parameters are determined ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We present an application of quantifier elimination techniques in the automatic parallelization of nested loop programs. The technical goal is to simplify affine inequalities whose coefficients may be unevaluated symbolic constants. The values of these socalled structure parameters
Determining Transformation Sequences for Loop Parallelization
, 1992
"... Considerable research on loop parallelization for shared memory multiprocessors has focused upon developing transformations for removing loopcarried dependences. In many loops, more than one such transformation is required, and hence the choice of transformations and the order in which they are app ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Considerable research on loop parallelization for shared memory multiprocessors has focused upon developing transformations for removing loopcarried dependences. In many loops, more than one such transformation is required, and hence the choice of transformations and the order in which
Logical Inference Techniques for Loop Parallelization
"... This paper presents a fully automatic approach to loop parallelization that integrates the use of static and runtime analysis and thus overcomes many known difficulties such as nonlinear and indirect array indexing and complex control flow. Our hybrid analysis framework validates the parallelizatio ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
This paper presents a fully automatic approach to loop parallelization that integrates the use of static and runtime analysis and thus overcomes many known difficulties such as nonlinear and indirect array indexing and complex control flow. Our hybrid analysis framework validates
Results 1  10
of
419,990