C. Mongenet  Home/Search
Context Related
| icps.ustrasbg.fr/...icps199445.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: icps.ustrasbg....list.php?pres=8 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In order to get a parallel solution from a system of affine recurrence equations, a spacetime transformation must first be determined. Such a transformation is characterized by a schedule and an allocation. In the context of data parallelism, efficient compilers require among other criteria appropriate data compiling techniques. These techniques should take into account the communication primitives of the target architecture (in particular broadcast primitives if any) and minimize the number of ... (Update)
Context of citations to this paper: More
.... auto dependences Let us consider a result variable Y [z] characterized by affine auto dependences (this case has been fully presented in [13]) An affine dependence is defined by a utilization set of dimension ffi 1 and by ffi utilization vectors uY i ; i = 1 : ffi. If...
...execute at most one computation at a given time step. 8. Conclusion In this paper, which extends the results presented earlier in [13] and [14] we tackle the problem of allocation determination in the context of communications minimization and try to integrate this question...
Cited by: More
Affine Dependence Classification for Communications Minimization - Mongenet (1996) (Correct)
Mappings for Communications Minimization Using Distribution and.. - Mongenet (1995) (Correct)
Active bibliography (related documents): More All
0.5: Compiler and Run-Time Support for Semi-Structured.. - Chrisochoides.. (1997) (Correct)
0.3: Processor-Time-Optimal Systolic Arrays - Cappello, Egecioglu, Seiman (2000) (Correct)
0.3: Processor Lower Bound Formulas for Array Computations and.. - Cappello, Egecioglu (1997) (Correct)
Similar documents based on text: More All
1.0: Optimal Mapping of Systolic Algorithms by Regular Instruction.. - Clauss, Perrin (1994) (Correct)
1.0: OPERA: A Toolbox for Loop Parallelization - Loechner, Mongenet (1996) (Correct)
1.0: Conference, 1994. [109] D. Sueur. Shell h'et'ergog`ene `a.. - Renpar Es (Correct)
Related documents from co-citation: More All
2: A Methodology for High-Level Synthesis of Communication on Multicomputers - Gupta, Banerjee - 1992
2: Automatic program parallelization - Banerjee, Eigenmann et al. - 1993
2: The SUIF compiler for scalable parallel machines (context) - Amarasinghe, Anderson et al. - 1995
BibTeX entry: (Update)
C. Mongenet. Data compiling for systems of affine recurrence equations. In IEEE Int. Conference on Application Specific Array Processors, ASAP'94, pages 212-- 223. IEEE Computer Society Press, 1994. http://citeseer.ist.psu.edu/mongenet94data.html More
@article{ mongenet94data,
author = "Catherine Mongenet",
title = "Data compiling for systems of uniform recurrence equations",
journal = "Parallel Processing Letters",
volume = "4",
number = "3",
pages = "245--257",
year = "1994",
url = "citeseer.ist.psu.edu/mongenet94data.html" }
Citations (may not include all citations):294 A loop transformation theory and an algorithm to maximize pa.. (context) - Wolf, Lam - 1991
200 Data parallel algorithms (context) - Hillis, Steele - 1986
168 The parallel execution of DO loops (context) - Lamport - 1974
133 The Organization of Computations for Uniform Recurrence Equa.. (context) - Karp, Miller et al. - 1967
111 Automatic program parallelization - Banerjee, Eigenman et al. - 1993
87 Compile-time techniques for data distribution in distributed.. - Ramanujam, Sadayappan
57 The Mapping of Linear Recurrence Equations on Regular Arrays - Quinton, Van Dongen - 1989
31 Non-unimodular transformations of nested loops - Ramanujam - 1992
30 A methodology for high-level synthesis of communication for .. - Gupta, Banerjee - 1992
30 Synthesizing systolic arrays with control signals from recur.. (context) - Rajopadhye - 1989
25 Optimal code parallelization using unimodular transformation.. (context) - Dowling - 1990
20 A graph-theoretic approach to the alignment problem (context) - Darte, Robert - 1993
10 Geometrical tools to map systems of affine recurrence equati.. (context) - Mongenet, Clauss - 1994
9 Partitioning and labeling of loops by unimodular transformat.. (context) - D'Hollander - 1992
8 Data compiling for systems of uniform recurrence equations (context) - Mongenet
8 Systematic Approaches to the Design of Algorithmically Speci.. (context) - Fu, Wah - 1987
3 Sparse matrix proceedings (context) - Kung, Leiserson - 1978
3 A spacetime-minimal systolic array for matrix product (context) - Cappello - 1989
2 a tool for semi-automatic MIMD SIMD parallelization (context) - Zima, Bast et al. - 1988
1 Supercomputers : design and applications tutorial (context) - Kuck, Kuhn et al. - 1984
1 Affine timings for systems of affine recurrence equations (context) - Mongenet - 1991
Documents on the same site (http://icps.u-strasbg.fr/pub_list.php?pres=8): More
Parameterized Polyhedra and their Vertices - Loechner, Wilde (1995) (Correct)
Parametric Analysis of Polyhedral Iteration Spaces - Clauss, Loechner (1996) (Correct)
On High-Level Low-Level Programming - Gerner (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC