DOE OSTI · 910525
Hypergraph Partitioning for Automatic Memory Hierarchy Management
Abstract
The paper presents present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming framework. The programmer specifies the parallelism and locality in the computation. The scheduling of the computation into stages, together with the movement of the associated data between secondary storage and global memory, and between global memory and local memory, is automatically managed by the framework. A novel formulation of hypergraph partitioning is used to model the optimization problem of minimizing disk I/O by improving locality of access. Experimental evaluation of the proposed approach using a sub-computation from the quantum chemistry domain shows a reduction in the disk I/O cost by upto a factor of 11, and a reduction in turnaround time by upto 97%, as compared to alternatives used in state-of-the-art quantum chemistry codes.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Krishnamoorthy, Sriram, Catalyurek, Umit, Nieplocha, Jarek, Rountev, Atanas, Sadayappan, Ponnuswamy. 2007-11-15. Hypergraph Partitioning for Automatic Memory Hierarchy Management. https://doi.org/10.1109/sc.2006.36. https://searchnasa.com/record/osti%3A910525/hypergraph-partitioning-for-automatic-memory-hierarchy-management
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.