{"title":"多处理机中计算负荷分配分析","authors":"M. Aoki, G. Estrin, Richard L. Mandell","doi":"10.1145/1463822.1463839","DOIUrl":null,"url":null,"abstract":"Many of today's numerical problems are too time-consuming to be done on conventional computers. In some cases it is possible to reduce the overall computation time significantly by assigning part of the computation to one or more computers which work in parallel. If there is any uncertainty or random variation in the time required by either of the processors for completing its share of the computation, one cannot always divide the work between the computers in such a way that they will always finish at approximately the same time. Thus, it is possible for a considerable degradation in performance to occur.","PeriodicalId":432708,"journal":{"name":"AFIPS '63 (Fall)","volume":"570 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1963-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Analysis of computing-load assignment in a multi-processor computer\",\"authors\":\"M. Aoki, G. Estrin, Richard L. Mandell\",\"doi\":\"10.1145/1463822.1463839\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many of today's numerical problems are too time-consuming to be done on conventional computers. In some cases it is possible to reduce the overall computation time significantly by assigning part of the computation to one or more computers which work in parallel. If there is any uncertainty or random variation in the time required by either of the processors for completing its share of the computation, one cannot always divide the work between the computers in such a way that they will always finish at approximately the same time. Thus, it is possible for a considerable degradation in performance to occur.\",\"PeriodicalId\":432708,\"journal\":{\"name\":\"AFIPS '63 (Fall)\",\"volume\":\"570 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1963-11-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AFIPS '63 (Fall)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1463822.1463839\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AFIPS '63 (Fall)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1463822.1463839","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analysis of computing-load assignment in a multi-processor computer
Many of today's numerical problems are too time-consuming to be done on conventional computers. In some cases it is possible to reduce the overall computation time significantly by assigning part of the computation to one or more computers which work in parallel. If there is any uncertainty or random variation in the time required by either of the processors for completing its share of the computation, one cannot always divide the work between the computers in such a way that they will always finish at approximately the same time. Thus, it is possible for a considerable degradation in performance to occur.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
