Revitalizing the single batch environment: a ‘Quest’ to achieve fairness and efficiency

References

• Silberschatz A, Galvin PB, Gagne G. Operating system concepts, windows XP update. John Wiley & Sons; 2006.
   Google Scholar
• Harki N, Ahmed A, Haji L. Cpu scheduling techniques: a review on novel approaches strategy and performance assessment. J Appl Sci Technol Trends. 2020;1(2):48–55. doi: 10.38094/jastt1215
   Google Scholar
• Ajtai M, Aspnes J, Naor M, et al. Fairness in scheduling. J Algorithm. 1998;29(2):306–357. doi: 10.1006/jagm.1998.0953
   Web of Science ®Google Scholar
• Wierman A. Fairness and scheduling in single server queues. Surv Oper Res Manag Sci. 2011;16(1):39–48.
   Google Scholar
• Reuther A, Byun C, Arcand W, et al. Scalable system scheduling for hpc and big data. J Parallel Distrib Comput. 2018;111:76–92. doi: 10.1016/j.jpdc.2017.06.009
   Web of Science ®Google Scholar
• Prabhakaran S, Iqbal M, Rinke S, et al. A batch system with fair scheduling for evolving applications. In: 2014 43rd International Conference on Parallel Processing. IEEE; 2014. p. 351–360.
   Google Scholar
• Robert J, Schabanel N. Non-clairvoyant batch sets scheduling: fairness is fair enough. In: European Symposium on Algorithms. Springer; 2007. p. 741–753.
   Google Scholar
• Zhang S, Li W, Wang C, et al. Dybatch: efficient batching and fair scheduling for deep learning inference on time-sharing devices. In: 2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID). IEEE; 2020. p. 609–618.
   Google Scholar
• Ji L, Arvanitis T, Woolley S. Fair weighted round robin scheduling scheme for diffserv networks. Electron Lett. 2003;39(3):1. doi: 10.1049/el:20030209
   Web of Science ®Google Scholar
• Thiele D, Diemer J, Axer P, et al. Improved formal worst-case timing analysis of weighted round robin scheduling for ethernet. In: 2013 International Conference on Hardware/Software Codesign and System Synthesis (CODES+ ISSS). IEEE; 2013. p. 1–10.
   Google Scholar
• Negi A, Kumar PK. Applying machine learning techniques to improve linux process scheduling. In: TENCON 2005-2005 IEEE Region 10 Conference. IEEE; 2005. p. 1–6.
   Google Scholar
• Hicham GT, Chaker EA, Lotfi E. Comparative study of neural networks algorithms for cloud computing cpu scheduling. Int J Electr Comput Eng. 2017;7(6):3570.
   Google Scholar
• Tehsin S, Asfia Y, Akbar N, et al. Selection of cpu scheduling dynamically through machine learning. In: Pattern recognition and tracking XXXI. Vol. 11400. SPIE; 2020. p. 67–72.
   Google Scholar
• Lee H, Lee J, Yeom I, et al. Panda: reinforcement learning-based priority assignment for multi-processor real-time scheduling. IEEE Access. 2020;8:185570–185583. doi: 10.1109/Access.6287639
   Web of Science ®Google Scholar
• Fan Y, Lan Z. Dras-cqsim: a reinforcement learning based framework for hpc cluster scheduling. Softw Impacts. 2021;8:100077. doi: 10.1016/j.simpa.2021.100077
   Google Scholar
• Alam B, Doja M, Biswas R. Finding time quantum of round robin cpu scheduling algorithm using fuzzy logic. In: 2008 International Conference on Computer and Electrical Engineering. IEEE; 2008. p. 795–798.
   Google Scholar
• Butt MA, Akram M. A novel fuzzy decision-making system for cpu scheduling algorithm. Neural Comput Appl. 2016;27:1927–1939. doi: 10.1007/s00521-015-1987-8
   Web of Science ®Google Scholar
• Alam B. Fuzzy round robin cpu scheduling algorithm. J Comput Sci. 2013;9(8):1079–1085. doi: 10.3844/jcssp.2013.1079.1085
   Google Scholar
• FLEMING'S GA. The new method of adaptive cpu scheduling using fonseca and fleming's genetic algorithm. J Theor Appl Inf Technol. 2012;37(1):1–16.
   Google Scholar
• Rajaei H, Dadfar M. Comparison of backfilling algorithms for job scheduling in distributed memory parallel system. In: 2006 Annual Conference & Exposition. 2006. p. 11–339.
   Google Scholar
• Kay J, Lauder P. A fair share scheduler. Commun ACM. 1988;31(1):44–55. doi: 10.1145/35043.35047
   Web of Science ®Google Scholar
• Moschakis IA, Karatza HD. Evaluation of gang scheduling performance and cost in a cloud computing system. J Supercomput. 2012;59:975–992. doi: 10.1007/s11227-010-0481-4
   Web of Science ®Google Scholar
• Srinivasan A, Baruah S. Deadline-based scheduling of periodic task systems on multiprocessors. Inf Process Lett. 2002;84(2):93–98. doi: 10.1016/S0020-0190(02)00231-4
   Web of Science ®Google Scholar
• Feng Z, Dawande M, Janakiraman G. On the capacity of a process with batch processing and setup times. Prod Oper Manag. 2021;30(11):4273–4287. doi: 10.1111/poms.13522
   Web of Science ®Google Scholar
• Toksarı MD, Toğa G. Single batch processing machine scheduling with sequence-dependent setup times and multi-material parts in additive manufacturing. CIRP J Manuf Sci Technol. 2022;37:302–311. doi: 10.1016/j.cirpj.2022.02.007
   Web of Science ®Google Scholar
• Chen W-J. Minimizing number of tardy jobs on a single machine subject to periodic maintenance. Omega. 2009;37(3):591–599. doi: 10.1016/j.omega.2008.01.001
   Web of Science ®Google Scholar
• Hoogeveen J. Minimizing maximum promptness and maximum lateness on a single machine. Math Oper Res. 1996;21(1):100–114. doi: 10.1287/moor.21.1.100
   Web of Science ®Google Scholar
• Reza Hejazi* S, Saghafian S. Flowshop-scheduling problems with makespan criterion: a review. Int J Prod Res. 2005;43(14):2895–2929. doi: 10.1080/0020754050056417
   Web of Science ®Google Scholar
• Gardner K, Harchol-Balter M, Hyytiä E, et al. Scheduling for efficiency and fairness in systems with redundancy. Perform Eval. 2017;116:1–25. doi: 10.1016/j.peva.2017.07.001
   Web of Science ®Google Scholar
• Conway RW. Theory of scheduling. Addison Wesley; 1967.
   Google Scholar
• Smith DR. A new proof of the optimality of the shortest remaining processing time discipline. Oper Res. 1978;26(1):197–199. doi: 10.1287/opre.26.1.197
   Web of Science ®Google Scholar
• Mora H, Abdullahi SE, Junaidu SB. Modified median round robin algorithm (mmrra). In: 2017 13th International Conference on Electronics, Computer and Computation (ICECCO). IEEE; 2017. p. 1–7.
   Google Scholar
• Shyam R, Nandal SK. Improved mean round robin with shortest job first scheduling. Int J Adv Res Comput Sci Softw Eng. 2014;4(7):170–179.
   Google Scholar
• Hyytiä E, Aalto S. On round-robin routing with fcfs and lcfs scheduling. Perform Eval. 2016;97:83–103. doi: 10.1016/j.peva.2016.01.002
   Web of Science ®Google Scholar
• Xiuqin L, Luoheng Y, Julong L. A diffserv supporting and distributed dynamic dual round robin scheduling algorithm on ds-cicq. Phys Procedia. 2012;33:804–810. doi: 10.1016/j.phpro.2012.05.138
   Google Scholar
• Banerjee P, Banerjee P, Dhal SS. Comparative performance analysis of average max round robin scheduling algorithm (amrr) using dynamic time quantum with round robin scheduling algorithm using static time quantum. Int J Innov Technol Explor Eng (IJITEE). 2012;1(3):56–62.
   Google Scholar
• Mishra MK, Rashid F. An improved round robin cpu scheduling algorithm with varying time quantum. Int J Comput Sci Eng Appl (IJCSEA). 2014;4(4):1–8.
   Google Scholar
• Sharma C, Sharma S, Kautish S, et al. A new median-average round robin scheduling algorithm: an optimal approach for reducing turnaround and waiting time. Alex Eng J. 2022;61(12):10527–10538. doi: 10.1016/j.aej.2022.04.006
   Web of Science ®Google Scholar
• Ostle B. Statistics in research. 2nd ed. 1963.
   Google Scholar
• Duhan N, Sharma AK, Bhatia KK. Page ranking algorithms: a survey. In: 2009 IEEE International Advance Computing Conference; 2009. p. 1530–1537. doi: 10.1109/IADCC.2009.4809246
   Google Scholar
• Mishra A, Ahmed AO. Simulation of cpu scheduling algorithms using poisson distribution. Int J Wirel Microw Technol. 2020;6(2):71–78.
   Google Scholar
• Grosof I, Yang K, Scully Z, et al. Nudge: stochastically improving upon FCFS. Proc ACM Meas Anal Comput Syst. 2021;5(2):1–29. doi: 10.1145/3460088
   Google Scholar
• Krzyzanowski P. Process scheduling; 2015. Information on http://www.cs.rutgers.edu/pxk/416/notes/07-scheduling.html
   Google Scholar
• CFS scheduler — The Linux Kernel documentation – docs.kernel.org. https://docs.kernel.org/scheduler/sched-design-CFS.html. [accessed 2024 April 09].
   Google Scholar
• Li T, Baumberger D, Hahn S. Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin. ACM Sigplan Not. 2009;44(4):65–74. doi: 10.1145/1594835.1504188
   Google Scholar
• Nagle J. On packet switches with infinite storage. IEEE Trans Commun. 1987;35(4):435–438. doi: 10.1109/TCOM.1987.1096782
   Web of Science ®Google Scholar
• Waldspurger CA. Lottery and stride scheduling: flexible proportional-share resource management [PhD thesis]. Massachusetts Institute of Technology; 1995.
   Google Scholar
• Abedin J, Mittal HV. R graphs cookbook. 2nd ed. Packt Publishing Ltd; 2014.
   Google Scholar
• Frigge M, Hoaglin DC, Iglewicz B. Some implementations of the boxplot. Am Stat. 1989;43(1):50–54. doi: 10.1080/00031305.1989.10475612
   Web of Science ®Google Scholar