| 摘要 |
A device and a method for making a schedule in proportion to a share through ordering scheduling quanta are provided to increase fairness of resources distribution and lower implementation complexity while requiring a maximum time complexity cost by ordering the scheduling quanta with a binary tree. A scheduler(304) divides applications to be scheduled to a quantum unit by binding the applications in a group having a plurality of quanta and assigning an index to the group with the binary tree, assigns a binary address to the quantum assigned to each leaf node, and generates quantum order into a scheduling list corresponding to the order of the binary address. A scheduling list manager(306) enables the applications to be performed in the order of the generated scheduling list. The binary index is the index from each leaf node to a root. The scheduler assigns zero or one to the group or the quantum generated in division as the index.
|
