全动态全对最短路径的大规模并行算法

IF 3.4 3区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Frontiers of Computer Science Pub Date : 2024-04-08 DOI:10.1007/s11704-024-3452-2

Chilei Wang, Qiang-Sheng Hua, Hai Jin, Chaodong Zheng

{"title":"全动态全对最短路径的大规模并行算法","authors":"Chilei Wang, Qiang-Sheng Hua, Hai Jin, Chaodong Zheng","doi":"10.1007/s11704-024-3452-2","DOIUrl":null,"url":null,"abstract":"In this paper, we propose the first fully dynamic parallel allpairs shortest path algorithm in the MPC model with a worstcase update rounds of \\(O({n^{{2 \\over 3} - {\\alpha \\over 6}}}\\log n/\\alpha )\\). We compare our algorithm with the existing static APSP algorithms in the MPC model, demonstrating the efficiency of our approach","PeriodicalId":12640,"journal":{"name":"Frontiers of Computer Science","volume":"33 1","pages":""},"PeriodicalIF":3.4000,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Massively parallel algorithms for fully dynamic all-pairs shortest paths\",\"authors\":\"Chilei Wang, Qiang-Sheng Hua, Hai Jin, Chaodong Zheng\",\"doi\":\"10.1007/s11704-024-3452-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose the first fully dynamic parallel allpairs shortest path algorithm in the MPC model with a worstcase update rounds of \\\\(O({n^{{2 \\\\over 3} - {\\\\alpha \\\\over 6}}}\\\\log n/\\\\alpha )\\\\). We compare our algorithm with the existing static APSP algorithms in the MPC model, demonstrating the efficiency of our approach\",\"PeriodicalId\":12640,\"journal\":{\"name\":\"Frontiers of Computer Science\",\"volume\":\"33 1\",\"pages\":\"\"},\"PeriodicalIF\":3.4000,\"publicationDate\":\"2024-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Frontiers of Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s11704-024-3452-2\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Frontiers of Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11704-024-3452-2","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们提出了MPC模型中的首个全动态并行全对最短路径算法，其最坏情况下的更新轮数为\(O({n^{2 \over 3} - {\alpha \over 6}}}\log n/\alpha )\)。我们将我们的算法与现有的 MPC 模型中的静态 APSP 算法进行了比较，证明了我们方法的效率

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

查看原文本刊更多论文

Massively parallel algorithms for fully dynamic all-pairs shortest paths

In this paper, we propose the first fully dynamic parallel allpairs shortest path algorithm in the MPC model with a worstcase update rounds of \(O({n^{{2 \over 3} - {\alpha \over 6}}}\log n/\alpha )\). We compare our algorithm with the existing static APSP algorithms in the MPC model, demonstrating the efficiency of our approach

求助全文

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

来源期刊

Frontiers of Computer Science COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING

CiteScore

8.60

自引率

2.40%

发文量

799

审稿时长

6-12 weeks

期刊介绍： Frontiers of Computer Science aims to provide a forum for the publication of peer-reviewed papers to promote rapid communication and exchange between computer scientists. The journal publishes research papers and review articles in a wide range of topics, including: architecture, software, artificial intelligence, theoretical computer science, networks and communication, information systems, multimedia and graphics, information security, interdisciplinary, etc. The journal especially encourages papers from new emerging and multidisciplinary areas, as well as papers reflecting the international trends of research and development and on special topics reporting progress made by Chinese computer scientists.