.png){kind=icon}
返回
A data-parallel many-source shortest-path algorithm to accelerate macroscopic transport network assignment
.png){kind=icon}
OA
AI
DOI：10.1016/j.trc.2019.05.020.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The performance and scalability of macroscopic assignment and simulation software limits the quantity, scale and complexity of simulations of transport networks that are used to aid the planning, design and operation of transport systems. Through the application of many-core processing architectures (such as Graphics Processing Units (GPUs)) and data-parallel algorithms, the performance of such software can be dramatically increased. In this paper, a work-efficient, Multiple Source Shortest Path (MSSP) implementation of the Bellman-Ford algorithm is proposed to dramatically increase the performance of shortest path calculations for low-density high-diameter graphs, which are characteristic of transportation networks. This is achieved through the use of an Origin-Vertex Frontier to increase the level of parallelism within the shortest path algorithm for multiple source vertices in low-density graphs, when executed on GPUs. The algorithm is implemented within the SATURN transport simulation software and benchmarked on a range of real-world transportation networks. Our algorithm improves hardware utilisation of massively-parallel GPUs; demonstrating performance improvements of up to 7.8x over a multicore CPU (Central Processing Unit) implementation.
Keyword:
Macroscopic road network simulation
Assignment
Data-parallel
Shortest path
Algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.9
论文数:
4.9K
被引数:
3.2W
机构
引用论文
.png){kind=icon}
Automatic generation of fixed-point-finding evaluators for circular, but well-defined, attribute grammars自动生成用于循环但定义明确的属性语法的定点查找评估器
PREAI
分享收藏Estimating multi-year 24/7 origin-destination demand using high-granular multi-source traffic dataOAAI
OAAI分享收藏分享收藏
查看更多内容