Skip to main content
Springer Nature Link
Log in

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

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The rapid evolution of Internet of Things and cloud computing have endorsed a novel computing paradigm called edge computing. Here tasks are processed by edge devices before sent to the cloud to reduce the computational latency and overhead of cloud server. In edge computing efficient classification and distribution of the tasks among the constituent nodes is a challenging issue because of their resource limitedness and heterogeneity. In this paper a novel scheme named KTCS (K-means Clustering-based Task Classification and Scheduling) is proposed which classifies the task based on the type of resource requirement in terms of CPU, I/O, or COMM before distributed to the edge node. Using the K-means algorithm modeled with the M/M/c queuing theory, the proposed scheme efficiently schedules and assigns the task so that the utilization of the edge devices can be increased. The simulation result reveals that the proposed scheme significantly improves the performance of edge nodes in terms of task execution time and resource utilization.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Ullah, I., & Youn, H. Y. (2018). Statistical multipath queue-wise preemption routing for ZigBee-based WSN. Wireless Personal Communication,100(4), 1537–1551.

    Google Scholar 

  2. Furukawa, T. (2005). SOM of SOMs: Self-organizing map which maps a group of self-organizing maps (pp. 391–396). Springer.

  3. Chun, B.-G., Ihm, S., Maniatis, P., Naik, M., & Patti, A. (2011). Clonecloud: Elastic execution between mobile device and cloud (pp. 301–314). ACM.

  4. Barbera, M. V., Kosta, S., Mei, A., & Stefa, J. (2013). To offload or not to offload? The bandwidth and energy costs of mobile cloud computing (pp. 1285–1293). IEEE.

  5. Satyanarayanan, M., Simoens, P., Xiao, Y., Pillai, P., Chen, Z., Ha, K., et al. (2015). Edge analytics in the internet of things. IEEE Pervasive Computing,14(2), 24–31.

    Google Scholar 

  6. Garcia Lopez, P., Montresor, A., Epema, D., Datta, A., Higashino, T., Iamnitchi, A., et al. (2015). Edge-centric computing: Vision and challenges. ACM SIGCOMM Computer Communication Review,45(5), 37–42.

    Google Scholar 

  7. Luan, T. H., Gao, L., Li, Z., Xiang, Y., & Sun, L. (2015). Fog computing: Focusing on mobile users at the edge. ArXiv Preprint arXiv:1502.01815.

  8. Bonomi, F., Milito, R., Zhu, J., & Addepalli, S. (2012). Fog computing and its role in the internet of things (pp. 13–16). ACM.

  9. Ullah, I., & Youn, H. Y. (2019). A novel data aggregation scheme based on self-organized map for WSN. The Journal of Supercomputing, 75(7), 3975–3996.

    Google Scholar 

  10. Narman, H. S., Hossain, M. S., Atiquzzaman, & M., Shen, H. (2017). Scheduling internet of things applications in cloud computing. Annals of Telecommunications, 72(1–2), 79–93.

    Google Scholar 

  11. Orzechowski, P., Proficz, J., Krawczyk, H., & Szymański, J. (2017). Categorization of cloud workload types with clustering (pp. 303–313). Springer.

  12. Qureshi, K., Majeed, B., Kazmi, J. H., & Madani, S. A. (2012). Task partitioning, scheduling and load balancing strategy for mixed nature of tasks. The Journal of Supercomputing,59(3), 1348–1359.

    Google Scholar 

  13. Jyoti, A., & Shrimali, M. (2020). Dynamic provisioning of resources based on load balancing and service broker policy in cloud computing. Cluster Computing,23(1), 377–395.

    Google Scholar 

  14. Manukumar, S. T., & Muthuswamy, V. (2019). A novel multi-objective efficient offloading decision framework in cloud computing for mobile computing applications. Wireless Personal Communications,107(4), 1625–1642.

    Google Scholar 

  15. Van den Bossche, R., Vanmechelen, K., & Broeckhove, J. (2011). Cost-efficient scheduling heuristics for deadline constrained workloads on hybrid clouds (pp. 320–327). IEEE.

  16. Zeng, L., Veeravalli, B., Li, X. (2012). Scalestar: Budget conscious scheduling precedence-constrained many-task workflow applications in cloud (pp. 534–541). IEEE.

  17. Satyanarayanan, M., Bahl, P., Caceres, R., & Davies, N. (2009). The case for vm-based cloudlets in mobile computing. IEEE Pervasive Computing,8(4), 14–23.

    Google Scholar 

  18. Kosta, S., Aucinas, A., Hui, P., Mortier, R., & Zhang X. (2012). Thinkair: Dynamic resource allocation and parallel execution in the cloud for mobile code offloading (pp. 945–953). IEEE.

  19. Hao, F., Kodialam, M., Lakshman, T., & Mukherjee, S. (2016). Online allocation of virtual machines in a distributed cloud. IEEE/ACM Transactions on Networking,25(1), 238–249.

    Google Scholar 

  20. Chen, X., Jiao, L., Li, W., & Fu, X. (2016). Efficient multi-user computation offloading for mobile-edge cloud computing. IEEE/ACM Transactions on Networking,24(5), 2795–2808.

    Google Scholar 

  21. Tong, L., & Gao, W. (2016). Application-aware traffic scheduling for workload offloading in mobile clouds (pp. 1–9). IEEE.

  22. Jia, M., Liang, W., Xu, Z., & Huang, M. (2016). Cloudlet load balancing in wireless metropolitan area networks (pp. 1–9). IEEE.

  23. Tong, L., Li, Y., & Gao, W. (2016). A hierarchical edge cloud architecture for mobile computing (pp. 1–9). IEEE.

  24. Rasooli, A., & Down, D. G. (2014). COSHH: A classification and optimization based scheduler for heterogeneous Hadoop systems. Future Generation Computer Systems,36, 1–15.

    Google Scholar 

  25. Lu, P., Lee, Y. C., Wang, C., Zhou, B. B., Chen, J., & Zomaya, A. Y. (2012) Workload characteristic oriented scheduler for mapreduce (pp. 156–163). IEEE.

  26. Hu, W., Tian, C., Liu, X., Qi, H., Zha, L., Liao, H., et al. (2010). Multiple-job optimization in mapreduce for heterogeneous workloads (pp. 135–140). IEEE.

  27. Goswami V, Patra SS, Mund G. Performance analysis of cloud with queue-dependent virtual machines. In IEEE; 2012. p. 357–62.

  28. Ellens, W., Akkerboom, J., Litjens, R., & van den Berg, H. (2012) Performance of cloud computing centers with multiple priority classes (pp. 245–252). IEEE.

  29. Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002). An efficient k-means clustering algorithm: Analysis and implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence,24(7), 881–892.

    MATH  Google Scholar 

  30. k-means clustering—Wikipedia [Internet]. [cited 2017 Aug 5]. Retrieved from https://en.wikipedia.org/wiki/K-means_clustering.

  31. Euclidean distance—Wikipedia [Internet]. [cited 2017 Aug 5]. Retrieved from https://en.wikipedia.org/wiki/Euclidean_distance.

  32. Asmussen, S. (2008). Applied probability and queues (Vol. 51). Berlin: Springer.

    MATH  Google Scholar 

  33. Bakouch, H. S. (2011). Probability, Markov chains, queues, and simulation. J Appl Stat.,38(8), 1746–1746.

    MathSciNet  Google Scholar 

  34. Gross, D., & Harris, C. M. (1998). Fundamentals of queueing theory. New York: Wiley.

    MATH  Google Scholar 

  35. Calheiros, R. N., Ranjan, R., Beloglazov, A., De Rose, C. A., & Buyya, R. (2011). CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. Software: Practice and Experience,41(1), 23–50.

    Google Scholar 

  36. Xia, Y., Wang, L., Zhao, Q., & Zhang, G. (2011). Research on job scheduling algorithm in hadoop. Journal of Computational Information Systems,7(16), 5769–5775.

    Google Scholar 

  37. Fair Scheduler [Internet]. [cited 2015 Oct 1]. Retrieved from http://hadoop.apache.org/docs/r1.2.1/fair_scheduler.html.

Download references

Acknowledgements

This work was partly supported by Institute for Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIT) (No. 2016-0-00133, Research on Edge computing via collective intelligence of hyperconnection IoT nodes) Korea, under the National Program for Excellence in SW supervised by the IITP (Institute for Information & communications Technology Promotion) (2015-0-00914), Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2019R1I1A1A01058780, Efficient Management of SDN-based Wireless Sensor Network Using Machine Learning Technique) the second Brain Korea 21 PLUS project.

Author information

Authors and Affiliations

  1. Electrical and Computer Engineering, Sungkyunkwan University, Suwon, Korea

    Ihsan Ullah

  2. College of Software, Sungkyunkwan University, Suwon, Korea

    Hee Yong Youn

Authors
  1. Ihsan Ullah
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Hee Yong Youn
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Hee Yong Youn.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ullah, I., Youn, H.Y. Task Classification and Scheduling Based on K-Means Clustering for Edge Computing. Wireless Pers Commun 113, 2611–2624 (2020). https://doi.org/10.1007/s11277-020-07343-w

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-020-07343-w

Keywords