22 search results - page 1 / 5 » Analysis of Local Enumeration and Storage Schemes in HPF |
PC
1998
13 years 5 months ago
1998
In this paper, we analyze the efficiency of three local enumeration and three storage compression schemes for cyclic(m) data distributions in High Performance Fortran (HPF). We sh...
LCPC
2000
Springer
13 years 8 months ago
2000
Springer
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
ISHPC
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
HPCN
1997
Springer
13 years 9 months ago
1997
Springer
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
WWW
2007
ACM
14 years 6 months ago
2007
ACM
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...