|
Abstract
|
Article Information:
Enhanced Precedence Scheduling Algorithm with Dynamic Time Quantum (EPSADTQ)
G. Siva Nageswara Rao, S.V.N. Srinivasu, N. Srinivasu and G. Ramakoteswara Rao
Corresponding Author: G. Siva Nageswara Rao
Submitted: February 22, 2015
Accepted: March 7, 2015
Published: July 20, 2015 |
Abstract:
|
This study proposes a new algorithm which is a logical extension of the popular Round Robin CPU scheduling algorithm. The Round Robin algorithm can be effective only if the time quantum is chosen accurately. Even by taking mean average of burst times as time quantum, the performance of the RR cannot be improved beyond a certain point. However, the novel method proposed here, suggests that a priority be assigned to each process based on balanced precedence factor. The novel method also uses mean average as a time quantum. Experiments are conducted in order to measure the effectiveness of this novel method. The results clearly showed that EPSADTQ is superior to RR and PSMTQ and its variants. EPSADTQ resulted in a significant reduction of the no. of context switches, average waiting time and average turnaround time.
Key words: Avg. waiting time, avg. context switch, process, ready queue, turnaround time, ,
|
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
G. Siva Nageswara Rao, S.V.N. Srinivasu, N. Srinivasu and G. Ramakoteswara Rao, . Enhanced Precedence Scheduling Algorithm with Dynamic Time Quantum (EPSADTQ). Research Journal of Applied Sciences, Engineering and Technology, (8): 938-941.
|
|
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
