Call for Paper - August 2019 Edition
IJCA solicits original research papers for the August 2019 Edition. Last date of manuscript submission is July 20, 2019. Read More

Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2016
Authors:
Maysoon A. Mohammed, Mazlina AbdulMajid, Balsam A. Mustafa
10.5120/ijca2016907983

Maysoon A Mohammed, Mazlina AbdulMajid and Balsam A Mustafa. Article: Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms. International Journal of Computer Applications 134(7):31-37, January 2016. Published by Foundation of Computer Science (FCS), NY, USA. BibTeX

@article{key:article,
	author = {Maysoon A. Mohammed and Mazlina AbdulMajid and Balsam A. Mustafa},
	title = {Article: Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms},
	journal = {International Journal of Computer Applications},
	year = {2016},
	volume = {134},
	number = {7},
	pages = {31-37},
	month = {January},
	note = {Published by Foundation of Computer Science (FCS), NY, USA}
}

Abstract

In Round-Robin Scheduling, the quantum time is static and tasks are scheduled such that no process uses CPU time more than one slice time each cycle. If quantum time is too large, the response time of the processes will not be tolerated in an interactive environment. If quantum the time is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer throughputs. In this study, we propose a priority multi queues algorithm with dynamic quantum time. The algorithm uses multi queues with different quantum times for the processes. The quantum times for the processes are depending on the priorities which in turn depending on the burst times of the processes. The proposed algorithm has been compared with varying time quantum algorithm which already exist to improve the original round robin algorithm. With proposed algorithm, the simple Round-Robin algorithm has been improved by about 35%. By controlling quantum time, we experience fewer context switches and shorter waiting and turnaround times, thereby obtaining higher throughput.

References

  1. H. Kopetz, Real-time systems: design principles for distributed embedded applications: Springer, 2011.
  2. T. F. Hasan, "CPU SCHEDULING VISUALIZATION."
  3. A. Silberschatz, P. B. Galvin, and G. Gagne, Operating system concepts vol. 8: Wiley, 2013.
  4. E. Oyetunji and A. Oluleye, "Performance Assessment of Some CPU Scheduling Algorithms," Research Journal of Information and Technology, vol. 1, pp. 22-26, 2009.
  5. F. Cerqueira and B. Brandenburg, "A comparison of scheduling latency in linux, PREEMPT-RT, and LITMUSRT," in Proceedings of the 9th Annual Workshop on Operating Systems Platforms for Embedded Real-Time applications, 2013, pp. 19-29.
  6. L. Yang, J. M. Schopf, and I. Foster, "Conservative scheduling: Using predicted variance to improve scheduling decisions in dynamic environments," in Proceedings of the 2003 ACM/IEEE conference on Supercomputing, 2003, p. 31.
  7. W. Tong and J. Zhao, "Quantum varying deficit round robin scheduling over priority queues," in Computational Intelligence and Security, 2007 International Conference on, 2007, pp. 252-256.
  8. M.-X. Chen and S.-H. Liu, "Hierarchical Deficit Round-Robin Packet Scheduling Algorithm," in Advances in Intelligent Systems and Applications-Volume 1, ed: Springer, 2013, pp. 419-427.
  9. A. Singh, P. Goyal, and S. Batra, "An Optimized Round Robin Scheduling Algorithm for CPU Scheduling," IJCSE) International Journal on Computer Science and Engineering, vol. 2, pp. 2383-2385, 2010.
  10. I. Sattar, M. Shahid, and N. Yasir, "Multi-Level Queue with Priority and Time Sharing for Real Time Scheduling."
  11. H. Yu, S. Ruepp, and M. S. Berger, "Multi-level round-robin multicast scheduling with look-ahead mechanism," in Communications (ICC), 2011 IEEE International Conference on, 2011, pp. 1-5.
  12. W. Wang, B. Li, and B. Liang, "Multi-Resource Round Robin: A low complexity packet scheduler with Dominant Resource Fairness," in ICNP, 2013, pp. 1-10.
  13. D. Nikolova and C. Blondia, "Bonded deficit round robin scheduling for multi-channel networks," Computer Networks, vol. 55, pp. 3503-3516, 2011.
  14. N. Goel and R. Garg, "An Optimum Multilevel Dynamic Round Robin Scheduling Algorithm," arXiv preprint arXiv:1307.4167, 2013.
  15. R. S. Kiran, P. V. Babu, and B. M. Krishna, "Optimizing CPU scheduling for real time applications using mean-difference round robin (MDRR) algorithm," in ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India-Vol I, 2014, pp. 713-721.
  16. I. S. Rajput and D. Gupta, "A Priority based Round Robin CPU Scheduling Algorithm for Real Time Systems," International Journal of Innovations in Engineering and Technology, 2012.
  17. R. Mohanty, H. Behera, K. Patwari, M. Dash, and M. L. Prasanna, "Priority based dynamic round robin (PBDRR) algorithm with intelligent time slice for soft real time systems," arXiv preprint arXiv:1105.1736, 2011.
  18. M. K. Mishra and F. Rashid, "AN IMPROVED ROUND ROBIN CPU SCHEDULING ALGORITHM WITH VARYING TIME QUANTUM," International Journal of Computer Science, Engineering & Applications, vol. 4, 2014.

Keywords

Burst Time, Dynamic Quantum Time, Multi queue, Priority, Round Robin.