p-铲问题-时变数据的计算

[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing Pub Date : 1992-05-01 DOI:10.1145/130956.130960

F. Luccio, L. Pagli

{"title":"p-铲问题-时变数据的计算","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":"{\"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}","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

摘要

作者考虑了大小随时间变化的问题，并讨论了这些问题的算法组织和分析。他们证明了并行解决方案的好处可能比通常情况下更大，他们还证明了并行加速的标准下界和上界在这种情况下不成立，必须重新制定

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The p-shovelers problem-computing with time-varying data

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing

自引率

0.00%

发文量

期刊最新文献

On uniformization of affine dependence algorithms On embedding ternary trees into Boolean hypercubes A divide and conquer approach to shortest paths in planar layered digraphs Advanced software pipelining and the program dependence graph A fast sort using parallelism within memory