Prioritized Fair Round Robin Algorithm with Variable Time Quantum
The performance of the time sharing systems and multiprocessor systems is greatly dependent on CPU scheduling algorithms. Some of the famous algorithms are Shortest Job First (SJF), First Come First Served (FCFS), Priority Scheduling and Round Robin (RR). Round Robin is the preferable choice for tim...
Saved in:
| Published in: | 2015 13th International Conference on Frontiers of Information Technology (FIT) pp. 314 - 319 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.12.2015
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!