Research Article Open Access

Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes

Rami J. Matarneh

Abstract

Problem statement: The performance and efficiency of multitasking operating systems mainly depends on the used CPU scheduling algorithm where the CPU is one of the primary computer resources and as round robin scheduling algorithm is considered most widely used scheduling algorithms in this research a new proposed variant of this algorithm presented, discussed in detail, tested and verified. Approach: The new proposed algorithm called Self-Adjustment-Round-Robin (SARR) based on a new approach called dynamic-time-quantum; the idea of this approach is to make the time quantum repeatedly adjusted according to the burst time of the now-running processes. Results: Based on the experiments and calculations that I have made the new modified algorithm radically solves the fixed time quantum problem which is considered a challenge for round robin algorithm. Conclusion: The use of dynamic scheduling algorithm increased the performance and stability of the operating system and support building of an self-adaptation operating system, which means that the system is who will adapt itself to the requirements of the user and not vice versa.

American Journal of Applied Sciences
Volume 6 No. 10, 2009, 1831-1837

DOI: https://doi.org/10.3844/ajassp.2009.1831.1837

Submitted On: 24 September 2009 Published On: 31 October 2009

How to Cite: Matarneh, R. J. (2009). Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes. American Journal of Applied Sciences, 6(10), 1831-1837. https://doi.org/10.3844/ajassp.2009.1831.1837

  • 2,657 Views
  • 4,883 Downloads
  • 52 Citations

Download

Keywords

  • Round robin
  • self-adjustment-round-robin
  • dynamic-time-quantum
  • CPU scheduling