The Simulation of Round Robin and Priority Scheduling Algorithm
2015
An operating system has some rules that control the execution of processes. These rules are called the scheduling algorithms. Scheduling algorithms make the organization and management of resources in a hardware. Two of these algorithms are round robin and priority scheduling. In this paper we will stimulate the logic of these algorithms with two simple programs written in c language.
Keywords:
- Lottery scheduling
- Deadline-monotonic scheduling
- Fair-share scheduling
- Earliest deadline first scheduling
- Two-level scheduling
- Distributed computing
- Fixed-priority pre-emptive scheduling
- Real-time computing
- Dynamic priority scheduling
- Computer science
- Rate-monotonic scheduling
- Parallel computing
- Round-robin scheduling
- Algorithm
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
9
References
4
Citations
NaN
KQI