调度

The concrete work and main contribution are as follows:(1) The index indicating transfer capability homogeneousness is defined, and the new terms like homogeneous grid, grid according with economic flow are put forward. These new concepts describe the degree in which transfer capability is utilized, and they provide the standard for ideal grid whose transfer capability and power generation dispatching economy are in phase. So, new idea is introduced in transfer capability analysis.(2) The multi-objective function with generation cost and transfer capability homogeneousness weighted is constructed. The relationship between system existing generation dispatching and transfer capability is revealed through comparative analysis between security economic dispatch and security homogeneous dispatch, and the variation rule analysis between generation cost and transfer capability homogeneousness with the change of weighting coefficient.(3) Example analyses demonstrate that the difference between specific power system with ideal instance can be identified effectively using the above concepts and method.

具体工作和贡献主要体现在：(1)定义了衡量电网输电能力均匀性分布的指标，提出均匀电网、符合经济流电网的新概念，以描述电网输电能力被利用的程度，并给出输电能力和发电调度经济性相协调的理想电网标准，在输电能力分析评判领域引入了新观点；(2)构造了发电费用与输电均匀性加权的多目标函数，通过对安全经济调度与安全均匀调度的对比分析，以及权系数变化过程中发电费用与输电均匀性的变化规律分析，揭示了系统现存发电调度与输电能力之间的依赖关系；(3)大量分析表明，利用上述概念和方法可有效识别系统在特定模式下与符合经济流电网的偏差程度。

Since the model is a large scale and NP-hard combinational optimization problem in the real navigation environment, a hybrid simulated annealing algorithm is employed to search the suboptimal solution composed of a lockage timetable and a ship scheduling, The search starts by trimming the existing lockage timetable based on heuristic rules; the result is then used to compute the ship scheduling by the depth-first-search algorithm. The obtained solution is finally updated by the Metropolis rule.

本文首先提出了该问题的混合整数非线性规划模型，在实际通航调度环境中，该模型属于强NP-hard复杂度的大规模组合优化问题，因此设计了一种混合模拟退火算法来搜索次优化调度方案，该算法将解分解为闸次时间表和船舶调度计划两部分，在搜索过程中用启发式规则对闸次时间表进行调整，然后用深度优先搜索算法根据闸次时间表求解船舶调度计划，最后根据Metropolis规则对当前解进行更新。

The paper first presents an objective model of task scheduling,and then based on the analysis of Q learning algorithm,the Markov decision process description of the scheduling problem is given.

首先建立任务调度问题的目标模型，在分析 Q学习算法的基础上，给出调度问题的马尔可夫决策过程描述；针对任务调度的 Q学习算法更新速度慢的问题，提出一种基于多步信息更新值函数的多步 Q学习调度算法。

The contents of the course include: what operating system are, what they do, how they are designed, and where they came from; a general history and explanations of computer system, and some discussion on hardware and the relation between operating system and other software; concept of process, process states and process control block, process queue, management of processes; concepts of sequent programming and parallel programming, process synchronization and its application, process communication; scheduling level and job state transition, job scheduling, process scheduling, and methods for scheduling; deadlock and its necessary conditions, deadlock prevention, control and recovery of deadlock; fixed partition, multiple partition and replacement partition memory management, swapping and overlays; page, segmentation and segmentation with paging storage management, basic concept of virtual memory management, and page, segmentation and segmentation with paging memory management.

课程的内容包括：计算机系统概述、操作系统的形成、发展、功能、特性、类型和发展趋势；操作系统的硬件环境、操作系统与其它系统软件的关系；进程的概念、进程的状态和进程控制块、进程队列、进程的管理；顺序程序设计和并行程序设计概念、进程间的同步与互斥、同步机构应用、进程间通信；调度的层次和作业状态转换，作业的调度、进程调度、调度算法；死锁问题的提出、死锁的必要条件、死锁的预防、避免、控制和恢复；固定分区、可复分区、多重分区内存管理技术以及覆盖技术和交换技术；分页域、分段域、段页域存储管理技术、虚拟存储管理的基本概念、分页域、分段域、段页域虚拟存储管理。

The event-tree based modeling and optimization algorithms are adopted and the whole problem is divided into two sub problems (the portside sub problem and the refinery sub problem).Thus, the algorithm is proposed by analyzing the solving sequence of the two sub problems.

该方法把原油混输调度问题分解为码头调度子问题和厂区调度子问题，采用基于事件树的建模方法，并根据两个子问题的求解顺序提出了原油混输调度问题的分布式并行算法。

The 2008 Olympic Games will be held in Beijing, so research on emergency bus scheduling system is very important to improve the rationalization, rapidness, and safety of emergency bus scheduling management.

论文的主要工作如下：首先，介绍了突发事件、应急管理和物流配送车辆调度的相关概念，提出了公交应急调度的问题，并分析了公交应急调度与物流配送车辆调度的异同。

Multitasking operating systems come in two flavors: cooperative multitasking and preemptive multitasking. Linux, like all Unix variants and most modern operating systems, provides preemptive multitasking. In preemptive multitasking, the scheduler decides when a process is to cease running and a new process is to resume running. The act of involuntarily suspending a running process is called preemption. The time a process runs before it is preempted is predetermined, and it is called the timeslice of the process. The timeslice, in effect, gives each runnable process a slice of the processor''s time. Managing the timeslice enables the scheduler to make global scheduling decisions for the system. It also prevents any one process from monopolizing the processor. Bs we shall see, this timeslice is dynamically calculated in the Linux process scheduler to provide some interesting benefits.

多使命操作体系可化分为两类：非抢占式多使命以及抢占式多使命所有像Unix的变种体系以及很多现代操作系同同样，Linux提供抢占式的多使命模式在抢占式多使命模式中，调度步伐决议啥子时候进程中止，新的进程能够开始得到运行这个被强制挂起的动作就叫做抢占进程在被抢占前，运行的时间是预知的，这个时间叫做时间片究竟上，时间片是为每一个运行态的进程分配处置惩罚器的时间的一片管理时间片，使能调度步伐为体系做好整个的局面：胸怀～调度决议时间片也能阻止任何一个进程垄断处置惩罚器正如我们看到的，在Linux进程调度步伐中时间片是蜂蜜面膜动态计算出来的，这样带来很多利益

Selection of scheduling rule s based on genetic algorithm and process simulation;2. The results are regressively analyzed and monthly scheduling rule s are obtained.

通过对5个典型年短期优化调度模型求解结果进行回归分析，获得各月的短期调度规则，对调度规则的验证结果表明相对误差较小，所得到的短期调度规则可以投入实际应用。

Because EDF algorithm with a unified scheduling periodic and sporadic tasks in real-time is optimal. By analyzing and calculating EDF scheduling process of idle time and the maximum time can be stealed, Put forward a schedulability test of unified scheduling periodic and sporadic tasks with EDF policy.

通过分析和计算EDF算法调度偶发任务所占用的空闲时间和挪用时间，以及调度后对空闲时间和最大可挪用时间的影响，提出一种采用EDF算法统一调度硬实时周期任务和偶发任务时的可调度性充分判定算法。

Supposing processing information as a task of node,power constraints of node is considered,and node uses way of awaking/sleeping,during awaking assureed that sensor node accomplishes task and cluster head node can schedule multi-task of sensor node.will resolve such problem:before satisfying multi-tasks deadline invaliding of sensor node,how to feasibly schedule schedule algorithm of improving Rate-Monotonicand dynamic Preemptive Earliest Deadline First Algorithm,via concrete example are presented,The process of algorithm achieving is explained.

假定每个节点对信息的处理看作是一个任务，考虑节点能量限制，节点采用唤醒/休眠机制，在唤醒期间确保节点任务完成，簇头节点能够调度处理多个传感器节点的任务。文中解决的问题：在满足多个传感器节点任务处理的截止期失效前，簇头节点如何合理的调度任务，提出了改进的 RM(rate-monotonic)调度算法和动态的抢占式最早截止期优先任务调度算法(Preemptive Earliest Deadline First Algorithm，PEDFA)。

With Death guitarist Schuldiner adopting vocal duties, the band made a major impact on the scene.

随着死亡的吉他手Schuldiner接受主唱的职务，乐队在现实中树立了重要的影响。

But he could still end up breakfasting on Swiss-government issue muesli because all six are accused of nicking around 45 million pounds they should have paid to FIFA.

不过他最后仍有可能沦为瑞士政府&议事餐桌&上的一道早餐，因为这所有六个人都被指控把本应支付给国际足联的大约4500万英镑骗了个精光。