#### Filter Results:

- Full text PDF available (42)

#### Publication Year

1994

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Martin Griebl
- 2004

Parallel computers, especially in the form of clusters of standard PCs, have become reasonably cheap within the last few years. It is an obvious desire to use the increased computation power of such parallel hardware in order to speed up any given application. However, for that purpose, these application programs must be transformed such that they take… (More)

- Michael Classen, Martin Griebl
- Proceedings 20th IEEE International Parallel…
- 2006

The polytope model has been used successfully as a tool for program analysis and transformation in the field of automatic loop parallelization. However, for the final step of automatic code generation, the generated code is either only usable on shared memory architectures or severely restricts the parallelization methods that can be applied. In this paper,… (More)

- Martin Griebl, Christian Lengauer, Sabine Wetzel
- IEEE PACT
- 1998

Automatic parallelization of nested loops, based on a mathematical model, the polytope model, has been improved significantly over the last decade: state-of-theart methods allow flexible distributions of computations in space and time, which lead to high-quality parallelism. However, these methods have not found their way into practical parallelizing… (More)

We report on a prototype for testing diierent methods of space-time 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 scheduling and allocating the loop nest's iterations, and produces… (More)

- Martin Griebl, Paul Feautrier, Christian Lengauer
- International Journal of Parallel Programming
- 2000

There are many algorithms for the space-time mapping of nested loops. Some of them even make the optimal choices within their framework. We propose a preprocessing phase for algorithms in the polytope model, which extends the model and yields space-time mappings whose schedule is, in some cases, orders of magnitude faster. These are cases in which the… (More)

- Martin Griebl, Jean-Francois Collard
- Euro-Par
- 1995

Automatic parallelization of imperative programs has focused on nests of do loops with aane bounds and aane dependences, because in this case execution domains and dependences are precisely known at compile-time. Parallelization can then be done using a suitable space-time transformation , yielding a logically synchronous program. Code generation consists… (More)

- Armin Größlinger, Martin Griebl, Christian Lengauer
- Algorithmic Algebra and Logic
- 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 so-called structure parameters are determined at run time and reflect the problem size. Our purpose here… (More)

- Jean-Francois Collard, Martin Griebl
- Euro-Par, Vol. I
- 1996

- Martin Griebl, Peter Faber, Christian Lengauer
- Concurrency and Computation: Practice and…
- 2004

- Jean-Francois Collard, Martin Griebl
- LCPC
- 1999