传统的串行测试方法和串行任务调度方法日益体现出了它的局限性。
Traditional method of serial testing and serial scheduling method increasingly reflect its limitations.
最初并未预期或计划将其用于配置文件、远程过程调用、对象串行化、数据库转储和类似的面向开发的任务。
Its use for config files, remote procedure calls, object serialization, database dumps, and similar developer-oriented tasks wasn't anticipated or planned for.
如果只配置了一个CM代理，那么archpro可能成为一个瓶颈，因为这一个代理需要串行地处理由4个并行的CSLD任务线程请求的归档操作。
If there is just one CM agent configured, archpro could become a bottleneck since this one agent would need to serialize the archiving operations requested by the four parallel CSLD task threads.
从理论上来说，您可以采用无数的硬件来处理并行执行的部分，甚至在接近0的时间内完成这些任务，但是对于串行部分来说，这样做不会有任何提高。
In theory you could apply an infinite amount of hardware to do the parallel part in zero time, but the sequential part will see no improvements.
模型中应用的可用性用一个串行rbd来描述，对于每个网格节点上运行的任务，其可用性用概率模型描述。
In the model the overall availability of a grid application is measured by using a serial RBD, for the tasks on a grid node, the availability is measured by using a probabilistic model.
在利用串行调度启发式方法解决资源受限的运输任务调度问题（RCTTSP）的基础之上，提出了一种混合遗传算法（HGA）。
This paper proposes a Hybrid Genetic Algorithm(HGA) based on a serial scheduling heuristic method to solve the Resource-Constrained Transport Task Scheduling Problem(RCTTSP).
采用基于排列的方法和串行项目进度生成机制，结合多项目的任务列表，可以保证所得调度方案满足项目优先关系约束。
Combined with method based on order and serial schedule generation scheme and multi-project task list, the gotten scheduling scheme can meet the project schedule constraints of precedence relations.
某些任务并行执行更合理，但是有一些必须串行执行以达到最佳的效率。
Certain tasks make more sense to run in parallel, and some must remain serial for maximum efficiency.
在硬件上采用CPLD来完成系统的逻辑控制，利用UART(通用异步收发器)来进行串行通信，使DSP从繁忙的控制任务中解放出来。
In the hardware field, CPLD is entitled for system logical control; Serial communication derived from UART (Universal Asynchronous Receiver Transmitter) frees the DSP of burdensome control.
该算法通过识别并行循环任务以及通过确定调用上下文关系识别并行过程任务，来划分串行程序中的并行成份。该算法是对串行程序实施并行分解的基础。
This algorithm is the basis for decomposing parallelism in a sequential program and is implemented with recognizing parallel loop tasks and parallel procedural tasks by determining the call context.
该算法通过识别并行循环任务以及通过确定调用上下文关系识别并行过程任务，来划分串行程序中的并行成份。该算法是对串行程序实施并行分解的基础。
This algorithm is the basis for decomposing parallelism in a sequential program and is implemented with recognizing parallel loop tasks and parallel procedural tasks by determining the call context.
应用推荐