{"title":"The p-shovelers problem-computing with time-varying data","authors":"F. Luccio, L. Pagli","doi":"10.1145/130956.130960","DOIUrl":null,"url":null,"abstract":"The authors consider problems whose size varies with time, and discuss the organization and analysis of algorithms for them. They prove that the benefits of a parallel solution may be greater than usual, they also prove that the standard lower and upper bounds on parallel speed-up do not hold in this case, and must be reformulated.<<ETX>>","PeriodicalId":265469,"journal":{"name":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/130956.130960","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20
Abstract
The authors consider problems whose size varies with time, and discuss the organization and analysis of algorithms for them. They prove that the benefits of a parallel solution may be greater than usual, they also prove that the standard lower and upper bounds on parallel speed-up do not hold in this case, and must be reformulated.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
