KaHPF: Compiler generated Data Prefetching for HPF

Matthias M. Müller ()
Additional contact information
Matthias M. Müller: University of Karlsruhe, Institute for Program Structures and Data Organization

A chapter in High Performance Computing in Science and Engineering ’99, 2000, pp 474-482 from Springer

Abstract: Abstract In many parallel applications, network latency causes a dramatic loss in processor utilization. This paper presents KaHPF, an optimizing HPF compiler, that uses software controlled access pipelining (SCAP) to hide communication latency. Various benchmarks of common, but complex communication patterns demonstrate KaHPF’s performance improvement on a Cray T3E. KaHPF’s compiled code is faster than code that uses highly optimized shared-memory system functions by a factor of 1.2 to 3.2. In comparison to PGF’s HPF compiler KaHPF shows an improvement of 3.9 to 30.4.

Keywords: Parallel Application; Network Latency; Architectural Support; Virtual Processor; Data Access Pattern (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-59686-5_46

Ordering information: This item can be ordered from
http://www.springer.com/9783642596865

DOI: 10.1007/978-3-642-59686-5_46

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().