In packet scheduling, fairness of bandwidth allocation is a key factor that determines the algorithm is good or on the contrary and fairness affects QoS of data flow directly.
在分组调度中，带宽资源分配的公平性是决定算法优劣的一个非常重要的因素，而且公平性也会直接影响到数据流的服务质量。
Because of the NP complexity of mapping problem, the thesis studies two-step method: optimal scheduling of data flow graph and optimal processor mapping.
考虑到算法映射问题的NP复杂度和求解时间的指数性增加，本文主要研究两步规划方法，即先进行数据流图的最优规划，然后进行处理器的映射。
Based on the analysis of the basic concepts and features of workflow and business object, etc., scheduling algorithms for workflow engine and data flow of inter-activity were proposed.
在分析了工作流、业务对象等基本概念和特征之后，针对过程中活动间的数据流，提出了工作流引擎和数据流的调度算法。
应用推荐