Ashkan Emami Ale Agha

Work place: Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran



Research Interests: Computer systems and computational processes, Computer Architecture and Organization, Operating Systems, Systems Architecture, Data Structures and Algorithms


Ashkan Emami Ale Agha: Graduate Student for computer engineering in Islamic Azad University, Science and Research Branch, Tehran, Iran, interested in computer architecture, Operating Systems design and Sensor Networks.

Author Articles
A New Method to Improve Round Robin Scheduling Algorithm with Quantum Time Based on Harmonic-Arithmetic Mean (HARM)

By Ashkan Emami Ale Agha Somayyeh Jafarali Jassbi

DOI:, Pub. Date: 8 Jun. 2013

One of the most important concepts in multi programming Operating Systems is scheduling. It helps in choosing the processes for execution. Round robin method is one of the most important algorithms in scheduling. It is the most popular algorithm due to its fairness and starvation free nature towards the processes, which is achieved by using proper quantum time. The main challenge in this algorithm is selection of quantum time. This parameter affects on average Waiting Time and average Turnaround Time in execution queue. As the quantum time is static, it causes less context switching in case of high quantum time and high context switching in case of less quantum time. Increasing context switch leads to high average waiting time, high average turnaround time which is an overhead and degrades the system performance. With respect to these points, the algorithms should calculate proper value for the quantum time. Two main classes of algorithms that are proposed to calculate the quantum time include static and dynamic methods. In static methods quantum time is fixed during the scheduling. Dynamic algorithms are one of these methods that change the value of quantum time in each cycle. For example in one method the value of quantum time in each cycle is equal to the median of burst times of processes in ready queue and for another method this value is equal to arithmetic mean of burst times of ready processes.
In this paper we proposed a new method to obtaining quantum time in each cycle based on arithmetic-harmonic mean (HARM). Harmonic mean is calculated by dividing the number of observations by the reciprocal of each number in the series. With examples we show that in some cases it can provides better scheduling criteria and improves the average Turnaround Time and average Waiting Time.

[...] Read more.
Other Articles