Name
Abstract | ||
|---|---|---|
Application codes reliably achieve performance far less than the advertised capabilities of existing architectures, and this
problem is worsening with increasingly-parallel machines. For large-scale numerical applications, stencil operations often
impose the greater part of the computational cost, and the primary sources of inefficiency are the costs of message passing
and poor cache utilization. This paper proposes and demonstrates optimizations for stencil and stencil-like computations for
both serial and parallel environments that ameliorate these sources of inefficiency. Additionally, we argue that when stencil-like
computations are encoded at a high level using object-oriented parallel array class libraries, these optimizations, which
are beyond the capability of compilers, may be automated. The automation of these optimizations is particularly important
since the transformations represented by cache based optimizations can be unreasonably complicated by the peculiarities which
are architecture specific. This paper briefly presents the approach toward the automation of these transformations.
|
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/10704054_3 | ISCOPE |
Keywords | Field | DocType |
linear relaxation methods,improving cache utilization,message passing,object oriented | Program optimization,Memory hierarchy,Program transformation,Cache,Computer science,Stencil,Parallel computing,Optimizing compiler,Compiler,Message passing,Distributed computing | Conference |
ISBN | Citations | PageRank |
3-540-66818-7 | 4 | 0.99 |
References | Authors | |
13 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Federico Bassetti | 1 | 79 | 15.40 |
| Kei Davis | 2 | 41 | 8.72 |
| Madhav Marathe | 3 | 2775 | 262.17 |
| Daniel J. Quinlan | 4 | 652 | 80.13 |
| Bobby Philip | 5 | 75 | 9.67 |