2020
DOI: 10.1109/jiot.2020.2972041
|View full text |Cite
|
Sign up to set email alerts
|

Dependency-Aware Task Scheduling in Vehicular Edge Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
68
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 188 publications
(68 citation statements)
references
References 34 publications
0
68
0
Order By: Relevance
“…Vehicular densities are considered low when the vehicular density is approximately 11 vehicles/km in a highway scenario and 25 vehicles/km 2 in an urban scenario [207], [206]. As shown in Figure 7(d), low was the vehicular density most used in the offloading experiments [129], [96], [13].…”
Section: A: Lowmentioning
confidence: 99%
See 1 more Smart Citation
“…Vehicular densities are considered low when the vehicular density is approximately 11 vehicles/km in a highway scenario and 25 vehicles/km 2 in an urban scenario [207], [206]. As shown in Figure 7(d), low was the vehicular density most used in the offloading experiments [129], [96], [13].…”
Section: A: Lowmentioning
confidence: 99%
“…However, new and popular applications have emerged, such as applications based on artificial intelligence, augmented reality (AR), image-aided navigation, intelligent vehicle control, gaming, etc. Such applications demand massive computation and storage resources to handle complicated data processing and storage operations, and still have critical latency requirements [12], [13]. In addition, it is expected that with hundreds of sensors in future vehicles generating an enormous amount of data, there will be a lot of pressure on the computational resources of the vehicles.…”
Section: Introductionmentioning
confidence: 99%
“…The probability is set based on the distance between the vehicle and the access point, application requirement, and communication overhead. In [23], Liu et al have discussed the task dependency relationship among multiple tasks, and have formulated the corresponding multi-task scheduling problem as an optimization problem. The problem is solved by prioritizing the tasks according to the completion time constraint and the process dependency requirement.…”
Section: B Edge Computing and Task Offloadingmentioning
confidence: 99%
“…There are two commonly used structural representation methods to denote an application, namely the graph-based method [34] and the language-based method [35]. In particular, the graph-based method includes directed acyclic graph (DAG) [20][25] [27][28] [36] and Petri Net [37]. DAG based model is one of the most popular methods.…”
Section: A System Overviewmentioning
confidence: 99%