Node scheduling is a commonly used way for large-scale WSNs to extend the lifetime.
节点调度是一种常用的延长大规模无线传感器网络生命期的方法。
Good node scheduling, which not to diminish the capability of network, can increase the lifetime of system.
良好的结点调度算法可以在保证网络性能的前提下，延长系统的寿命。
The purpose of node scheduling is to schedule as many as possible redundant nodes into sleep mode, thus to reduce unnecessary energy cost, and to extend the lifetime of the networks.
节点调度的目标是调度尽可能多的冗余节点进入休眠状态，减少不必要的能量消耗，以延长网络寿命。
This ensures that the state can be recovered from either the scheduling node or the execution node in event of failure.
这样就确保了当调度节点或者执行节点出现故障时那些状态可以恢复。
Neither the scheduling node nor the execution node discard the job information until it is passed on to, and accepted by, the other node.
调度节点和执行节点都不会丢弃作业的信息，直到它被传递到其他节点并被接受。
The scheduling node and the execution node use a protocol that ensures that the state information is kept on disk by at least one of them.
调度节点和执行节点通过一个协议来确保至少它们其中一个要在磁盘上保持那些状态信息。
It queries node managers for information about resources, makes high level scheduling decisions, and implements them by making requests to cluster controller.
它向节点管理员询问资源信息，做出高级计划决策，并通过向集群控制器发出请求来实现。
The scheduling arithmetic implemented in switching node is one of the important instruments to solve this problem.
在交换节点处实施的调度算法是解决这个问题的重要手段之一。
Node needs Grid-based security and internal managing mechanisms. In this thesis a tasks scheduling algorithm is also presented based on priorities and multiply queue.
节点需要基于网格的安全机制和内部管理机制，本文提出了循环优先级比的任务调度算法和基于这种算法的任务组织结构。
On the basis of analyzing process node's time attribute, through the time scheduling algorithm, it achieves workflow management and control of process time based on process node.
在对流程节点时间属性分析的基础上，通过流程节点的时间调度算法实现对流程的基于流程节点的时间管理与控制。
The necessary and sufficient conditions are given for the schedulability of real time connections at each network node under preemptive earliest due date scheduling policy.
在抢先最早预定日期调度策略下，给出了任意网络结点上实时连接调度能力的充分必要条件。
Constructing a connected covering node subset is one of key technologies for enlarging lifetime and sleeping scheduling in wireless sensor networks, which is a significantly important research area.
构造无线传感网络中具有连通覆盖特性的节点子集是实现网络休眠调度、延长网络生命周期的关键技术之一，具有重要的研究意义。
A dynamic scheduling algorithms studied in references are based on centralized grid system or part-distributed grid system, in which there are center node (s) to manage resources.
目前研究的动态任务调度算法都基于集中式或部分分布式网格系统，系统中心节点(组)进行资源管理。
This paper brings the list scheduling method into the tasking allocation problem on an unbounded number of processors. The proposed algorithm is called node - transferring scheduling algorithm (NTSA).
文章提出了一种处理机个数无限的任务分配的列表调度算法，称之为节点迁移调度算法(ntsa)。
To optimize node selections for grid jobs under de-centralized scheduling frameworks, the algorithm of random multi-start hill climbing is proposed.
为优化无中心式调度框架下网格作业的节点选择，提出了随机多起点爬山算法。
Task scheduling is done to determine the way of task performance in the same node.
任务调度则涉及到将在同一结点的任务按怎样的方式进行调度执行。
Task scheduling is done to determine the way of task performance in the same node.
任务调度则涉及到将在同一结点的任务按怎样的方式进行调度执行。
应用推荐