by Vincent Loechner, Catherine Mongenet
http://icps.u-strasbg.fr/upload/icps-2000-17.ps.gz
Add To MetaCart
Abstract:
To get ecient solutions, parallelization techniques mainly focus on data alignment or on communication minimization. The eciency of a parallel solution not only depends on the communication cost, but also on the memory cost. This paper mainly focus on a symbolic evaluation of the memory cost due to anticipated broadcast. This evaluation is conducted in the polytope model using Ehrhart polynomials, which express the number of integer points in a parameterized polytope. 1.
Citations
|
241
|
Global optimizations for parallelism and locality on scalable parallel machines
– Anderson, Lain
- 1993
|
|
117
|
The data alignment phase in compiling programs for distributed-memory machines
– Li, Chen
- 1991
|
|
85
|
Compile-time techniques for data distribution in distributed memory machines
– Ramanujam, Sadayappan
- 1991
|
|
81
|
Counting solutions to linear and nonlinear constraints through ehrhart polynomials: Applications to analyze and transform scientific programs
– Clauss
- 1996
|
|
71
|
Loop parallelization in the polytope model
– Lengauer
- 1993
|
|
63
|
Parametric analysis of polyhedral iteration spaces
– Clauss
- 1998
|
|
54
|
Toward automatic distribution
– Feautrier
- 1994
|
|
48
|
Non-unimodular transformations of nested loops
– Ramanujam
- 1992
|
|
32
|
Solving alignment using elementary linear algebra
– Bau, Kodukula, et al.
- 1994
|
|
23
|
Some ecient solutions to the ane scheduling problem. part I. one-dimensional time
– Feautrier
- 1992
|
|
18
|
Memory reuse analysis in the polyhedral model
– Wilde, Rajopadhye
- 1996
|
|
11
|
On the alignment problem
– Darte, Robert
- 1994
|
|
5
|
Generation of ecient nested loops from polyhedra
– Quillere, Rajopadhye, et al.
- 2000
|
|
4
|
Mapping ane loop nests: New results
– Dion, Robert
- 1995
|
|
4
|
Parcours d'une superposition de domaines
– Albiez
- 1998
|
|
2
|
Algorithms for automatic alignment of arrays
– Chatterjee, Gilbert, et al.
- 1996
|
|
2
|
Ane dependence classi for communications minimization
– Mongenet
- 1997
|
|
2
|
Construction of DO loops from systems of ane constraints
– Collard, Feautrier, et al.
- 1995
|
|
1
|
Communication optimization for ane recurrence equations using broadcast and locality
– Loechner, Mongenet
- 2000
|
|
1
|
Geometrical tools to map systems of ane recurrence equations on regular arrays
– Clauss, Perrin
- 1994
|
|
1
|
Solutions to the communication minimization problem for ane recurrence equations
– Loechner, Mongenet
- 1997
|
|
1
|
Memory cost due to anticipated broadcast
– Loechner, Mongenet
|
