Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms
In Round-Robin Scheduling, the quantum time is static and tasks are scheduled such that no process uses CPU time more than one slice time each cycle. If quantum time is too large, the response time of the processes will not be tolerated in an interactive environment. If quantum the time is too small...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Foundation of Computer Science
2016
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/16487/1/mohammed-2016-ijca-907983%20google%20scholar.pdf http://umpir.ump.edu.my/id/eprint/16487/ http://www.ijcaonline.org/archives/volume134/number7/23929-2016907983 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|