Achieving accurate and context-sensitive timing for code optimization
| dc.contributor.author | Whaley, R. Clint | |
| dc.contributor.author | Castaldo, Anthony M. | |
| dc.date.accessioned | 2023-10-24T15:10:26Z | |
| dc.date.available | 2023-10-24T15:10:26Z | |
| dc.date.issued | 2008-01-18 | |
| dc.description.abstract | Key computational kernels must run near their peak efficiency for most high performance computing (HPC) applications. Getting this level of efficiency has always required extensive tuning of the kernel on a particular platform of interest. The success or failure of an optimization is usually measured by invoking a timer. Understanding how to build reliable and context-sensitive timers is one of the most neglected areas in HPC, and this results in a host of HPC software that looks good when reported in papers, but which delivers only a fraction of the reported performance when used by actual HPC applications. In this paper we motivate the importance of timer design, and then discuss the techniques and methodologies we have developed in order to accurately time HPC kernel routines for our well-known empirical tuning framework, ATLAS. | |
| dc.description.department | Computer Science | |
| dc.description.sponsorship | This work was supported in part by National Science Foundation CRI grant SNS-0551504. | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12588/2136 | |
| dc.language.iso | en_US | |
| dc.publisher | UTSA Department of Computer Science | |
| dc.relation.ispartofseries | Technical Report; CS-TR-2008-001 | |
| dc.title | Achieving accurate and context-sensitive timing for code optimization | |
| dc.type | Technical Report |