CPU scheduling with a round Robin algorithm based on an effective time slice
The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different c...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Korea Information Processing Society (KIPS)
2017
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/58310/ http://irep.iium.edu.my/58310/ http://irep.iium.edu.my/58310/ http://irep.iium.edu.my/58310/1/JIPS_486.pdf http://irep.iium.edu.my/58310/7/58310_CPU%20scheduling%20with%20a%20round%20Robin%20algorithm%20based%20on%20an%20effective%20time%20slice_SCOPUS.pdf |
| Summary: | The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques
in computing. It centres on the processing time required for a CPU to execute available jobs. Although there
are other CPU scheduling algorithms based on processing time which use different criteria, the round robin
algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this
algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin
CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a
dynamically allocated time quantum in each round. Its performance is compared with both traditional and
enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of
average waiting time, average turnaround time and context switching. |
|---|