A clock per task (scheduling entity), vruntime, will be introduced (wall_time/task_weight) and an approximated average initializes the clock of a new task.
将引入每个任务（调度实体）的时钟vruntime（wall_time/task_weight），并且将使用近似的平均时间初始化新任务的时钟。
It just occurred to me that good, simple group scheduling software is a lot like the clock in the Weasley's living room in the Harry Potter series.
我觉得一个好的、简单的群组日程安排软件非常类似于Harry Potter丛书中Weasley的起居室里的那个时钟。
Refer to our previous tip Job scheduling with cron and at to learn how to set your own crontab for your new alarm clock.
请参考前一篇技巧文章Jobschedulingwith cron andat，学习如何针对新的闹钟程序设置crontab。
Based on LFVC (Leap Forward Virtual Clock), this paper proposes a scheme named WLFVC, which is a fully distributed wireless scheduling scheme for WLAN (wireless LAN).
基于前跳虚时钟(LFVC)算法，本文提出了适用于无线以太网(WLAN)环境的全分布式的调度算法WLFVC。
How to arrange these events subjected to some constraints on a clock is referred as the Periodic event Scheduling Problem (PESP).
按时钟模式对满足一定条件约束的周期事件进行合理的安排，这一问题被称为一般周期事件排序问题。
First, aiming at the distribution of NCS, specially the multi-master system such as CAN, there is no unified network clock, so the scheduling and management are affected.
首先针对网络控制系统分布式的特点，特别是类似于CAN总线的多主系统，由于没有单一的时钟提供同步机制，影响调度管理的同步。
This paper presents the TAM optimization and test scheduling algorithm for multi-clock SOC, and it aims at decreasing test time of multi-clock SOC.
该文提出了用于多时钟域soc的TAM优化与测试调度算法，以减少多时钟域soc的测试时间。
A yield driven clock skew scheduling algorithm is proposed in presence of process variations.
针对工艺参数变化的情况，提出一种成品率驱动的时钟偏差安排算法。
This paper presents an effective approach for clock skew scheduling that can reduce the center error square and assign slacks incrementally.
本文提出了一种有效的方法时钟歪斜调度中心可以减少误差平方和增量分配的休闲裤。
A new clock skew scheduling algorithm is proposed. This algorithm generates timing constraints which can effectively promote the area optimization of logic syn thesis.
提出了一种新的时钟偏斜规划算法，该算法所生成的时序约束可以有效地促进逻辑综合工具的面积优化。
Experiment results show that this approach can efficiently reduce area of logic synthesis results compared with the traditional clock skew scheduling algorithm, without degrading the performance.
实验结果表明：按权重分配裕量的方法相对于平均分配裕量，能够在不降低电路性能的情况下，更加有效地降低逻辑综合结果的面积。
Experiment results show that this approach can efficiently reduce area of logic synthesis results compared with the traditional clock skew scheduling algorithm, without degrading the performance.
实验结果表明：按权重分配裕量的方法相对于平均分配裕量，能够在不降低电路性能的情况下，更加有效地降低逻辑综合结果的面积。
应用推荐