实时任务

基于XML的人机交互微装配机器人实时任务规划

Real-Time Task Plan for Human-Robot Interaction of Micro-assembly Robot Based on XML

Linux周期性实时任务的开发

Programming of periodic real-time task in Linux

标准Linux内核是不可抢占的，导致较大的延迟，增强内核抢占性能、降低内核响应时间，可提高系统内核对实时任务的响应能力。

Standard Linux kernel is non-preemptive , which leads to long latency .

研究了异构集群系统中具有QoS需求的实时任务容错调度问题。

Fault-tolerant scheduling for real-time tasks with QoS requirements on heterogeneous clusters .

AP在大型实时任务中的应用

The Application of AP in Large Real Time Task

针对单处理器系统的周期性实时任务集，基于非精确计算，提出FT/FA（FaultTolerance/FrequencyAssurance）调度方法。

For the periodic real-time task sets on uniprocessor systems , FT / FA ( fault-tolerance / frequency assurance ) scheduling of imprecise computation was proposed .

OPC实时任务系统动态调度算法的研究与设计

The Study and Desing of Dynamic Scheduling Algorithms in OPC Real-Time Task System

基于非抢占RMS的分布式控制系统中实时任务调度算法

Scheduling Algorithm for Real-time Tasks in Distributed Control System based on RMS

该设计方法通过对控制系统中各实时任务的动态调度来提高CPU的利用率。

Through the dynamic dispatching of realtime tasks in the control system , utilization of CPU can be improved .

随着IP宽带技术的发展和广泛应用，网络上多媒体信息和实时任务的数量与日俱增。

With the development of Internet protocol ( IP ) broadband technology , a lot of multimedia information and real tasks in Internet steadily increases .

实验结果证明，本文所做的改进使Linux能够在基本不增加系统负担的情况下调度微秒级的实时任务。

The experiment result proves that the improvement enables Linux to scheduling the realtime task of microsecond grade in the situation of not increasing system load .

FF现场总线系统中实时任务的建模与调度

Modeling and scheduling for real-time tasks in FF System

调度器还需要面对一些互相冲突的目标，例如既要为关键实时任务最小化响应时间，又要最大限度地提高CPU的总体利用率。

The scheduler can also be faced with such conflicting goals as minimizing response times for critical real-time tasks while maximizing overall CPU utilization .

利用Windows消息驱动机制和时钟中断，成功地解决了数控电火花加工中多任务和实时任务处理的问题。

By using message drive mechanism of Windows and timer interruption , multi task and real time task are solved in EDM NC ( numeric control ) system successfully .

ORB中实时任务调度的实现

Implementation of Real Time Scheduling in ORB

这将延缓shell的执行，因此需要在另一个shell中运行实时任务，通过将任务放到使用&字符的后台中运行即可达到此目的。

This suspends execution of the shell , so your real work needs to be running in another shell , which you accomplish by placing the task in the background using the & character .

本文对可重构操作系统中调度器和放置器的算法做了深入的研究，解决了2D区域模型下的硬件实时任务在线放置和调度问题。

The thesis study deeply about the algorithm of placer and scheduler for reconfigurable system , and solves the on-line real-time task placement and scheduling problems in 2D area model .

提出实时任务分割原理，并在MTUCOS中给出了相关的实现机制。

Putting forward the principles of real-time task splitting , and furthermore , offering the realizable mechanism in MT_UCOS ;

CFS调度模块使用它进行组调度，而用于实时任务的调度模块则不会使用这个函数。

The CFS scheduling module uses it for group scheduling , while the scheduling module for a real-time task does not use it .

在保证实时任务服务质量（QualityofServiceQOS）要求的前提下，通过改变实时任务的运行周期，接纳尽量多的服务请求，以达到提高实时系统吞吐率的目的。

To ensure that the basic QOS ( Quality of Service ) needs of individual tasks in the task set , via changing realtime tasks ′ cycle , the realtime System can accept service requests as much as possible and achieve high system throughput .

在可重构系统中，硬件电路的配置信息存储在静态RAM中，容易受到周围环境的干扰，使硬件电路出现故障，故此提出了一种实时任务容错调度算法，以提高系统的可靠性。

In reconfigurable system , circuit configure information is stored in static RAM and is susceptible to electromagnetic interference which can cause circuit fault . So a fault-tolerant scheduling algorithm is proposed to improve system reliability .

根据ASOS的特点和实际实时任务的特性，该文提出了一种建立在RM上的算法：NPT算法。

According to the characteristic of ASOS and real-time task , an approach based on RM ( rate-monotonic ) algorithm , NPT ( non-preemptive threshold ) algorithm is investigated .

在VxWorks系统下，GOOSE报文发送、接收以及开入状态读取、开出信号实现都是通过实时任务来完成的，这些任务之间采用信号量进行通信。

In Vx Works , these events were finished through the real-time task , such as the GOOSE message sending and receiving , reading the input status and finishing the output signal , and semaphores was communicated between these tasks .

并且按照Best-Fit启发式策略为实时任务主版本寻找最佳满足处理机，使尽可能多的实时任务副版本以被动方式运行。

The best-fit heuristics try to find " best-fit " processors for scheduling primary copies such that as many backup copies as possible can be executed passively .

实验结果表明，RPDS可以合理地为各种类型应用分配处理器时间，并且降低了实时任务的截止期错失率。

Experimental results show that RPDS can allocate processor time to various application classes reasonably and reduce the deadline miss ratio of real-time tasks effectively .

RPDS将处理器时间流分成连续的小段，并在每一小段中强制为非硬实时任务分配一个时间片。

RPDS partitions CPU time flow into continuous segments , and in each segment RPDS will forcibly assign one time slice to non-hard real-time tasks .

软实时任务和非实时任务放在一个队列中，由指针数组的元素run-queue[1]指向，采用RR调度算法，通过抢占方式保证软实时任务优先于非实时任务。

The soft real-time tasks and non real-time tasks were put into the other run queue pointed by run_ - queue [ 1 ] , the other element of the point array , and RR schedule strategy was used for them .

在分析了磁力轴承控制系统任务特性和经典的RM及EDF调度算法特性基础上，提出了控制系统中具有智能决策能力的实时任务调度算法。

On the basis of analyzing the task characteristics of the control systems of magnetic bearings and the characteristics of the classical RM and EDF algorithms , a real time task scheduling algorithm is presented , which has intelligent decision ability .

FORS算法采用最早最迟开始时间优先、最优化空白区域管理和配置重用的调度原则，能反映实时任务的紧迫度，快速地调度实时可配置硬件任务，同时有效的管理可重构资源。

The algorithm adopts the scheduling principle of earliest latest staring time first , which will reflect different emergency levels of real time tasks . The algorithm constructs a fast and correct empty resource management and is based on configuration reuse .

分布式计算机系统中资源受限时的实时任务动态调度问题

Timing-Critical Task Dynamic Scheduling Problem with Resource-Restraint in Distributed Computer System