Kou Murakami, K. Komatsu, Masayuki Sato, Hiroaki Kobayashi
{"title":"基于执行时间估计的机器学习程序处理器选择方法","authors":"Kou Murakami, K. Komatsu, Masayuki Sato, Hiroaki Kobayashi","doi":"10.1109/IPDPSW52791.2021.00116","DOIUrl":null,"url":null,"abstract":"In recent years, machine learning has become widespread. Since machine learning algorithms have become complex and the amount of data to be handled have become large, the execution times of machine learning programs have been increasing. Processors called accelerators can contribute to the execution of a machine learning program with a short time. However, the processors including the accelerators have different characteristics. Therefore, it is unclear whether existing machine learning programs are executed on the appropriate processor or not. This paper proposes a method for selecting a processor suitable for each machine learning program. In the proposed method, the selection is based on the estimation of the execution time of machine learning programs on each processor. The proposed method does not need to execute a target machine learning program in advance. From the experimental results, it is clarified that the proposed method can achieve up to 5.3 times faster execution than the original implementation by NumPy. These results prove that the proposed method can be used in a system that automatically selects the processor so that each machine learning program can be easily executed on the best processor.","PeriodicalId":170832,"journal":{"name":"2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Processor Selection Method based on Execution Time Estimation for Machine Learning Programs\",\"authors\":\"Kou Murakami, K. Komatsu, Masayuki Sato, Hiroaki Kobayashi\",\"doi\":\"10.1109/IPDPSW52791.2021.00116\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, machine learning has become widespread. Since machine learning algorithms have become complex and the amount of data to be handled have become large, the execution times of machine learning programs have been increasing. Processors called accelerators can contribute to the execution of a machine learning program with a short time. However, the processors including the accelerators have different characteristics. Therefore, it is unclear whether existing machine learning programs are executed on the appropriate processor or not. This paper proposes a method for selecting a processor suitable for each machine learning program. In the proposed method, the selection is based on the estimation of the execution time of machine learning programs on each processor. The proposed method does not need to execute a target machine learning program in advance. From the experimental results, it is clarified that the proposed method can achieve up to 5.3 times faster execution than the original implementation by NumPy. These results prove that the proposed method can be used in a system that automatically selects the processor so that each machine learning program can be easily executed on the best processor.\",\"PeriodicalId\":170832,\"journal\":{\"name\":\"2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)\",\"volume\":\"93 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPDPSW52791.2021.00116\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPSW52791.2021.00116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Processor Selection Method based on Execution Time Estimation for Machine Learning Programs
In recent years, machine learning has become widespread. Since machine learning algorithms have become complex and the amount of data to be handled have become large, the execution times of machine learning programs have been increasing. Processors called accelerators can contribute to the execution of a machine learning program with a short time. However, the processors including the accelerators have different characteristics. Therefore, it is unclear whether existing machine learning programs are executed on the appropriate processor or not. This paper proposes a method for selecting a processor suitable for each machine learning program. In the proposed method, the selection is based on the estimation of the execution time of machine learning programs on each processor. The proposed method does not need to execute a target machine learning program in advance. From the experimental results, it is clarified that the proposed method can achieve up to 5.3 times faster execution than the original implementation by NumPy. These results prove that the proposed method can be used in a system that automatically selects the processor so that each machine learning program can be easily executed on the best processor.