Efficient PIMRR Algorithm Based on Scheduling Measures for Improving Real Time Systems

  • Authors

    • Siva Nageswara Rao
    • Ramkumar Jayaraman
    • Dr S.V.N Srinivasu
    2018-05-31
    https://doi.org/10.14419/ijet.v7i2.32.15583
  • Scheduling, waiting time, context switches, turnaround time, priority and quantum time.

  • Scheduling play an important role to perform a single (or) multiple process activities by considering scheduling criteria’s such as, waiting time, turnaround time, CPU utilization and context switches. The scheduling criteria’s mainly depends on the quantum time which is specific to real time systems. The challenges faced by the real time systems based on scheduling activities viz., higher waiting time, more context switches and high turnaround time. All the scheduling criteria’s are integrated to achieve Quality of Service (QoS) like throughput and delay. To improve the scheduling criteria’s like waiting time, context switches and turnaround time, PIMRR algorithm is proposed. The PIMRR algorithm is first integrated with modulo operation to provide priority to all the process. The average of all the processes burst time is equal to the quantum time. Performance analysis is done for PMIRR with the existing simple round robin, PRR, Priority based RR scheduling based on the scheduling criteria’s. Our results demonstrates that the PIMRR is more efficient compared to the existing ones, in terms of waiting time and turnaround time versus quantum time.

     

     


     

  • References

    1. [1]. Sonia Zouaoui, LotfiBoussaid and AbdellatifMtibaa, “CPU scheduling algorithms: Case & comparative study,†in Proc. of 17th International Conference onSciences and Techniques of Automatic Control and Computer Engineering (STA), 2016.

      [2]. Bin Nie, Jianqiang Du, Guoliang Xu, Hongning Liu, Riyue Yu and Quan Wen, “A New Operating System Scheduling Algorithm,†Advanced Research on Electronic Commerce, Web Application, and Communication, pp. 92-96, 2011.

      [3]. Meierhofer J., Bernhard U.P., Balmelli P., and Bernasconi D., “Priority scheduling algorithm for ATM wireless network access,†IEEE 6th International Conference onUniversal Personal Communications Record, Conference Record., 1997.

      [4]. W. Zhao and J.A. Stankovic, “Performance analysis of FCFS and improved FCFS scheduling algorithms for dynamic real-time computer systems,†in Proc. of Real Time Systems Symposium, 1989, Doi: 10.1109/REAL.1989.63566.

      [5]. Mokhtar A. Alworafi, AtyafDhari, Asma A. Al-Hashmi, A. BasitDarem and Suresha, “An improved SJF scheduling algorithm in cloud computing environment,†In proc. of International Conference on Electrical, Electronics, Communication, Computer and Optimization Techniques (ICEECCOT), 2016, Doi: 10.1109/ICEECCOT.2016.7955216.

      [6]. HarshalBharatkumar Parekh and SheetalChaudhari, “Improved Round Robin CPU scheduling algorithm: Round Robin, Shortest Job First and priority algorithm coupled to increase throughput and decrease waiting time and turnaround time,†in Proc. International Conference on of Global Trends in Signal Processing, Information Computing and Communication (ICGTSPICC), 2016,Doi: 10.1109/ICGTSPICC.2016.7955294.

      [7]. Ahmed Alsheikhy, Reda Ammar and RaafatElfouly, “An improved dynamic Round Robin scheduling algorithm based on a variant quantum time,†In proc. of 11th International Computer Engineering Conference (ICENCO), 2015, DOI: 10.1109/ICENCO.2015.7416332.

      [8]. Bashir Alam, M. N. Doja and R. Biswas, “Finding Time Quantum of Round Robin CPU Scheduling Algorithm Using Fuzzy Logic,†In proc. of International Conference on Computer and Electrical Engineering, 2008, Doi: 10.1109/ICCEE.2008.89.

      [9]. Abbas Noon, Ali Kalakech and SeifedineKadry, “A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average,†IJCSI International Journal of Computer Science Issues, Vol. 8, Issue. 3, pp. 224-229, 2011.

      [10]. Rakesh Mohanty, H. S. Behera, KhusbuPatwari, Monisha Dash and M. Lakshmi Prasanna, “Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems,†International Journal of Advanced Computer Science and Applications(IJACSA), Vol. 2, No. 2, pp. 46-50, 2011.

      [11]. Suman Bhatia and SupriyaRaheja, “Modified Round Robin Scheduling Algorithm Using Variable Time Slice,†International Journal of Engineering Research and Development,†Vol. 8, Issue. 3, pp. 57-61, 2013.

      [12]. H. S. Behera, Rakesh Mohanty, SabyasachiSahu and Sourav Kumar Bhoi, “Comparative Performance Analysis Of Multi-Dynamic Time Quantum Round Robin (Mdtqrr) Algorithm WithArrival Time,†Indian Journal of Computer Science and Engineering (IJCSE), Vol. 2, No. 2, pp. 262-271, 2011.

      [13]. Anukush Joshi and ShubhashishGoswami,†Modified Round Robin Algorithm by using priority Scheduling,†Advances in Computational Sciences and technology, Vol. 10, No. 6, pp. 1543-1549, 2017.

      [14]. Ishwari Singh Rajput and Deepa Gupta, “A Priority based Round Robin CPUScheduling Algorithm for Real Time Systems,†International Journal of Innovations in Engineering and Technology (IJIET), Vol. 1, Issue. 3, 2012.

      [15]. Siva Nageswara Rao, G., Srinivasu, S.V.N., Srinivasu, N., Ramakoteswara Rao, G.Enhanced precedence scheduling algorithm with dynamic time quantum EPSADTQ)(2015) Research Journal of Applied Sciences, Engineering and Technology, 10 (8), pp. 938-941.

      [16]. Siva Nageswara Rao, G., Srinivasu, N., Sagar, K.V.D., Sai Madhuri, P.Comparison of round robin CPU scheduling algorithm with various dynamic time quantum (2014) International Journal of Applied Engineering Research, 9 (18), pp. 4905-4916.

      [17]. Siva Nageswara Rao, G., Srinivasu, S.V.N., Srinivasu, N., Naga Raju, O.A new proposed Dynamic dual processor based CPU scheduling algorithm(2015) Journal of Theoretical and Applied Information Technology, 73 (2), pp. 226-231.

      [18]. Rao, G.S.N., Srinivasu, N., Girish Kumar, K., Abhishek, B.An enhanced dynamic Round Robin CPU scheduling algorithm(2014) International Journal of Applied Engineering Research, 9 (15), pp. 3085-3098.

      [19]. Rao, G.S., Krishna, C.V.P., Rao, K.R.Extreme Programming for service-based application development architecture(2014) Proceedings of the 2014 Conference on IT in Business, Industry and Government: An International Conference by CSI on Big Data, CSIBIG 2014, art. no. 7056955,.

      [20]. Rao, G.S., Krishna, C.V.P., Rao, K.R.Multi Objective Particle Swarm Optimization for Software Cost Estimation(2014) Advances in Intelligent Systems and Computing, 248 VOLUME I, pp. 125-132.

      [21]. Rao, G.S., Krishna, C.V.P., Rao, K.R.Rational unified process for service oriented application in extreme programming (2013) 2013 4th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2013, art. no. 6726586, .

      [22]. Daya Sagar, K.V., Sivanageswara Rao, G., Srikanth, T., Raghavendra, K.A relational analytic platform with Hadoop using the On Demand Integration (ODI) capability(2014) International Journal of Applied Engineering Research, 9 (13), pp. 2095-2102.

  • Downloads

  • How to Cite

    Nageswara Rao, S., Jayaraman, R., & S.V.N Srinivasu, D. (2018). Efficient PIMRR Algorithm Based on Scheduling Measures for Improving Real Time Systems. International Journal of Engineering & Technology, 7(2.32), 275-278. https://doi.org/10.14419/ijet.v7i2.32.15583