| Summary: | 碩士 === 國立東華大學 === 資訊工程學系 === 101 === Multicore processor environments is more than more popular, and many scheduling algorithm want to result unfairness or starvation. In linux use O(1) scheduler to do system scheduler, is use priority to define a task get cpu time, and define the order of execution. In the base is generalized processor sharing algorithm use weight to define a task get cpu time, and define the order of execution. The advantage of priority, it can make a important task run first, but it may make lower priority task starvation. The advantage of weight can fairness to do every task in accordance with weight, but if a task weight is lower, but it is very import, the system may be crash. So, we want to combim priority and weight to make a scheduler.
|
|---|
