[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Advertisement

Springer Nature Link
Log in

Multiprocessor Task Scheduling Optimization for Cyber-Physical System Using an Improved Salp Swarm Optimization Algorithm

  • Original Research
  • Published:
SN Computer Science Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Salp Swarm Algorithm (SSA) is a bio-inspired optimization algorithm used in this paper to optimize the multiprocessor scheduling process in the current cyber-physical system. Although SSA is mainly utilized in terms of local search, in our case, an improved version has been introduced with the use of a Local Search Algorithm (LSA) and binary SSA, namely Improved SSA (ISSA). More to the point, eight optimization algorithms are compared with this proposed ISSA namely SSA, Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Grey Wolf Optimizer (GWO), Jaya Algorithm (JAYA), Chaotic Squirrel Search Algorithm (CSSA), Quantum-inspired Binary Chaotic Salp Swarm Algorithm (QBCSSA) and Space Transformation Search (STS) with SSA is termed as STS-SSA. The performance of ISSA along with the other 6 meta-heuristic and 2 improved versions of SSA algorithms are compared with 12 traditional benchmark functions and evaluated for 100 and 300 dimensions. Convergent curves have also been demonstrated and the proposed ISSA has been shown to find a global optimum within the very initial phase of iterations. For calculating the efficiency of the proposed algorithm, the gear train design problem has been employed. The proposed algorithm has demonstrated higher accuracy rates and better convergent values than the other applied algorithms.

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
£29.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 includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Data availability

The datasets used in this study during experiments available at http://www.kasahara.cs.waseda.ac.jp/schedule/stgarc_e.html#nocomm.

References

  1. Padmajothi V, Iqbal JM, Ponnusamy V. Load-aware intelligent multiprocessor scheduler for time-critical cyber-physical system applications. Comput Electr Eng. 2022;97:107613.

    Article  Google Scholar 

  2. Gong M, Chen Z-Z, Lin G. Randomized algorithms for fully online multiprocessor scheduling with testing. 2023. arXiv preprint. arXiv:2305.01605.

  3. Lotfi N, Ghadiri Nejad M. A new hybrid algorithm based on improved mode and pf neighborhood search for scheduling task graphs in heterogeneous distributed systems. Appl Sci. 2023;13(14):8537.

    Article  Google Scholar 

  4. Acharya B, Panda S, Sivakumar E. An analytical study of multiprocessor scheduling using metaheuristic approach. SN Comput Sci. 2022;3(6):497.

    Article  Google Scholar 

  5. Acharya, B., & Panda, S. (2022). GA–JAYA: a novel hybridization technique to solving job scheduling problems. In Proceedings of Data Analytics and Management: ICDAM 2021, Volume 1 (pp. 221–230). Singapore: Springer Nature Singapore.

  6. Chandak, A., & Ray, N. K. (2019, December). A review of load balancing in fog computing. In 2019 International Conference on Information Technology (ICIT) (pp. 460–465). IEEE.

  7. Dhodhi MK, Ahmad I, Yatama A, Ahmad I. An integrated technique for task matching and scheduling onto distributed heterogeneous computing systems. J Parallel Distrib Comput. 2002;62(9):1338–61.

    Article  Google Scholar 

  8. Yi N, Xu J, Yan L, Huang L. Task optimization and scheduling of distributed cyber-physical system based on improved ant colony algorithm. Future Gener Comput Syst. 2020;109:134–48.

    Article  Google Scholar 

  9. Fang, J., Wang, M., Gao, M., & Wei, J. (2017, November). A task allocation method for heterogeneous multi-core system based on genetic algorithm. In 2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS) (pp. 199–202). IEEE.

  10. Yska D, Mei Y, Zhang M. Genetic programming hyper-heuristic with cooperative coevolution for dynamic flexible job shop scheduling. In: Genetic programming: 21st European conference, EuroGP 2018, Parma, Italy, April 4–6, 2018, proceedings 21; 2018. Berlin: Springer. p. 306–21.

  11. Priya A, Sahana SK. A survey on multiprocessor scheduling using evolutionary technique. In: Nanoelectronics, circuits and communication systems: proceeding of NCCS 2017; 2019. Berlin: Springer. p. 149–60.

  12. Xu Y, Wang L. Differential evolution algorithm for hybrid flow-shop scheduling problems. J Syst Eng Electron. 2011;22(5):794–8.

    Article  Google Scholar 

  13. Thanushkodi K, Deeba K. On performance analysis of hybrid algorithm (improved PSO with simulated annealing) with GA, PSO for multiprocessor job scheduling. WSEAS Trans Comput. 2011;10(9):287–300.

    Google Scholar 

  14. Ying K-C, Lin S-W. Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks. Expert Syst Appl. 2018;92:132–41.

    Article  Google Scholar 

  15. Konar D, Bhattacharyya S, Sharma K, Sharma S, Pradhan SR. An improved hybrid quantum-inspired genetic algorithm (HQIGA) for scheduling of real-time task in multiprocessor system. Appl Soft Comput. 2017;53:296–307.

    Article  Google Scholar 

  16. Liu, Y., Li, Y., Zhao, Y., & Chen, X. (2016, August). A scheduling algorithm in the randomly heterogeneous multi-core processor. In 2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) (pp. 2140–2146). IEEE.

  17. Gholami H, Sun H. Toward automated algorithm configuration for distributed hybrid flow shop scheduling with multiprocessor tasks. Knowl Based Syst. 2023;264:110309.

    Article  Google Scholar 

  18. Agarwal G, Gupta S, Ahuja R, Rai AK. Multiprocessor task scheduling using multi-objective hybrid genetic algorithm in fog-cloud computing. Knowl Based Syst. 2023;272:110563.

    Article  Google Scholar 

  19. Madhura R, Elizabeth BL, Uthariaraj VR. An improved list-based task scheduling algorithm for fog computing environment. Computing. 2021;103:1353–89.

    Article  MathSciNet  Google Scholar 

  20. Wang H, Sinnen O. List-scheduling versus cluster-scheduling. IEEE Trans Parallel Distrib Syst. 2018;29(8):1736–49.

    Article  Google Scholar 

  21. Nayak SK, Panda CS, Padhy SK. Efficient multiprocessor scheduling using water cycle algorithm. Soft Comput Appl. 2018;131–47. https://doi.org/10.1007/978-981-10-8049-4.

  22. Tripathy B, Dash S, Padhy SK. Dynamic task scheduling using a directed neural network. J Parallel Distrib Comput. 2015;75:101–6.

    Article  Google Scholar 

  23. Rani R, Garg R. Power and temperature-aware workflow scheduling considering deadline constraint in cloud. Arab J Sci Eng. 2020;45:10775–91.

    Article  Google Scholar 

  24. Acharya, B., & Panda, S. (2021, May). Modified SSA for solving multiprocessor scheduling problems. In 2021 5th International Conference on Intelligent Computing and Control Systems (ICICCS) (pp. 1075–1080). IEEE.

  25. Mirjalili S, Gandomi AH, Mirjalili SZ, Saremi S, Faris H, Mirjalili SM. Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw. 2017;114:163–91.

    Article  Google Scholar 

  26. Panda N, Majhi SK. Improved salp swarm algorithm with space transformation search for training neural network. Arab J Sci Eng. 2020;45(4):2743–61.

    Article  Google Scholar 

  27. Su P-C, Tan S-Y, Liu Z, Yeh W-C. A mixed-heuristic quantum-inspired simplified swarm optimization algorithm for scheduling of real-time tasks in the multiprocessor system. Appl Soft Comput. 2022;131:109807.

    Article  Google Scholar 

  28. Lai C-M, Yeh W-C, Huang Y-C. Entropic simplified swarm optimization for the task assignment problem. Appl Soft Comput. 2017;58:115–27.

    Article  Google Scholar 

  29. Boveiri HR. An enhanced cuckoo optimization algorithm for task graph scheduling in cluster-computing systems. Soft Comput. 2020;24(13):10075–93.

    Article  Google Scholar 

  30. Prasanna Kumar K, Kousalya K. Amelioration of task scheduling in cloud computing using crow search algorithm. Neural Comput Appl. 2020;32:5901–7.

    Article  Google Scholar 

  31. Yang Z, Liu C. A hybrid multi-objective gray wolf optimization algorithm for a fuzzy blocking flow shop scheduling problem. Adv Mech Eng. 2018;10(3):1–13.

    Article  Google Scholar 

  32. Eesa AS, Orman Z. A new clustering method based on the bio-inspired cuttlefish optimization algorithm. Expert Syst. 2020;37(2):12478.

    Article  Google Scholar 

  33. Ortiz M.D.G.C., Perez P.F., Pablo R.A. Multi-objective optimization using bat algorithm to solve multiprocessor scheduling and workload allocation problem. Comput Sci Inf Syst. 2015;2(2):41–51.

    Google Scholar 

  34. Deng Z, Cao D, Shen H, Yan Z, Huang H. Reliability-aware task scheduling for energy efficiency on heterogeneous multiprocessor systems. J Supercomput. 2021;77:11643–81.

    Article  Google Scholar 

  35. Bouzidi A, Riffi ME, Barkatou M. The metaheuristics to solve the flow-shop scheduling problem: a comparative study. J Netw Innov Comput. 2016;4:020–8.

    Google Scholar 

  36. Zandvakili A, Mansouri N, Javidi MM. Signature goa: a novel comfort zone parameter adjustment using fuzzy signature for task scheduling in cloud environment. J Algorithms Comput. 2021;53(1):61–95.

    Google Scholar 

  37. Mokhtari H. A nature inspired intelligent water drops evolutionary algorithm for parallel processor scheduling with rejection. Appl Soft Comput. 2015;26:166–79.

    Article  Google Scholar 

  38. Salehan A, Deldari H, Abrishami S. Performance evaluation of two new lightweight real-time scheduling mechanisms for ubiquitous and mobile computing environments. Arab J Sci Eng. 2019;44(4):3083–99.

    Article  Google Scholar 

  39. Mishra K, Pradhan R, Majhi SK. Quantum-inspired binary chaotic salp swarm algorithm (QBCSSA)-based dynamic task scheduling for multiprocessor cloud computing systems. J Supercomput. 2021;77:10377–423.

    Article  Google Scholar 

  40. Fan J, Shen W, Gao L, Zhang C, Zhang Z. A hybrid Jaya algorithm for solving flexible job shop scheduling problem considering multiple critical paths. J Manuf Syst. 2021;60:298–311.

    Article  Google Scholar 

  41. Sanaj M, Prathap PJ. Nature inspired chaotic squirrel search algorithm (CSSA) for multi objective task scheduling in an IAAS cloud computing atmosphere. Eng Sci Technol Int J. 2020;23(4):891–902.

    Google Scholar 

Download references

Author information

Author notes

  1. Sucheta Panda and Niranjan K. Ray contributed equally to this work.

Authors and Affiliations

  1. Department of Computer Application, Veer Surendra Sai University of Technology, Burla, Sambalpur, Odisha, 768018, India

    Biswaranjan Acharya & Sucheta Panda

  2. School of Computer Engineering, KIIT Deemed to be University, Bhubaneswar, Odisha, 751024, India

    Niranjan K. Ray

Authors
  1. Biswaranjan Acharya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sucheta Panda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Niranjan K. Ray
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Biswaranjan Acharya.

Ethics declarations

Conflict of interest

The authors have no conflicts of interest to declare that are relevant to the content of this article.

Additional information

Publisher's Note

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

This article is part of the topical collection “Innovation in Smart Things: A Systems, Security, and AI Perspective” guest edited by Niranjan K Ray, Prasanth Yanambaka and Rakesh Balabantaray.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Acharya, B., Panda, S. & Ray, N.K. Multiprocessor Task Scheduling Optimization for Cyber-Physical System Using an Improved Salp Swarm Optimization Algorithm. SN COMPUT. SCI. 5, 184 (2024). https://doi.org/10.1007/s42979-023-02517-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s42979-023-02517-2

Keywords

Search

Navigation