2017 IEEE International Conference on Communications (ICC) 2017
DOI: 10.1109/icc.2017.7997148
|View full text |Cite
|
Sign up to set email alerts
|

CUDA-accelerated task scheduling in vehicular clouds with opportunistically available V2I

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…The Markov Decision Process (MDP) based vehicular task scheduling over VCs based on the opportunistically available V2I communications between VCs is presented in [121]. The MDP-based task scheduling in VCC is developed to optimize the task placement of various vehicular tasks over many VCs in a way that increases the maximum expected longterm cumulative reward of the VCC and not for minimizing the cost of VM migration from one VC to another.…”
Section: Software Defined Wireless Networking Fast Greedy Heuristic A...mentioning
confidence: 99%
See 1 more Smart Citation
“…The Markov Decision Process (MDP) based vehicular task scheduling over VCs based on the opportunistically available V2I communications between VCs is presented in [121]. The MDP-based task scheduling in VCC is developed to optimize the task placement of various vehicular tasks over many VCs in a way that increases the maximum expected longterm cumulative reward of the VCC and not for minimizing the cost of VM migration from one VC to another.…”
Section: Software Defined Wireless Networking Fast Greedy Heuristic A...mentioning
confidence: 99%
“…As opposed to [120] where the placement of tasks is made based on minimizing VM migration over demand changes, a Fast greedy heuristic algorithm is presented in [121] in order to find sub-optimal solutions for virtual machine allocation and vehicular task placement based on tasks' requirements and VCs' availability, in terms of free VMs. The greedy scheduling algorithm does not reconsider its placements after a scheduling decision of tasks is made.…”
Section: Software Defined Wireless Networking Fast Greedy Heuristic A...mentioning
confidence: 99%
“…In our solution, we focus on the acceleration and the total time to complete the kernel and not the duration it takes a thread to complete. We use NVIDIA's Quadro K1100M GPU, as shown in Table . II to leverage the parallel SIMD capabilities of CUDA SMs model by running the value iteration algorithm to finding the optimal solution, as initiated in [39]. Our BSDI implementation in Algorithm 4 uses parallel set of state space that do not have any relationship to apply the value iteration algorithm in parallel and evaluate the performance of all states after scheduling.…”
Section: Algorithm 3 Algorithm For Value Iterationmentioning
confidence: 99%