.png){kind=icon}
返回
Reducing waiting time with parallel preemptive algorithm in VANETs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.vehcom.2016.11.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Improper functioning of traffic signals at the intersections result in extreme congestion leading to increase in overall journey time and wastage of precious fuel. Various algorithms have been proposed in literature for alleviating the problem of congestion. Fixed-time, non-preemptive and preemptive approaches work towards reduction of queue length at the intersections to decrease the overall waiting time on roads. High traffic volume on the road results in large queue length which takes huge amount of time to process using a single processor. Hence, there is a need for fast processing which can be obtained by parallelizing the algorithm. This paper proposes a parallel preemptive algorithm to reduce the average queue length resulting in decrease of overall waiting time. The implementation of parallel algorithm is done using Compute Unified Device Architecture (CUDA) by harnessing the power of Graphical Processing Units (GPUs). The performance of the proposed parallel preemptive algorithm is compared with fixed-time, non-preemptive and preemptive approaches. Obtained results show the reduction in queue length in case of the proposed algorithm which is also confirmed using T-test with 99% confidence. (C) 2016 Elsevier Inc. All rights reserved.
Keyword:
Vehicular Ad-hoc Networks (VANETs)
Preemptive signals
Fixed-time signals
Average queuing length
Parallel computing
GPU
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
798
被引数:
3.2K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容