Analysis of Local Enumeration and Storage Schemes in HPF

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 show that for linear array access sequences, efficient enumeration and storage compression schemes can be derived. Furthermore, local enumeration and storage techniques are shown to be orthogonal, if the local storage compression scheme is collapsible. Performance figures of the methods are given for a number of different processors.

• Type: Journal
• Year: 1998
• Where: PC
• Authors: Henk J. Sips, Will Denissen, Kees van Reeuwijk
• Keywords: Local Enumeration, Local Storage Compression, Management, PC 1998, Storage Compression Scheme