(Enter summary)
Abstract: The user-controlled mapping of data across the local memories of processing nodes is one
of the central features of data-parallel languages like High Performance Fortran (HPF). Since
many scientific applications typically consist of different computational phases owning each a
best data mapping, dynamic remappings have proven useful in maintaining good data locality
and workload balance.
HPF supports remappings by procedure calls and by executing redistribute/realigndirectives.
But remappings... (Update)
Context of citations to this paper: More
...be dynamically modified makes analysis complicated. To get a simple handle on this problem we insert distribution mapping assignments [11, 8] in a pre pass whenever a distribution is assigned to an array. Thereafter, analysis is applied to those distribution mapping...
Cited by: More
Probabilistic Communication Optimizations and Parallelization .. - Mehofer, Scholz (2001)
(Correct)
Active bibliography (related documents): More All
1.3: Interprocedural Distribution Assignment Placement: Analogies.. - Knoop, Mehofer (1997)
(Correct)
1.1: Distribution Assignment Placement: A New Aggressive Approach.. - Knoop, Mehofer (1997)
(Correct)
1.0: Optimal Distribution Assignment Placement - Jens Knoop And (1997)
(Correct)
Similar documents based on text: More All
1.1: High Level Support for Distributed High Performance Computing - Laure (2001)
(Correct)
1.1: Bayesian Inference for Reliable Biomedical Signal Processing - Sykacek (2000)
(Correct)
0.9: XGuide - Concurrent Web Development with Contracts - Kerer (2003)
(Correct)
BibTeX entry: (Update)
E. Mehofer. Optimization of Data Remapping in DataParallel Languages. PhD thesis, Vienna University of Technology, April 1998. http://citeseer.ist.psu.edu/mehofer98optimization.html More
@misc{ mehofer98optimization,
author = "E. Mehofer",
title = "Optimization of Data Remapping in DataParallel Languages",
text = "E. Mehofer. Optimization of Data Remapping in DataParallel Languages. PhD
thesis, Vienna University of Technology, April 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/mehofer98optimization.html" }
Citations (may not include all citations):
866
Techniques and Tools (context) - Aho, Sethi et al. - 1988
835
High Performance Fortran language specification version
- Fortran - 1993
835
High Performance Fortran language specification version
- Fortran - 1997
835
High Performance Fortran language specification version
- Fortran - 1997
587
PVM: A framework for parallel distributed computing
- Sunderam - 1990
352
Supercompilers for Parallel and Vector Computers (context) - Zima, Chapman - 1990
292
Advanced compiler design and implementation (context) - Muchnick - 1997
248
Orca: A Language For Parallel Programming of Distributed Sys..
- Bal, Kaashoek et al. - 1992
225
Flow Analysis of Computer Programs (context) - Hecht - 1977
185
Linda and friends (context) - Ahuja, Carriero et al. - 1986
156
A unified approach to global program optimization (context) - Kildall - 1973
142
MPI-2: Extensions to the Message-Passing Interface
- Interface - 1997
132
Strand: New concepts in parallel programming (context) - Foster, Taylor - 1990
129
Global value numbers and redundant computations (context) - Rosen, Wegman et al. - 1988
128
Global optimization by suppression of partial redundancies (context) - Morel, Renvoise - 1979
116
Monotone data flow analysis frameworks (context) - Kam, Ullman - 1977
104
Lazy code motion
- Knoop, Ruthing et al. - 1992
96
A language for modular parallel programming (context) - Foster, Chandy - 1995
93
Global data flow analysis and iterative algorithms (context) - Kam, Ullman - 1976
82
Some computer organizations and their effectiveness (context) - Flynn - 1972
82
Partial dead code elimination
- Knoop, Ruthing et al. - 1994
78
Software Practice and Experience (context) - Knuth, study et al. - 1971
73
Exploiting Task and Data Parallelism on a Multicomputer
- Subhlok, Stichnoth et al. - 1993
67
Compositional Parallel Programming (context) - Chandy, Kesselman - 1992
64
Interprocedural compilation of Fortran D for MIMD distribute..
- Hall, Hirandani et al. - 1992
62
Programming distributed memory architectures using Kali (context) - Mehrotra, Van Rosendale - 1991
59
The interprocedural coincidence theorem
- Knoop, Steffen - 1992
55
Automatic data layout for distributed memory machines
- Kremer - 1995
51
Automatic generation of efficient array redistribution routi..
- Ramaswamy, Banerjee - 1994
51
Managing Interprocedural Optimization
- Hall - 1991
51
Automatic generation of efficient array redistribution routi..
- Ramaswamy, Banerjee - 1995
39
Vienna Fortran - A language specification version (context) - Zima, Brezany et al. - 1992
38
A unified data-flow framework for optimizing communication
- Gupta, Schonberg et al. - 1994
36
OPUS: A Coordination Language for Multidisciplinary Applicat..
- Chapman, Zima et al. - 1995
34
Compiling Programs for Nonshared Memory Machines (context) - Koelbel - 1990
29
language specification (context) - Fox, Hiranandani et al. - 1992
29
Vienna Fortran (context) - Benkner, Chapman et al. - 1992
29
Runtime Array Redistribution in HPF Programs
- Thakur, Choudhary et al. - 1994
28
The power of assignment motion
- Knoop, Ruthing et al. - 1995
26
Path profile guided partial dead code elimination using pred..
- Gupta, Berson et al. - 1997
23
Interprocedural partial redundancy elimination and its appli..
- Agrawal, Saltz et al. - 1995
23
The BLAZE language: A parallel language for scientific progr.. (context) - Mehrotra, Van Rosendale - 1987
23
Multi-phase array redistribution: Modeling and evaluation
- Kaushik, Huang et al. - 1995
22
A fast algorithm for code movement optimization (context) - Dhamdhere - 1988
22
A Fast Algorithm for Code Movement Optimization (context) - Dhamdhere - 1988
20
Performance issues of the parallel PAM-CRASH code (context) - Clinckemaillie, Elsner et al. - 1997
20
Towards a tool kit for the automatic generation of interproc..
- Knoop, Ruthing et al. - 1996
18
Processor mapping technique toward efficient data redistribu..
- Kalns, Ni - 1994
18
Aggressive inlining (context) - Ayers, Gottlieb et al. - 1997
17
Optimal compilation of HPF remappings (context) - Coelho, Ancourt - 1996
17
An approach to communication-efficient data redistribution
- Kaushik, Huang et al. - 1994
16
IEEE Transactions on Parallel and Distributed Systems (context) - Thakur, Choudhary et al. - 1996
16
An elimination algorithm for bidirectional data flow problem.. (context) - Dhamdhere, Patil - 1993
14
Optimal interprocedural program optimization: A new framewor.. (context) - Knoop - 1993
12
Implementing Fast Fourier Transforms on distributed-memory m..
- Gupta, Huang et al. - 1994
12
Interprocedural array redistribution dataflow analysis
- Palermo, Hodges et al. - 1996
11
Task parallel programming in Fx
- Subhlok, O'Hallaron et al. - 1994
11
Efficient block-cyclic data redistribution
- Prylli - 1996
10
Interprocedural Elimination of Partial Redundancies (context) - Morel, Renvoise - 1981
10
Optimizations for efficient array redistribution on distribu.. (context) - Ramaswamy, Simons et al. - 1996
9
A new approach to array redistribution: Strip mining redistr..
- Wakatani, Wolfe - 1994
8
Institute for Software Technology and Parallel Systems (context) - Mehofer, Zima et al. - 1996
8
A Constraint Based Communication Placement Framework (context) - Kennedy, Sethi - 1995
8
The IFS model: A parallel production weather code (context) - Barros, Dent et al. - 1995
7
Hypertasking Support for Dynamically Redistributable and Res.. (context) - Baber - 1991
7
Efficient and optimal bit-vector data flow analyses: A unifo.. (context) - Knoop, Steffen - 1993
6
Information Processing Letters (context) - Richardson, Ganapathi et al. - 1989
6
Buffer-safe communication optimization based on data flow an..
- Fahringer, Mehofer - 1997
4
The revival transformation (context) - Feigen, Klappholz et al. - 1994
4
Effectiveness of message strip-mining for regular and irregu..
- Wakatani, Wolfe - 1994
4
Non-monotone fixpoint iterations to resolve second order eff..
- Geser, Knoop et al. - 1996
3
Interprocedural distribution assignment placement: More than..
- Knoop, Mehofer - 1997
3
A basic-cycle calculation technique for efficient dynamic da..
- Chung, Hsu et al. - 1998
3
Hypertasking: Automatic array and loop partitioning on the i.. (context) - Baber - 1991
3
Optimal distribution assignment placement
- Knoop, Mehofer - 1997
3
Description of an LAPW DF program (context) - Schwarz, Blaha - 1996
2
Intraprocedural Distribution assignment placement: Optimalit.. (context) - Knoop, Mehofer - 1997
2
Practical Adaption of the Global Optimization Algorithm of M.. (context) - Dhamdhere - 1991
2
Problem and machine sensitive communication optimization
- Fahringer, Mehofer - 1998
1
Multi-phase Array Redistribution: A Communication Efficient .. (context) - Kaushik, Huang et al. - 1994
1
High Performance Fortran for computational fluid dynamics ap.. (context) - Hawick, Bogucz et al. - 1994
Documents on the same site (http://www.par.univie.ac.at/publications/1998-1999/tr98-99_short.html): More
Enhancing OpenMP With Features for Locality Control - Chapman, Mehrotra, Zima (1999)
(Correct)
HPF+ - An Extension of HPF for Advanced Applications - Benkner, Laure, Zima (1999)
(Correct)
Communication Overhead: Prediction and its Influence on.. - Noelle, Pantano, Sun (1998)
(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