{"title":"现实并行环境下的反向传播","authors":"D. Strupl, Roman Neruda","doi":"10.1109/IJSIS.1998.685414","DOIUrl":null,"url":null,"abstract":"Various ways of parallelizing the back propagation algorithm (BP) are studied on the bulk-synchronous parallel machine (BSP) like parallel model. Optimal number of processors and criteria for choosing the right task decomposition are presented. Theoretical results are verified in the parallel virtual machine (PVM) environment on a cluster of workstations.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Back propagation in realistic parallel environment\",\"authors\":\"D. Strupl, Roman Neruda\",\"doi\":\"10.1109/IJSIS.1998.685414\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Various ways of parallelizing the back propagation algorithm (BP) are studied on the bulk-synchronous parallel machine (BSP) like parallel model. Optimal number of processors and criteria for choosing the right task decomposition are presented. Theoretical results are verified in the parallel virtual machine (PVM) environment on a cluster of workstations.\",\"PeriodicalId\":289764,\"journal\":{\"name\":\"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-03-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IJSIS.1998.685414\",\"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. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJSIS.1998.685414","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Back propagation in realistic parallel environment
Various ways of parallelizing the back propagation algorithm (BP) are studied on the bulk-synchronous parallel machine (BSP) like parallel model. Optimal number of processors and criteria for choosing the right task decomposition are presented. Theoretical results are verified in the parallel virtual machine (PVM) environment on a cluster of workstations.