Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4957825 | Vehicular Communications | 2017 | 11 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Vinita Jindal, Punam Bedi,