| 摘要 |
<p>A proportional share scheduling apparatus and technique for scheduling resources among a plurality of clients, each of which has a proportional resource allocation of the total resources for the CPU. The clients are sorted in a run queue from the client having the largest proportional share allocation to the client having the smallest proportional share allocation (112). Starting from the beginning of the run queue, each client is run for a constant time quantum (130). If a client in the run queue has received more than its proportional resource allocation, the remaining clients in the run queue are skipped, and the clients are run from the beginning of the run queue (120). This process repeats until all clients have received service. Since the clients with the largest proportional share allocation are placed at the beginning of the run queue, they are allowed to receive more service than the clients having a smaller proportional resource allocation propositioned at the end of the run queue.</p> |
