CPU Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm
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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Asian Research Publishing Network
2016
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/16486/ http://umpir.ump.edu.my/id/eprint/16486/ http://umpir.ump.edu.my/id/eprint/16486/1/jeas_1116_5351.pdf |