{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T04:46:16Z","timestamp":1761108376642,"version":"build-2065373602"},"reference-count":52,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T00:00:00Z","timestamp":1638144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004530","name":"Universiti Putra Malaysia","doi-asserted-by":"publisher","award":["GP\/2020\/9693400"],"award-info":[{"award-number":["GP\/2020\/9693400"]}],"id":[{"id":"10.13039\/501100004530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>High-performance computing comprises thousands of processing powers in order to deliver higher performance computation than a typical desktop computer or workstation in order to solve large problems in science, engineering, or business. The scheduling of these machines has an important impact on their performance. HPC\u2019s job scheduling is intended to develop an operational strategy which utilises resources efficiently and avoids delays. An optimised schedule results in greater efficiency of the parallel machine. In addition, processes and network heterogeneity is another difficulty for the scheduling algorithm. Another problem for parallel job scheduling is user fairness. One of the issues in this field of study is providing a balanced schedule that enhances efficiency and user fairness. ROA-CONS is a new job scheduling method proposed in this paper. It describes a new scheduling approach, which is a combination of an updated conservative backfilling approach further optimised by the raccoon optimisation algorithm. This algorithm also proposes a technique of selection that combines job waiting and response time optimisation with user fairness. It contributes to the development of a symmetrical schedule that increases user satisfaction and performance. In comparison with other well-known job scheduling algorithms, the simulation assesses the effectiveness of the proposed method. The results demonstrate that the proposed strategy offers improved schedules that reduce the overall system\u2019s job waiting and response times.<\/jats:p>","DOI":"10.3390\/sym13122270","type":"journal-article","created":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T03:12:40Z","timestamp":1638328360000},"page":"2270","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["ROA-CONS: Raccoon Optimization for Job Scheduling"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7690-8950","authenticated-orcid":false,"given":"Sina Zangbari","family":"Koohi","sequence":"first","affiliation":[{"name":"Department of Communication Technology and Network, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8095-7678","authenticated-orcid":false,"given":"Nor Asilah Wati","family":"Abdul Hamid","sequence":"additional","affiliation":[{"name":"Department of Communication Technology and Network, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia"},{"name":"Laboratory of Computational Sciences and Mathematical Physics, Institute for Mathematical Research, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5124-5759","authenticated-orcid":false,"given":"Mohamed","family":"Othman","sequence":"additional","affiliation":[{"name":"Department of Communication Technology and Network, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia"},{"name":"Laboratory of Computational Sciences and Mathematical Physics, Institute for Mathematical Research, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4282-7482","authenticated-orcid":false,"given":"Gafurjan","family":"Ibragimov","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Universiti Putra Malaysia, Serdang 43400, Selangor, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,11,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Deveci, M., Kaya, K., U\u00e7ar, B., and \u00c7ataly\u00fcrek, \u00dc.V. (2015, January 25\u201329). Fast and high quality topology-aware task mapping. Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, Hyderabad, India.","DOI":"10.1109\/IPDPS.2015.93"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Amaral, M., Polo, J., Carrera, D., Seelam, S., and Steinder, M. (2017, January 12\u201317). Topology-aware gpu scheduling for learning workloads in cloud environments. Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, Denver, CO, USA.","DOI":"10.1145\/3126908.3126933"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Tuncer, O., Leung, V.J., and Coskun, A.K. (2015, January 8\u201311). Pacmap: Topology mapping of unstructured communication patterns onto non-contiguous allocations. Proceedings of the 29th ACM on International Conference on Supercomputing, Newport Beach, CA, USA.","DOI":"10.1145\/2751205.2751225"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1177\/1094342017727061","article-title":"Topology-aware job mapping","volume":"32","author":"Georgiou","year":"2018","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Wang, W., Dey, T., Mars, J., Tang, L., Davidson, J.W., and Soffa, M.L. (2012, January 1\u20133). Performance analysis of thread mappings with a holistic view of the hardware resources. Proceedings of the 2012 IEEE International Symposium on Performance Analysis of Systems & Software, New Brunswick, NJ, USA.","DOI":"10.1109\/ISPASS.2012.6189222"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1177\/1094342010371106","article-title":"Comparison of MPI benchmark programs on shared memory and distributed memory machines (point-to-point communication)","volume":"24","author":"Hamid","year":"2010","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Henderson, R.L. (1995). Job scheduling under the portable batch system. Workshop on Job Scheduling Strategies for Parallel Processing, Springer.","DOI":"10.1007\/3-540-60153-8_34"},{"key":"ref_8","first-page":"61","article-title":"Performance comparison of priority rule scheduling algorithms using different inter arrival time jobs in grid environment","volume":"4","author":"Azmi","year":"2011","journal-title":"Int. J. Grid Distrib. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Hovestadt, M., Kao, O., Keller, A., and Streit, A. (2003). Scheduling in HPC resource management systems: Queuing vs. planning. Workshop on Job Scheduling Strategies for Parallel Processing, Springer.","DOI":"10.1007\/10968987_1"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"158","DOI":"10.15837\/ijccc.2009.2.2423","article-title":"Task resource allocation in grid using swift scheduler","volume":"4","author":"Somasundaram","year":"2009","journal-title":"Int. J. Comput. Commun. Control"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.14257\/ijgdc.2015.8.4.17","article-title":"Load balancing scheduling with shortest load first","volume":"8","author":"Mondal","year":"2015","journal-title":"Int. J. Grid Distrib. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Oskooei, A.R., Mirza-Aghatabar, M., and Khorsandi, S. (2008, January 13\u201315). Introduction of novel rule based algorithms for scheduling in grid computing systems. Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS), Kuala Lumpur, Malaysia.","DOI":"10.1109\/AMS.2008.83"},{"key":"ref_13","unstructured":"Lifka, D.A. (1998). An Extensible Job Scheduling System for Massively Paralell Processor Architectures, Illinois Institute of Technology."},{"key":"ref_14","first-page":"218","article-title":"Task Scheduling Algorithms for Grid Computing with Static Jobs: A Review","volume":"2","author":"Singla","year":"2013","journal-title":"Int. J. Comput. Sci. Eng."},{"key":"ref_15","unstructured":"Vijayvargiya, P. (2019). A Comparative Study of CPU Scheduling Algorithms. arXiv."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1002\/atr.5670330307","article-title":"A schedule-based time-dependent trip assignment model for transit networks","volume":"33","author":"Tong","year":"1999","journal-title":"J. Adv. Transp."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Nuzzolo, A. (2002). Schedule-based transit assignment models. Advanced Modeling for Transit Operations and Service Planning, Elsevier Science New York.","DOI":"10.1108\/9780585475226-005"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1109\/71.932708","article-title":"Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling","volume":"12","author":"Feitelson","year":"2001","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TPDS.2005.18","article-title":"Experimental analysis of the root causes of performance evaluation results: A backfilling case study","volume":"16","author":"Feitelson","year":"2005","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Srinivasan, S., Kettimuthu, R., Subramani, V., and Sadayappan, P. (2002). Selective reservation strategies for backfill job scheduling. Workshop on Job Scheduling Strategies for Parallel Processing, Springer.","DOI":"10.1007\/3-540-36180-4_4"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Li, B., and Zhao, D. (2007, January 16\u201318). Performance impact of advance reservations from the grid on backfill algorithms. Proceedings of the Sixth International Conference on Grid and Cooperative Computing (GCC 2007), Xinjiang, China.","DOI":"10.1109\/GCC.2007.96"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.jpdc.2016.06.013","article-title":"Fattened backfilling: An improved strategy for job scheduling in parallel systems","volume":"97","year":"2016","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1019044623636","article-title":"Attacking the bottlenecks of backfilling schedulers","volume":"3","author":"Keleher","year":"2000","journal-title":"Clust. Comput."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Lifka, D.A. (1995). The anl\/ibm sp scheduling system. Workshop on Job Scheduling Strategies for Parallel Processing, Springer.","DOI":"10.1007\/3-540-60153-8_35"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Feitelson, D.G., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., and Wong, P. (1997). Theory and practice in parallel job scheduling. Workshop on Job Scheduling Strategies for Parallel Processing, Springer.","DOI":"10.1007\/3-540-63574-2"},{"key":"ref_26","unstructured":"Groves, T., Knockel, J., and Schulte, E. (2009). Bfs vs. Cfs Scheduler Comparison, The University of New Mexico."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Klus\u00e1cek, D., and Rudov\u00e1, H. (2012). Performance and fairness for users in parallel job scheduling. Workshop on Job Scheduling Strategies for Parallel Processing, Springer.","DOI":"10.1007\/978-3-642-35867-8_13"},{"key":"ref_28","unstructured":"Srinivasan, S., Kettimuthu, R., Subramani, V., and Sadayappan, P. (2002, January 21). Characterization of backfilling strategies for parallel job scheduling. Proceedings of the International Conference on Parallel Processing Workshop, Vancouver, BC, Canada."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Ngubiri, J. (2008). Techniques and Evaluation of Processor Co-Allocation in Multi-Cluster Systems. [Ph.D. Thesis, Department of Computer Science, Faculty of Computing and Information Technology, Makerere University].","DOI":"10.1007\/978-3-540-78699-3_2"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Frachtenberg, E., and Feitelson, D.G. (2005). Pitfalls in parallel job scheduling evaluation. Workshop on Job Scheduling Strategies for Parallel Processing, Springer.","DOI":"10.1007\/11605300_13"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Xhafa, F., Kolodziej, J., Barolli, L., and Fundo, A. (2011, January 7\u20139). A ga+ ts hybrid algorithm for independent batch scheduling in computational grids. Proceedings of the 2011 14th International Conference on Network-Based Information Systems, Tirana, Albania.","DOI":"10.1109\/NBiS.2011.41"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"2570","DOI":"10.1109\/TPDS.2020.2995867","article-title":"MEMPHA: Model of Exascale Message-Passing Programs on Heterogeneous Architectures","volume":"31","author":"Koohi","year":"2020","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_33","unstructured":"Koohi, S.Z., Hamid, N.A.W.A., Othman, M., and Ibragimov, G. (2021). HATS: Heterogeneity-Aware Task Scheduling. IEEE Trans. Cloud Comput., Unpublished."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"5383","DOI":"10.1109\/ACCESS.2018.2882568","article-title":"Raccoon optimization algorithm","volume":"7","author":"Koohi","year":"2018","journal-title":"IEEE Access"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"151279","DOI":"10.1109\/ACCESS.2020.2971650","article-title":"Integrated planning and scheduling of multiple manufacturing projects under resource constraints using raccoon family optimization algorithm","volume":"8","author":"Rauf","year":"2020","journal-title":"IEEE Access"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"10405","DOI":"10.1007\/s12652-020-02839-6","article-title":"Raccoon optimization algorithm-based accurate positioning scheme for reliable emergency data dissemination under NLOS situations in VANETs","volume":"12","author":"Balamurugan","year":"2021","journal-title":"J. Ambient Intell. Humaniz. Comput."},{"key":"ref_37","first-page":"337","article-title":"A comprehensive survey on the applications of swarm intelligence and bio-inspired evolutionary strategies","volume":"18","author":"Tzanetos","year":"2020","journal-title":"Mach. Learn. Paradig."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1111\/j.1467-8640.2010.00369.x","article-title":"Efficient grid scheduling through the incremental schedule-based approach","volume":"27","year":"2011","journal-title":"Comput. Intell."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Klus\u00e1\u010dek, D., Rudov\u00e1, H., Baraglia, R., Pasquali, M., and Capannini, G. (2008). Comparison of multi-criteria scheduling techniques. Grid Computing, Springer.","DOI":"10.1007\/978-0-387-09457-1_15"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Kleban, S.D., and Clearwater, S.H. (2003, January 12\u201315). Fair share on high performance computing systems: What does fair really mean?. Proceedings of the CCGrid 2003, 3rd IEEE\/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings, Tokyo, Japan.","DOI":"10.1109\/CCGRID.2003.1199363"},{"key":"ref_41","unstructured":"(2021, October 01). MetaCentrum National Grid Infrastructure. Available online: https:\/\/www.metacentrum.cz."},{"key":"ref_42","unstructured":"Wolberg, J. (2006). Data Analysis Using the Method of Least Squares: Extracting the Most Information from Experiments, Springer Science & Business Media."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1016\/j.future.2009.11.005","article-title":"Computational models and heuristic methods for Grid scheduling problems","volume":"26","author":"Xhafa","year":"2010","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1002\/cpe.710","article-title":"Gridsim: A toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing","volume":"14","author":"Buyya","year":"2002","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref_45","unstructured":"Zheng, G., Kakulapati, G., and Kal\u00e9, L.V. (, January 26\u201330). Bigsim: A parallel simulator for performance prediction of extremely large parallel machines. Proceedings of the 18th International Parallel and Distributed Processing Symposium, 2004, Proceedings, Santa Fe, NM, USA."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Obaida, M.A., and Liu, J. (2017, January 3\u20136). Simulation of HPC job scheduling and large-scale parallel workloads. Proceedings of the 2017 Winter Simulation Conference (WSC), Las Vegas, NV, USA.","DOI":"10.1109\/WSC.2017.8247843"},{"key":"ref_47","unstructured":"Sulistio, A., and Buyya, R. (2004, January 15\u201317). A grid simulation infrastructure supporting advance reservation. Proceedings of the 16th International Conference on Parallel and Distributed Computing and Systems (PDCS 2004), The Canterbury Hotel, San Francisco, CA, USA."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s11227-010-0402-6","article-title":"Enhanced GridSim architecture with load balancing","volume":"57","author":"Qureshi","year":"2011","journal-title":"J. Supercomput."},{"key":"ref_49","unstructured":"Chelladurai, S.R. (2017). Gridsim: A Flexible Simulator for Grid Integration Study. [Master\u2019s Thesis, Universidad of Northern British Colombia]."},{"key":"ref_50","unstructured":"Klus\u00e1\u010dek, D., T\u00f3th, \u0160., and Podoln\u00edkov\u00e1, G. (2016, January 22\u201323). Complex job scheduling simulations with Alea 4. Proceedings of the 9th EAI International Conference on Simulation Tools and Techniques. ICST (Institute for Computer Sciences, Social Informatics and Telecommunications Engineering), Prague, Czech Republic."},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Chapin, S.J., Cirne, W., Feitelson, D.G., Jones, J.P., Leutenegger, S.T., Schwiegelshohn, U., Smith, W., and Talby, D. (1999). Benchmarks and standards for the evaluation of parallel job schedulers. Workshop on Job Scheduling Strategies for Parallel Processing, Springer.","DOI":"10.1007\/3-540-47954-6_4"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"2967","DOI":"10.1016\/j.jpdc.2014.06.013","article-title":"Experience with using the parallel workloads archive","volume":"74","author":"Feitelson","year":"2014","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/12\/2270\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:37:11Z","timestamp":1760168231000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/12\/2270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,29]]},"references-count":52,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2021,12]]}},"alternative-id":["sym13122270"],"URL":"https:\/\/doi.org\/10.3390\/sym13122270","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2021,11,29]]}}}