Multi-Queue Priority Based Algorithm for CPU Process Scheduling

  • Usman Rafi
  • Muhammad Azam ZiaEmail author
  • Abdul Razzaq
  • Sajid Ali
  • Muhammad Asim Saleem
Conference paper
Part of the Lecture Notes on Multidisciplinary Industrial Engineering book series (LNMUINEN)


Operating Systems acts as a base software and acts as a driver for both application programs and system programs. All the programs residing in an operating system has to become process for execution. A modern computer system supports multitasking by single user or multiple users. Different processes have different priorities. The major goal of an operating system is to reduce waiting time and enhance throughput by scheduling processes in some way. This paper discusses various scheduling terms and scheduling algorithms. We have proposed a new approach for scheduling. This proposed algorithm is based on the mixture of MQMS, Priority Scheduling mechanism and Round Robin scheduling. The proposed algorithm facilitates operating system by managing separate queue for separate priority of process and manages queue scheduling in round robin fashion with dynamic time slicing. Processes are added to appropriate queue and this decision is based on any user defined or system defined criteria. We have also discussed various case studies regarding this algorithm and compared its results with priority scheduling algorithm. These case studies are limited to two queuing system up till now. We have also proposed multiple queue management (more than 2), dynamic time slicing instead of half execution scheme and varying execution times of queues as future work of this algorithm scheme.


Priority scheduling Multi-queue scheduling Dynamic time slice execution Fair priority scheduling Single processor multi-queue scheduling Improved priority scheduling 


  1. 1.
    Abdulrahim A, Abdullahi SE, Sahalu JB (2014) A new improved round robin (nirr) cpu scheduling algorithm. Int J Comput Appl 90(4):27–33Google Scholar
  2. 2.
    Adekunle O (2014) A comparative study of scheduling algorithms for multiprogramming in real-time systems. Int J Innov Sci Res 12:180–185Google Scholar
  3. 3.
    Akhtar M, Hamid B et al (2015) An optimized shortest job first scheduling algorithm for cpu scheduling. J Appl Environ Biol Sci 5:42–46Google Scholar
  4. 4.
    Almakdi S (2015) Simulation and Performance Evaluation of CPU Scheduling Algorithms. LAP LAMBERT Academic Publishing, SaarbrückenGoogle Scholar
  5. 5.
    Goel N, Garg RB (2013) A comparative study of cpu scheduling algorithms. Int J Graph Image Process 2(4):245–251Google Scholar
  6. 6.
    Goel N, Garg RB (2016) Performance analysis of cpu scheduling algorithms with novel omdrrs algorithm. Int J Adv Comput Sci Appl 7(1):216–221Google Scholar
  7. 7.
    Joshi R, Tyagi SB (2015) Smart optimized round robin (sorr) cpu scheduling algorithm. Int J Adv Res Comput Sci Softw Eng 5:568–574Google Scholar
  8. 8.
    Kathuria S, Singh PP et al (2016) A revamped mean round robin (rmrr) cpu scheduling algorithm. Int J Innov Res Comput Commun Eng 4:6684–6691Google Scholar
  9. 9.
    Khan R, Kakhani G (2015) Analysis of priority scheduling algorithm on the basis of fcfs and sjf for similar priority jobs. Int J Comput Sci Mob Comput 4:324–331Google Scholar
  10. 10.
    Lulla D, Tayade J, Mankar V (2015) Priority based round robin cpu scheduling using dynamic time quantum. Int J Emerg Trends Technol 2:358–363Google Scholar
  11. 11.
    Mishra MK (2012) An improved round robin cpu scheduling algorithm. J Glob Res Comput Sci 3(6):64–69Google Scholar
  12. 12.
    Mishra MK, Rashid F (2014) An improved round robin cpu scheduling algorithm with varying time quantum. Int J Comput Sci Eng Appl 4(4):1–8Google Scholar
  13. 13.
    Patel R, Patel M (2013) Sjrr cpu scheduling algorithm. Int J Eng Comput Sci 2:3396–3399Google Scholar
  14. 14.
    Rajput G (2012) A priority based round robin cpu scheduling algorithm for real time systems. Int J Innov Eng Technol 1:1–10Google Scholar
  15. 15.
    Rao MVP, Shet KC, Roopa K (2009) A simplified study of scheduler for real time and embedded system domain. Comput Sci Telecommun 12(5):1–6Google Scholar
  16. 16.
    Shrivastav MK, Pandey S et al (2012) Fair priority round robin with dynamic time quantum: Fprrdq. Int J Mod Eng Res 2:876–881Google Scholar
  17. 17.
    Shukla D, Ojha S, Jain S (2010) Data model approach and markov chain based analysis of multi-level queue scheduling. J Appl Comput Sci Math 8(4):50–56Google Scholar
  18. 18.
    Silberschatz A, Gagne G, Galvin PB (1983) Operating System Concepts, 8th edn. Addison-Wesley Pub. Co, Boston Binder Ready VersionzbMATHGoogle Scholar
  19. 19.
    Singh N, Singh Y (2016) A practical approach on mlq-fuzzy logic in cpu scheduling. Int J Res Educ Sci Methods 4:50–60Google Scholar
  20. 20.
    Sirohi A, Pratap A, Aggarwal M (2014) Improvised round robin (cpu) scheduling algorithm. Int J Comput Appl 99(18):40–43Google Scholar
  21. 21.
    Stallings W (2011) Operating Systems–Internals and Design Principles, 7th edn. DBLPGoogle Scholar
  22. 22.
    Tanenbaum AS, Tanenbaum AS (2001) Modern Operating Systems, 2nd edn. Prentice-Hall, Upper Saddle RiverzbMATHGoogle Scholar
  23. 23.
    Ulfahsiregar M (2012) A new approach to cpu scheduling algorithm: Genetic round robin. Int J Comput Appl 47(19):18–25Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Usman Rafi
    • 1
  • Muhammad Azam Zia
    • 2
    • 3
    Email author
  • Abdul Razzaq
    • 4
  • Sajid Ali
    • 5
  • Muhammad Asim Saleem
    • 6
  1. 1.Department of CS and ITUOS Lyallpur CampusFaisalabadPakistan
  2. 2.State Key Laboratory of Networking and Switching TechnologyBUPTBeijingThe People’s Republic of China
  3. 3.University of AgricultureFaisalabadPakistan
  4. 4.Department, NFC Institute of Engineering and TechnologyMultanPakistan
  5. 5.Department, D.G. Khan CampusUniversity of EducationLahorePakistan
  6. 6.Department of ITGovernment College UniversityFaisalabadPakistan

Personalised recommendations