#### Filter Results:

- Full text PDF available (25)

#### Publication Year

1995

2013

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Vincent Loechner, Doran Wilde
- International Journal of Parallel Programming
- 1997

Algorithms specified for parametrically sized problems are more general purpose and more reusable than algorithms for fixed sized problems. For this reason, there is a need for representing and symbolically analyzing linearly parameterized algorithms. An important class of parallel algorithms can be described as systems of parameterized affine recurrence… (More)

- Philippe Clauss, Vincent Loechner
- VLSI Signal Processing
- 1996

In the area of automatic parallelization of programs, analyzing and transforming loop nests with parametric aane loop bounds requires fundamental mathematical results. The most common geometrical model of iteration spaces, called the polytope model, is based on mathematics dealing with convex and discrete geometry, linear programming, combinatorics and… (More)

- Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe
- Algorithmica
- 2006

Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by linear constraints, then such problems are equivalent to counting the number of integer points in (possibly) parametric polytopes. It is well known that the enumerator of such a set can be… (More)

Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by linear constraints, then such problems are equivalent to counting the number of integer points in (possibly) parametric polytopes. It… (More)

- Vincent Loechner, Benoît Meister, Philippe Clauss
- The Journal of Supercomputing
- 2002

A significant source for enhancing application performance and for reducing power consumption in embedded processor applications is to improve the usage of the memory hierarchy. In this paper, a temporal and spatial locality optimization framework of nested loops is proposed, driven by parameterized cost functions. The considered loops can be imperfectly… (More)

- Vincent Loechner, Catherine Mongenet
- Euro-Par
- 1997

This paper deals with communication optimization which is a crucial issue in automatic parallelization. From a system of parameter-ized aane recurrence equations, we propose a heuristic which determines an eecient space-time transformation. It reduces rst the distant communications and then the local communications.

Optimizing parallel compilers need to be able to analyze nested loop programs with para-metric aane loop bounds, in order to derive eecient parallel programs. The iteration spaces of nested loop programs can be modeled by polyhedra and systems of linear constraints. Using this model, important program analyses such as computing the number of ops executed by… (More)

- Rachid Seghir, Vincent Loechner
- CASES
- 2006

Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by array linearization, cache access optimization and memory size computation. Their formalization in the polyhedral model reduce to solving the following problem: <i>count the number… (More)

- Vincent Loechner, Catherine Mongenet
- Software Engineering for Parallel and Distributed…
- 1996

This paper presents the mathematical notions for the parallelization of DO-Loops used in the tool OPERA currently under development in our team. It aims at giving the user an environment to parallelize problems described by systems of parameterized aane recurrence equations which formalize single-assignment loop nests. The parallelization technique used in… (More)