a parallel shortest path algorithm based on graph-partitioning and iterative correcting
文献类型：期刊论文
| 作者 | Tang Yuxin ; Zhang Yunquan ; Chen Hu |
| 刊名 | COMPUTER SYSTEMS SCIENCE AND ENGINEERING
 |
| 出版日期 | 2009 |
| 卷号 | 24期号:5页码:351-360 |
| 关键词 | parallel shortest path algorithm intelligent transportation parallel computing graph partitioning |
| ISSN号 | 0267-6192 |
| 学科主题 | Computer Science, Hardware & Architecture; Computer Science, Theory & Methods |
| 收录类别 | SCI |
| 语种 | 英语 |
| 公开日期 | 2011-03-18 |
| 附注 | In this paper, we focus on satisfying the actual demands of quickly finding the shortest paths over real-road networks in an intelligent transportation system. A parallel shortest path algorithm based on graph partitioning and iterative correcting is proposed. After evaluating the algorithm using three real road networks, we conclude that our graph-partitioning and iterative correcting based parallel algorithm has good performance. In addition, we do the evaluation with two hardware platforms, and the new parallel algorithm achieves more than a 15-fold speedup on 16 processes in an IBM cluster (16 cores, 4 nodes), gets about 20-fold speedup on 16 processes with Dawning 5000A server(16 cores, 1 nodes). |
| 源URL | [http://124.16.136.157/handle/311060/7900]  |
| 专题 | 软件研究所_软件所图书馆_2009年期刊/会议论文 |
| 推荐引用方式 GB/T 7714 | Tang Yuxin,Zhang Yunquan,Chen Hu. a parallel shortest path algorithm based on graph-partitioning and iterative correcting[J]. COMPUTER SYSTEMS SCIENCE AND ENGINEERING,2009,24(5):351-360. |
| APA | Tang Yuxin,Zhang Yunquan,&Chen Hu.(2009).a parallel shortest path algorithm based on graph-partitioning and iterative correcting.COMPUTER SYSTEMS SCIENCE AND ENGINEERING,24(5),351-360. |
| MLA | Tang Yuxin,et al."a parallel shortest path algorithm based on graph-partitioning and iterative correcting".COMPUTER SYSTEMS SCIENCE AND ENGINEERING 24.5(2009):351-360. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。