查询词典 scheduling problem

Through scheduling process analysis of periodic task, the waiting limit formula of each task in ready queue was obtained while guarantees its deadline. In addition, some properties, such as final preempting time was deduced and the necessary condition of periodic tasks preempting behavior was described quantitatively. Based on them, a micro scheduling preemption model for periodic tasks in ready queue was put forward, which decreased the number of preemptions and optimized system performance through changing the preempting sequences.

通过分析周期性任务的调度过程，得出在确保任务不错过截止期条件下，各个任务在就绪队列中可等待的最长期限计算公式，并根据公式推导出任务满足截止期的最后抢占时刻等属性，从而定量地刻画了周期性任务抢占行为发生的必要条件，提出了一套对周期性任务的就绪队列进行微调度的抢占模型，通过改变抢占关系来减少抢占次数、优化实时系统性能。

Rotation Scheduling with Variable Repartitioning is an effective but not efficient enough scheduling method on this architecture, and we think its main drawback is the unfavorable variable partition mechanism.

目前的RSVR 排程法效能不错但在效率上仍有改善空间，主要原因我们认为是其使用的变数分割机制不佳；因此我们定义新的变数分割机制并设计对应的指令排程法，针对RSVR 的不足之处来做改善。

In this paper, the Equilibrium-Moderation Method for design task scheduling is put forward, the scheduling strategy of EMM is discussed, the algorithm of EMM is developed, the practice example is given.

该文提出了设计任务调度的&均衡-适度&法，分析了其调度策略，研究了其算法实现，最后给出了应用实例。

Through the definition of behavioral synthesis meaning of AFTER clauses, the enhanced ASAP and ALAP algorithm under AFTER clause delay time constraints is presented. The scheduling model under AFTER clause delay time constraints is also presented. The scheduling model is resolved by ILP.

通过对其行为综合语义的定义，给出了在AFTER子句时延约束下的ASAP和ALAP算法，建立了AFTER子句时延约束下的调度模型，并采用整数线性规划法求解调度模型。

Chapter IV, the overall structure of the function, detailed the function of the system on the structure, scheduling and traffic management, freight management, scheduling command management, statistics and statements management module.

第四章系统的总体功能结构部分，介绍了系统的功能结构，并对行车调度管理，货运管理，调度指挥管理，统计及报表管理等功能模块做了详细的阐述。

Enlightened by compensation model of wireless QoS scheduling algorithms and ideas that weights can be modified during scheduling, compensation model of CFQ can be implemented by deflating and magnifying wights with certain proportions.

与WFQ等不同的是，CFQ算法的的虚拟时间标签由于业务流的权值动态改变而将产生相应的缩放变化，当分组离开队列，需要立即更新业务流的HOL分组虚拟时间戳并重新排序以选择下一个调度的分组。

Different schedulers have different scheduling algorithms that bring about quite different performances of an HSUPA system. Therefore, it is expected to further consider the characteristics of WCDMA systems and work out better scheduling algorithms for distributed schedulers in order to obtain higher system performance.

文章认为由于调度器的变化，不同调度算法在HSUPA系统中的表现有很大差别，需要进一步根据WCDMA系统业务的特点，设计更适合分布式调度器的调度算法，以进一步提高系统性能。

Top real-time fault-tolerance uses real-time fault-tolerant techniques as resume execution or re-execution and adopts the H-FTF scheduling method. And, based on time redundancy, bottom real-time fault-tolerance uses real-time fault-tolerant techniques as alternate version or re-execution and adopts the FT/FA scheduling method and the DSC-EDF algorithm. Moreover, two real-time fault-tolerant evaluations are added to the mechanism.

其中，上层实时容错采用恢复执行或重新执行的容错技术，提出动态实时容错的分级容错优先H-FTF调度方法，实现了DRTAS系统级的实时容错；下层实时容错以时间冗余为基础，采取替代版本或重新执行的容错技术，提出容错/频率保证FT/FA调度方法、动态空闲能力最早时限优先DSC-EDF算法，在实时内核级为实时任务提供实时容错保障。

Following these, the paper use the idea of the rapid development of the control and scheduling system and three developed tools in Desktop FMS. The application verifies the feasibility and availability to shorten the development time, reduce costs, and improve the reconfigurations of the control and scheduling system.

在此基础上，本文针对Desktop FMS系统，对本文所提出的FMS运控软件快速开发思想和实现的快速开发工具进行了应用，实践证明对缩短FMS运控软件的开发周期，降低开发成本，提高系统可重构性是可行的、有效的。

The topics are divided into three parts: the first part introduced the basic concepts of algorithms, mathematical algorithms and algorithms based on complexity analysis scheduling problem for the second part of the problem and plans to discuss a variety of existing algorithms, and describes the design of commonly used algorithms including sub-rule law, greedy method, dynamic programming, backtracking and branch and bound method, and describes the complexity of the calculation, as well as NP-complete problem the third part of the model on parallel computing and parallel algorithm design techniques.

全书分为3个部分：第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析；第二部分针对排序问题和图的问题，讨论各种已有的算法，并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法，并介绍了计算的复杂性以及NP完全问题；第三部分讲述并行计算模型和并行算法设计技术。

"Second Life is remarkably easy to work with, and is very popular,"

"第二次生命是显着容易的工作，并且很受欢迎，"

For example, we usually assume that materials are homogeneous and isotropic and free of internal defects or flaws.

为了得到适合有限元分析的模型，我们必须经过如图2所示的简化步骤。