| 摘要 |
PROBLEM TO BE SOLVED: To provide optimized scheduling in a multi-process environment.SOLUTION: A first and a second binary trees are used for storing scheduled and unscheduled leaves, each of which represents a logical link having data to be transmitted. The first binary tree contains leaves representing logical links having data to be transmitted and not being scheduled in the next transmission cycle, while the second binary tree contains leaves representing logical links having data to be transmitted and being scheduled in the next transmission cycle. The method comprises the steps of updating and reordering the leaves of the first and second binary trees, as well as adding and removing leaves to/from the first and second binary trees, and exchanging leaves from the second binary tree to the first binary tree and vice versa. |
