Task Scheduling for Task Processing Time Improvement and Its Implementation in Cluster-Based Heterogeneous Edge Computing System 


Vol. 50,  No. 1, pp. 185-194, Jan.  2025
10.7840/kics.2025.50.1.185


PDF Full-Text
  Abstract

In this paper, we propose the scheduling algorithm to improvement task processing speed in a heterogeneous edge computing system, where the devices have different resource capacities and computing capabilities. The proposed algorithm addresses performance limitations by enhancing the computing capabilities of edge devices, utilizing the scheduler to construct a computing cluster. In addition, the algorithm increases task processing speed by comprehensively considering the conditions of the edge devices and the task requests, which improves the time efficiency in processing multiple tasks. Our simulation results validate the superiority of the proposed algorithm and we validate its practical feasibility via a prototype.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Related Articles
  Cite this article

[IEEE Style]

S. Lee and S. H. Chae, "Task Scheduling for Task Processing Time Improvement and Its Implementation in Cluster-Based Heterogeneous Edge Computing System," The Journal of Korean Institute of Communications and Information Sciences, vol. 50, no. 1, pp. 185-194, 2025. DOI: 10.7840/kics.2025.50.1.185.

[ACM Style]

Sangcheol Lee and Seong Ho Chae. 2025. Task Scheduling for Task Processing Time Improvement and Its Implementation in Cluster-Based Heterogeneous Edge Computing System. The Journal of Korean Institute of Communications and Information Sciences, 50, 1, (2025), 185-194. DOI: 10.7840/kics.2025.50.1.185.

[KICS Style]

Sangcheol Lee and Seong Ho Chae, "Task Scheduling for Task Processing Time Improvement and Its Implementation in Cluster-Based Heterogeneous Edge Computing System," The Journal of Korean Institute of Communications and Information Sciences, vol. 50, no. 1, pp. 185-194, 1. 2025. (https://doi.org/10.7840/kics.2025.50.1.185)
Vol. 50, No. 1 Index