Represents:
* Scheduling of the oldest, simple, fair, widely used and easily implemented algorithm.
* Scheduling is not dipreempt by another process but by the scheduler based on the long running process (preempt by time).
* Scheduling without priority.
* Assume that all processes have the same interests, so there is no particular priority.
All processes are considered important so that the given amount of time the processor is called kwanta (quantum) or time slice, where the process is running. If the process is still running until the end of the quantum, the CPU will mempreempt process and gives them to other processes.
Scheduler needs to maintain a list of runnable processes. When the quantum is exhausted for a particular process, the process will be placed at the end of the list (list), as apparent in the following picture:
Terms of round robin algorithm is as follows:
1. If the quantum and the process was not completed then the process becomes runnable and processing is transferred to another process.
2. If the quantum has not been exhausted and the process of waiting for an event (the completion of I / O), then the process becomes blocked and the processor is transferred to another process.
3. If the quantum has not been exhausted but the process has been completed, then the process is terminated and processing is transferred to another process.
Scheduling this:
a. Good for interactive-time sharing system where most of the time used to wait for external events.
Examples: text editors, most of the time the program is to wait for the keyboard, so it can run other processes.
b. Not suitable for real time systems let alone the hard-real-time applications.
Training :
1. If the quantum and the process was not completed then the process becomes runnable and processing is transferred to another process.
2. If the quantum has not been exhausted and the process of waiting for an event (the completion of I / O), then the process becomes blocked and the processor is transferred to another process.
3. If the quantum has not been exhausted but the process has been completed, then the process is terminated and processing is transferred to another process.
Scheduling this:
a. Good for interactive-time sharing system where most of the time used to wait for external events.
Examples: text editors, most of the time the program is to wait for the keyboard, so it can run other processes.
b. Not suitable for real time systems let alone the hard-real-time applications.
Training :
Answer :
0 comments:
Posting Komentar
silahkan tinggalkan komentar anda :