CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms
In Round-Robin Scheduling, the time quantum is fixed and processes are scheduled such that no process uses CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes will not be tolerated in an interactive environment. If the time quantum is too s...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The International Journals of Engineering and Sciences (IJENS)
2015
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/16483/ http://umpir.ump.edu.my/id/eprint/16483/ http://umpir.ump.edu.my/id/eprint/16483/1/157706-9191-IJECS-IJENS.pdf |