Multi level feedback queue scheduling
2017-12-14
0 0 0
no vote
Other
Earn points
Multi level (assuming N-level) feedback queue scheduling algorithm can be the following principles: 1 QN), in which the priority of each queue to the processor is different, that is to say, the priority of jobs (processes) in each queue is also different. In general, priority (Q1) & gt; priority (Q2) & gt > Priority(QN)。 How to say, any job (process) in Q1 has higher priority relative to CPU than any job (process) in Q2 (that is, jobs in Q1 must be scheduled by processor before jobs in Q2), and so on. 2. For a specific queue, it follows the time slice rotation method. In other words, there are n jobs in the queue Q2, and their running time is determined by the time slice set by the queue Q2 (for ease of understanding, we can also think that the priority of jobs in a specific queue is scheduled according to FCFS). 3. Is the time slice of each queue the same? Different, this is the subtlety of the algorithm design. The time slice of each queue decreases with the increase of priority, that is to say, the higher the priority, the shorter the time slice in the queue. At the same time, in order to facilitate the completion of those large jobs, the time slice of the last queue QN (the queue with the lowest priority) is generally large (this problem does not need to be considered).
Related Source Codes
Android AOA Android Open Accessory Development Usi
0
0
no vote
Golang AOA Android Open Accessory HID Control
0
0
no vote
PClite
0
0
no vote
GMSK Linear Receiver
0
0
no vote
The golden version of AFT that has been passed dow
0
0
no vote
No comment