V. Turchenko, Taras Puhol, A. Sachenko, L. Grandinetti
{"title":"基于集群的资源代理策略在神经网络并行训练中的实现","authors":"V. Turchenko, Taras Puhol, A. Sachenko, L. Grandinetti","doi":"10.1109/IDAACS.2011.6072743","DOIUrl":null,"url":null,"abstract":"The implementation issues of a cluster-based resource brokering strategy intended for efficient parallelization of neural networks training are presented in this paper. We describe a strategy of resource brokering based on the prediction of execution time and parallelization efficiency of algorithms using a BSP computation model and Pareto optimality with a weight coefficients approach for choosing optimal solution. Our results show a reasonable adaptation of the resource brokering strategy to the environment of a real computational cluster providing the minimal total time to delivery of the parallel application.","PeriodicalId":106306,"journal":{"name":"Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cluster-based implementation of resource brokering strategy for parallel training of neural networks\",\"authors\":\"V. Turchenko, Taras Puhol, A. Sachenko, L. Grandinetti\",\"doi\":\"10.1109/IDAACS.2011.6072743\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The implementation issues of a cluster-based resource brokering strategy intended for efficient parallelization of neural networks training are presented in this paper. We describe a strategy of resource brokering based on the prediction of execution time and parallelization efficiency of algorithms using a BSP computation model and Pareto optimality with a weight coefficients approach for choosing optimal solution. Our results show a reasonable adaptation of the resource brokering strategy to the environment of a real computational cluster providing the minimal total time to delivery of the parallel application.\",\"PeriodicalId\":106306,\"journal\":{\"name\":\"Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IDAACS.2011.6072743\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IDAACS.2011.6072743","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cluster-based implementation of resource brokering strategy for parallel training of neural networks
The implementation issues of a cluster-based resource brokering strategy intended for efficient parallelization of neural networks training are presented in this paper. We describe a strategy of resource brokering based on the prediction of execution time and parallelization efficiency of algorithms using a BSP computation model and Pareto optimality with a weight coefficients approach for choosing optimal solution. Our results show a reasonable adaptation of the resource brokering strategy to the environment of a real computational cluster providing the minimal total time to delivery of the parallel application.