2020
DOI: 10.1007/s11277-020-07343-w
|View full text |Cite
|
Sign up to set email alerts
|

Task Classification and Scheduling Based on K-Means Clustering for Edge Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 33 publications
(19 citation statements)
references
References 28 publications
0
19
0
Order By: Relevance
“…The dependencies between tasks can be represented by a graph and, by following a fuzzy clustering [236], makespan (i.e., the time difference between the start and finish of tasks), monetary and energy costs can be minimized. The K-means clustering method [237] can provide efficient task scheduling, thus increasing the utilization of the Edge devices, based on the type of resource requirements in terms of CPU, I/O and communication. Lastly, a policy-based clustering approach [238] can provide energy efficient task offloading solutions, by organizing the interactions among the Edge nodes.…”
Section: Machine Learningmentioning
confidence: 99%
“…The dependencies between tasks can be represented by a graph and, by following a fuzzy clustering [236], makespan (i.e., the time difference between the start and finish of tasks), monetary and energy costs can be minimized. The K-means clustering method [237] can provide efficient task scheduling, thus increasing the utilization of the Edge devices, based on the type of resource requirements in terms of CPU, I/O and communication. Lastly, a policy-based clustering approach [238] can provide energy efficient task offloading solutions, by organizing the interactions among the Edge nodes.…”
Section: Machine Learningmentioning
confidence: 99%
“…Various authors published review papers [12][13][14][15][16] on task offloading in FC as a research direction. Many researchers use the queuing theory [17][18][19], game theory [20][21][22], dynamic programming and clustering techniques [18,23,24] to solve CO problems. It has been observed that each has separately investigated essential parameters, for example, delay, execution time, service time, communication cost, computational cost, quality of service and energy consumption etc.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Bashir et al [ 22 ] use logistic regression to calculate the load of each edge node and propose a dynamic resource allocation policy. Ullah et al [ 23 ] use K-means clustering approach to provide efficient task scheduling based on resource requirements in terms of CPU, I/O, and communication, thus improving the utilization of edge devices. To determine the combination of different devices and dynamic tasks, Rani et al [ 24 ] propose a deep learning model to address the speed, power, and security challenges, while meeting the QoS.…”
Section: Related Workmentioning
confidence: 99%