1. The first come first serve algorithm (FCFS):
Inalienable algorithm is simple and inefficient.
2. short operating priority algorithm (SJF):
The shortest priority implementation processes in the process of arriving at the same time.
3. priority scheduling algorithm:
Adopt priority to represent the urgency of the job. Can be divided into:
- Preemptive priority scheduling algorithm
- Inalienable priority scheduling algorithm
According to the priority then whether a variable can be divided into:
- Static priority scheduling algorithm
- Dynamic priority scheduling algorithm
4. The ratio of the high priority algorithm in response to:
High response than the first algorithm is first come first serve a comprehensive consideration and short process priority algorithm.
Calculating the response ratio:
Ratio = response time (latency time to be executed +) / need to perform
The round-robin scheduling algorithm:
Round-robin scheduling algorithm to follow the principle of first come, first served, but its execution process is this: CPU will be ready in an orderly queue in the process, ready to perform the first process, if the prescribed time slice ( For example, 100ms) there has not been completed, the process will be thrown into the end of the queue, ready to continue waiting.