{"title":"一个用于分布式系统串行c程序自动并行化的包","authors":"V. Beletsky, Alexander Bagaterenco, A. Chemeris","doi":"10.1109/PMMPC.1995.504357","DOIUrl":null,"url":null,"abstract":"Problems arising due to run existent software in parallel computer systems are considered. The problem may be formulated as the serial programs should be analyzed first and then through modification of them are to be brought in to make them able to run in parallel computers. The problems that arise have been analyzed and ways to tackle them are given. The structure of programming package is given. It is substantiated that for most sequential programs the major share of time spent for their execution is accounted for by processing loops. Three loop parallelization methods have been selected for implementation of programs: method of coordinates, method of linear transformations, and modified method of linear-piece parallelization. The dependence graph construction principles are expounded and scheduling methods are enumerated.","PeriodicalId":344246,"journal":{"name":"Programming Models for Massively Parallel Computers","volume":" 46","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A package for automatic parallelization of serial C-programs for distributed systems\",\"authors\":\"V. Beletsky, Alexander Bagaterenco, A. Chemeris\",\"doi\":\"10.1109/PMMPC.1995.504357\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Problems arising due to run existent software in parallel computer systems are considered. The problem may be formulated as the serial programs should be analyzed first and then through modification of them are to be brought in to make them able to run in parallel computers. The problems that arise have been analyzed and ways to tackle them are given. The structure of programming package is given. It is substantiated that for most sequential programs the major share of time spent for their execution is accounted for by processing loops. Three loop parallelization methods have been selected for implementation of programs: method of coordinates, method of linear transformations, and modified method of linear-piece parallelization. The dependence graph construction principles are expounded and scheduling methods are enumerated.\",\"PeriodicalId\":344246,\"journal\":{\"name\":\"Programming Models for Massively Parallel Computers\",\"volume\":\" 46\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Programming Models for Massively Parallel Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PMMPC.1995.504357\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Programming Models for Massively Parallel Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PMMPC.1995.504357","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A package for automatic parallelization of serial C-programs for distributed systems
Problems arising due to run existent software in parallel computer systems are considered. The problem may be formulated as the serial programs should be analyzed first and then through modification of them are to be brought in to make them able to run in parallel computers. The problems that arise have been analyzed and ways to tackle them are given. The structure of programming package is given. It is substantiated that for most sequential programs the major share of time spent for their execution is accounted for by processing loops. Three loop parallelization methods have been selected for implementation of programs: method of coordinates, method of linear transformations, and modified method of linear-piece parallelization. The dependence graph construction principles are expounded and scheduling methods are enumerated.