TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Operating system security with discrete mathematical structure for secure round robin scheduling method with intelligent time quantum

, * , , ,

* Corresponding author · click or hover a name for details

pp. 1519–1533Vol. 26Issue 5August 2023DOI: 10.47974/JDMSC-1816 Crossmark XML
Published Online:
09 Sep 2023
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-1816
Pages:
1519–1533

Abstract

These days, the problems of scheduling and security are increasingly pressing as a result of the rapidly growing number of implementations that are operated in operating systems. Process scheduling and scheduling security is the most effective methodology of operating a system which can improve and degrade the performance of the computer system. The performance of scheduling algorithm in operating system can be measured by scheduling principles like average waiting time, average turnaround time, response time, throughput etc. Much research carried out over operating system security and round robin scheduling used in time sharing operating system in previous years to resolve the issues regarding to improvement in the performance of round robin (RR) scheduling and improving the security in the scheduling approach. This study discussed the security issues in operating systems, scheduling security and discrete structure of a new approach for RR scheduling. The researcher has suggested a list of policy for scheduling method security and proposed a new approach for RR scheduling and investigated the scheduling principles. The proposed methodology covers distinctive strategy for selection manner of process from ready queue than RR and used diverges time quantum. The proposed methodology has been validated experimentally by comparing with a numerous scheduling algorithm namely as Round Robin (RR), Adaptive Round Robin (ARR), Round Robin Remaining time (RRRT), improved Round Robin (IRR), an additional improvement on the improved Round Robin (AAAIRR), and an Enhanced Round Robin (ERR). Numerous simulations have been conducted to validate the effectiveness of the proposed algorithm to compelling the performance of system. At the conclusion the performance of computing system is dependent on security of operating system as well as secluding methods.

Keywords

Subject Classifications

68M2568N25

References

[1] Chandiramani, K.; Verma, R.; Sivagami, M. A Modified Priority Preemptive Algorithm for CPU Scheduling. Procedia Comput. Sci.,  165, 363–369 (2019). 
[2] Silberschatz, A.; Galvin, P.B.; Gagne, G. Operating System Concepts, 10th ed.; Wiley Publ.: Hoboken, NJ, USA (2018). 
[3] Sunil, J.G.; Anisha Gnana, V.T.; Karthija, V. Fundamentals of Operating Systems Concepts; Lambert Academic Publications: Saarbrucken, Germany (2018). 
[4] Shafi, U.; Shah, M.; Wahid, A.; Abbasi, K.; Javaid, Q.; Asghar, M.; Haider, M. A Novel Amended Dynamic Round Robin Scheduling Algorithm for Timeshared Systems. Int. Arab. J. Inf. Technol., 17, 90–98 (2019). 
[5] Tajwar, M.M.; Pathan, N.; Hussaini, L.; Abubakar, A. CPU Scheduling with a Round Robin Algorithm Based on an Effective Time Slice. J. Inf. Process. Syst., 13, 941–950 (2017).
[6] Mostafa, S.M.; Rida, S.Z.; Hamad, S.H. Finding Time Quantum of Round Robin CPU Scheduling Algorithm in General Computing Systems Using Integer Programming. Int. J. New Comput. Archit. Appl., 5, 64–71 (2010). 
[7] Zouaoui, S., Boussaid, L., & Mtibaa, A. Improved time quantum length estimation for round robin scheduling algorithm using neural network. Indonesian Journal of Electrical Engineering and Informatics (IJEEI), 7(2), 190–202 (2019). https://doi.org/10.11591/ijeei.v7i2.464.
[8] Pandey, A., Singh, P., Gebreegziabher, N. H., & Kemal, A. Chronically Evaluated Highest Instantaneous Priority Next: A Novel Algorithm for Processor Scheduling. Journal of Computer and Communications, 04(04), 146–159 (2016). https://doi.org/10.4236/jcc.2016.44013.
[9] Nie, B., Du, J., Xu, G., Liu, H., Yu, R., & Wen, Q. (n.d.). A New Operating System Scheduling Algorithm. 5.
[10] Mostafa, S. M., & Amano, H. Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique. Applied Sciences, 10(15), 5134 (2020). https://doi.org/10.3390/app10155134.
[11] Mostafa, S., & Amano, H. An Adjustable Round Robin Scheduling Algorithm in Interactive Systems. Information Engineering Express, 5(1), 11–18 (2019). https://doi.org/10.52731/iee.v5.i1.353.
[12] Gull, H., Iqbal, S. Z., Saeed, S., Alqatani, M. A., & Bamarouf, Y.  Design and Evaluation of CPU Scheduling Algorithms Based on Relative Time Quantum: Variations of Round Robin Algorithm. Journal of Computational and Theoretical Nanoscience, 15(8), 2483–2488 (2018). https://doi.org/10.1166/jctn.2018.7524.
[13] Gibet Tani, H., & El Amrani, C. Smarter Round Robin Scheduling Algorithm for Cloud Computing and Big Data. Journal of Data Mining & Digital Humanities, Special Issue on Scientific..., 3104 (2018). https://doi.org/10.46298/jdmdh.3104.
[14] Gibet Tani, H., & El Amrani, C. Cloud Computing CPU Allocation and Scheduling Algorithms using CloudSim Simulator. International Journal of Electrical and Computer Engineering (IJECE), 6(4), 1866 (2016). https://doi.org/10.11591/ijece.v6i4.10144.
[15] Elmougy, S., Sarhan, S., & Joundy, M. A novel hybrid of Shortest job first and round Robin with dynamic variable quantum time task scheduling technique. Journal of Cloud Computing, 6(1), 12 (2017). https://doi.org/10.1186/s13677-017-0085-0
[16] Lipika Datta,”Efficient Round Robin Scheduling Algorithm with Dynamic Time Slice”, IJEME, vol.5, no.2, pp.10-19 (2015). DOI: 10.5815/ijeme.2015.02.02. 
[17] Chandiramani, K., Verma, R., & Sivagami, M. A Modified Priority Preemptive Algorithm for CPU Scheduling. Procedia Computer Science, 165(2019), 363–369 (2019). https://doi.org/10.1016/j.procs.2020.01.037.
[18] Ali, S. M., Alshahrani, R. F., Hadadi, A. H., Alghamdi, T. A., Almuhsin, F. H., & El-Sharawy, E. E. A Review on the CPU Scheduling Algorithms: Comparative Study. International Journal of Computer Science and Network Security, 21(1), 19–26 (2021). https://doi.org/10.22937/IJCSNS.2021.21.1.4
[19] Abdullahi, I., & B Junaidu, S. Empirical Framework to Mitigate Problems in Longer Job First Scheduling Algorithm LJF+CBT. International Journal of Computer Applications, 75(14), 9–14 (2013). https://doi.org/10.5120/13178-0763.
[20] Abdulrahim, A., E. Abdullahi, S., & B. Sahalu, J. A New Improved Round Robin (NIRR) CPU Scheduling Algorithm. International Journal of Computer Applications, 90(4), 27–33 (2014). https://doi.org/10.5120/15563-4277.
[21] ElDahshan, K., Elkader, A. A., & Ghazy, N. Round Robin based Scheduling Algorithms, A Comparative Study. 17(2), 14 (2017).
[22] Kumar Mishra, M., & Rashid, F. An Improved Round Robin CPU Scheduling Algorithm with Varying Time Quantum. International Journal of Computer Science, Engineering and Applications, 4(4), 1–8 (2014). https://doi.org/10.5121/ijcsea.2014.4401.
[23] Khatri, J. An Enhanced Round Robin CPU Scheduling Algorithm. IOSR Journal of Computer Engineering, 18(04), 20–24 (2016). https://doi.org/10.9790/0661-1804022024.
[24] Hiranwal, S., & Roy, D. K. C. Adaptive Round Robin Scheduling using Shortest Burst Approach Based on Smart Time Slice. 2(2), 5 (2011).
[25] Sharma, Kakhani, A., Gaurav. Analysis of Adaptive Round Robin Algorithm and Proposed Round Robin Remaining Time Algorithm. International Journal of Computer Science and Mobile Computing (2015).
[26] Cui-Qing Yang, Operating System Security and Secure Operating Systems Version 1.4b, , GIAC practical repository, Option 1 for GSEC January 2003, SANS Institute 2003, Operating System Security and Secure Operating Systems (giac.org) (2003).
[27] DOD 5200.28-STD, “DOD Trusted Computer System Evaluation Criteria” (Orange Book), 26 December 1985, http://www.radium.ncsc.mil/tpep/library/rainbow/5200.28-STD.pdf.
[28] Chris Dalton and Tse Huong Choo, “An Operating System Approach to Securing E-Services”, Communications of the ACM, V. 44, No. 2, p. 58 (2001).
[30] Ipsita Vashista, Harsha Suri, Disha Papneja, Operating Systems Security – A Review, IJIRT | Volume 1 Issue 5 (2014). ISSN : 2349-6002, IJIRT100350_PAPER.pdf.
[31] Amit Kumar Gupta, Pushpa Gothwal, Dinesh Goyal & Carlos M. Travieso-Gonzalez. IoT-Galvanized pandemic special E-Toilet for generation of sanitized environment, Journal of Discrete Mathematical Sciences and Cryptography (2022), DOI: 10.1080/09720529.2022.2068607.
[32] Amit Kumar Gupta, Vijander Singh, Priya Mathur & Carlos M. Travieso-Gonzalez. Prediction of COVID-19 pandemic measuring criteria using support vector machine, prophet and linear regression models in Indian scenario, Journal of Interdisciplinary Mathematics (2020), DOI:https://doi.org/10.1080/09720502.2020.1833458.
[33] Jitendra Singh Yadav, Amit Kumar Gupta & Arjit Saxena. A review on gender identification using machine learning based on fingerprints, Journal of Information and Optimization Sciences, 40:5, 1121-1129 (2019), DOI: https://doi.org/10.1080/02522667.2019.1638002.
[34] Neetu Goel, Dr. Abhinav Saxena, Dr. R. B. Garg, An Optimal Mathematical Approach for CPU Scheduling – OMDRRS vs. RR, International Journal of Computational and Applied Mathematics. ISSN 1819-4966 Volume 12, Number 1, pp. 65-80 (2017).

Views: 574Downloads: 109Citations: 0