2019 International Conference on Information Technology (ICIT) 2019
DOI: 10.1109/icit48102.2019.00035
|View full text |Cite
|
Sign up to set email alerts
|

An Optimal Task Scheduling Towards Minimized Cost and Response Time in Fog Computing Infrastructure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 24 publications
0
8
0
Order By: Relevance
“…To improve the response time of tasks, the method proposed by Apat et al (2019) iteratively assigned the task with the least slack time to the edge server closest to the user. Tasks are assigned to the cloud when they cannot be finished by edges.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…To improve the response time of tasks, the method proposed by Apat et al (2019) iteratively assigned the task with the least slack time to the edge server closest to the user. Tasks are assigned to the cloud when they cannot be finished by edges.…”
Section: Related Workmentioning
confidence: 99%
“…Task scheduling or offloading is an effective way for optimizing the task performance and the resource efficiency for DE3C, which decides the location (the corresponding device, an edge or a cloud) where each task to be processed (offloading decision) and the computing resources which each task performs on in a specified order (task assignment and ordering) ( Wang et al, 2020b ; Islam et al, 2021 ). Therefore, several works have proposed various task scheduling methods trying to optimize the response time ( Han et al, 2019 ; Meng et al, 2019 ; Meng et al, 2020 ; Apat et al, 2019 ; Ren et al, 2019 ; Liu et al, 2019a ; Wang et al, 2021 ), the resource cost ( Mahmud et al, 2020 ; Gao et al, 2019 ; Chen et al, 2019 ) or the profit ( Chen et al, 2020 ; Yuan & Zhou, in press ) for providing services in DE3C. These works were concerned on addressing only one or two sub-problems of task scheduling, e.g.…”
Section: Introductionmentioning
confidence: 99%
“…G. Zhang et al put forward a fog task offloading algorithm named DOTS to decrease latency with the help of the voluntary nodes (VNs) [28]. H. Apat et al proposed a three-layered priority-based fog task scheduling model to meet the different deadline requirement of tasks [29].…”
Section: Related Workmentioning
confidence: 99%
“…(1) Initialize random order set: a random order assignment vector x, velocity vector v and frequency of each order Γ, order signal strength G, order signal pulse rate z. In addition, I has a random variable η ∈ (0, 1); (2) Use formula (7) to calculate total energy cost ξ;…”
Section: Retrieval Efficiency Evaluationmentioning
confidence: 99%
“…It is better than retrieval based only on cloud services. erefore, fog computing based IoMT emerges [6][7][8][9].…”
Section: Introductionmentioning
confidence: 99%