处理器阵列上的单源最短路径问题

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1992-10-19 DOI:10.1109/FMPC.1992.234924

P. Narayanan

{"title":"处理器阵列上的单源最短路径问题","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":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"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\":\"120 1\",\"pages\":\"0\"},\"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}","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

摘要

研究了非负加权图中从单个源顶点到每个顶点的最短路径的计算算法。针对单源最短路径问题，提出了一种传统的数据并行算法和一种复制数据算法。这两种算法都在连接机CM-2和MasPar MP-1上实现。介绍了利用数据复制技术的分析和实验加速。

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

查看原文本刊更多论文

Single source shortest path problem on processor arrays

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

求助全文

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

来源期刊

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation

自引率

0.00%

发文量