{"title":"Single source shortest path problem on processor arrays","authors":"P. Narayanan","doi":"10.1109/FMPC.1992.234924","DOIUrl":null,"url":null,"abstract":"Algorithms for computing the shortest paths to every vertex from a single source vertex in nonnegatively weighted graphs are examined. A conventional data parallel algorithm and a replicated data algorithm for the single-source shortest path problem are presented. Both algorithms have been implemented on a Connection Machine CM-2 and a MasPar MP-1. Analytical and experimental speedups using the data replication technique are presented.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1992.234924","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
Algorithms for computing the shortest paths to every vertex from a single source vertex in nonnegatively weighted graphs are examined. A conventional data parallel algorithm and a replicated data algorithm for the single-source shortest path problem are presented. Both algorithms have been implemented on a Connection Machine CM-2 and a MasPar MP-1. Analytical and experimental speedups using the data replication technique are presented.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
