Jiangming Jin, S. Turner, Bu-Sung Lee, S. Kuo, R. Goh, T. Hung
{"title":"运行时内核适应的性能建模:传染病模拟的案例研究","authors":"Jiangming Jin, S. Turner, Bu-Sung Lee, S. Kuo, R. Goh, T. Hung","doi":"10.1109/GRID.2010.5698009","DOIUrl":null,"url":null,"abstract":"In many large-scale scientific applications, there may be a compute intensive kernel that largely determines the overall performance of the application. Sometimes algorithmic variations of the kernel may be available and a performance benefit can then be gained by choosing the optimal kernel at runtime. However, it is sometimes difficult to choose the most efficient kernel as the kernel algorithms have varying performance under different execution conditions. This paper shows how to construct a set of performance models to explore and analyze the bottleneck of an application. Furthermore, based on the performance models, a theoretical method is proposed to guide the kernel adaptation at runtime. A component-based large-scale infectious disease simulation is used to illustrate the method. The performance models of the different kernels are validated by a range of experiments. The use of runtime kernel adaptation shows a significant performance gain.","PeriodicalId":6372,"journal":{"name":"2010 11th IEEE/ACM International Conference on Grid Computing","volume":"36 1","pages":"349-358"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Performance modeling for runtime kernel adaptation: A case study on infectious disease simulation\",\"authors\":\"Jiangming Jin, S. Turner, Bu-Sung Lee, S. Kuo, R. Goh, T. Hung\",\"doi\":\"10.1109/GRID.2010.5698009\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In many large-scale scientific applications, there may be a compute intensive kernel that largely determines the overall performance of the application. Sometimes algorithmic variations of the kernel may be available and a performance benefit can then be gained by choosing the optimal kernel at runtime. However, it is sometimes difficult to choose the most efficient kernel as the kernel algorithms have varying performance under different execution conditions. This paper shows how to construct a set of performance models to explore and analyze the bottleneck of an application. Furthermore, based on the performance models, a theoretical method is proposed to guide the kernel adaptation at runtime. A component-based large-scale infectious disease simulation is used to illustrate the method. The performance models of the different kernels are validated by a range of experiments. The use of runtime kernel adaptation shows a significant performance gain.\",\"PeriodicalId\":6372,\"journal\":{\"name\":\"2010 11th IEEE/ACM International Conference on Grid Computing\",\"volume\":\"36 1\",\"pages\":\"349-358\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 11th IEEE/ACM International Conference on Grid Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GRID.2010.5698009\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 11th IEEE/ACM International Conference on Grid Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GRID.2010.5698009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Performance modeling for runtime kernel adaptation: A case study on infectious disease simulation
In many large-scale scientific applications, there may be a compute intensive kernel that largely determines the overall performance of the application. Sometimes algorithmic variations of the kernel may be available and a performance benefit can then be gained by choosing the optimal kernel at runtime. However, it is sometimes difficult to choose the most efficient kernel as the kernel algorithms have varying performance under different execution conditions. This paper shows how to construct a set of performance models to explore and analyze the bottleneck of an application. Furthermore, based on the performance models, a theoretical method is proposed to guide the kernel adaptation at runtime. A component-based large-scale infectious disease simulation is used to illustrate the method. The performance models of the different kernels are validated by a range of experiments. The use of runtime kernel adaptation shows a significant performance gain.