Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleData mining analysis to validate performance tuning practices for HPL
dc.contributor.authorTan, T.Z.
dc.contributor.authorMong Goh, R.S.
dc.contributor.authorMarch, V.
dc.contributor.authorSee, S.
dc.identifier.citationTan, T.Z.,Mong Goh, R.S.,March, V.,See, S. (2009). Data mining analysis to validate performance tuning practices for HPL. Proceedings - IEEE International Conference on Cluster Computing, ICCC. ScholarBank@NUS Repository. <a href="" target="_blank"></a>
dc.description.abstractApplications performance is a criterion for system evaluation, and hence performance tuning for these applications is of great interest. One such benchmark application is High Performance Linpack (HPL). Although guidelines exist for HPL tuning, validating these guidelines on various systems is a challenging task as a large number of configurations need to be tested. In this work, we use data mining analysis to reduce the number of configurations to be tested in validating the HPL tuning guidelines on the Ranger System. We validate that NB, P and Q are the three most important parameters to tune HPL, and that PMAP does not have a significant impact on HPL performance. We also validate the practice of tuning HPL at small N using data mining analysis. We find that the value of N selected for tuning should not be significantly smaller than the largest N that can fit into the system memory. Our results indicate that data mining could be further applied to application performance tuning. © 2009 IEEE.
dc.subjectData mining
dc.subjectPerformance modeling
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleProceedings - IEEE International Conference on Cluster Computing, ICCC
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.


checked on Dec 1, 2022

Page view(s)

checked on Nov 24, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.