该算法既是可伸缩的，也可并行化。
如果需要的话，对并行化进行控制也可以通过声明的做法。
If needed, control over the parallelism is also done declaratively.
最后针对多目标进化算法给出了几种并行化方法。
At last we put forward some methods of paralization of MOEAs.
不过，不能将备份并行化，并且没有直接到存储管理器的接口。
However, you are not able to parallelize your backups and there is no direct interface to a storage manager.
本文介绍一种新的并行化第一原理分子动力学程序。
A new paralleled first-principle program has been introduced in this paper.
程序并行化不需要分层简化，只要顺序扫描一遍即可。
The program is parallelized not by hierarchical simplification, but by only one pass sequential scanning.
为了增加CommonStore归档吞吐量，建议将归档线程并行化。
To increase the CommonStore archiving throughput, it is recommended to parallelize the archiving threads.
当时它是一个LINQProvider，可以自动地将查询并行化。
At that time it was a LINQ provider that could automatically parallelize queries.
不过，不能将备份并行化，并且没有直接到存储管理器的接口。
However you are not able to parallelize your backups and there is no direct interface to a storage manager.
还有，这些新特性以及一个新的数据类型使用了向量指令进行并行化的计算。
Also, new intrinsics and a new data type use the vector instructions for parallel calculation.
使用onbar可以将备份并行化，还能执行指定时间点的备份。
With onbar you can parallelize your backups and you are also able to perform a point-in-time restore.
这种方法最大限度地减少数据移动，同时利用AMPP架构实现并行化联接。
This approach minimizes data movement while taking advantage of the AMPP architecture to parallelize the join.
该方法可以充分利用程序中的数据相关性，提高程序并行化程度。
It can make use of the data dependence in program fully and furthermore improve the parallel degree of program.
本文利用分布并行计算系统来实现分形视频压缩算法的分布并行化。
In this paper we utilize parallel processing techniques to implement the fractal video compression algorithm to reduce the run time.
为了让其他人在他们所做的改变被接受之前可以进行测试，有一些开发需要并行化。
Some of the parallelization of development was necessary to allow others to test large changes before they were accepted.
服务器农场模式是一个很好的方式，实现并行化效率高，因为它是自动平衡。
The server farm pattern is a good way of achieving high parallelization efficiencies because it is self-balancing.
不仅映射和减法支持并行化，映射和减法运算也可结合到单个并行循环中，这样效率更高。
Not only are mapping and reduction amenable to parallelization, but the map and reduce operations can be combined into a single parallel pass, which is even more efficient.
因此，有限元节点代码可以被并行化、在不同的基于PV M机群结点上运行。
Therefore, the finite element code can be parallelized and executed on different cluster nodes on which PVM is available.
由于使用源代码管理工具可以保持开发的同步并行进行，这样就可能实现开发的部分并行化。
Some of this parallelization of development was made possible through the use of source code management tools because of the ability to keep parallel lines of development synchronized.
这种并发可以避免在每一次门诊所在的位置或涉及的患者这个层次上实现并行化。
This concurrence avoids the need to parallelize at the level of each clinic location or patient.
因此，有限元节点代码可以被并行化、并能在基于不同的PV M机群结点上运行。
Thus, nodal code of Finite Element Method can be parallelized and operated in the connecting point of different groups of PVM.
在此图中，最佳的情况是棕色的线，它展示了一个10%顺序性(因此90%可并行化)的问题。
In the best case for this graph, the brown line shows a problem that's 10% sequential and, therefore, 90% parallelizable.
关于这个问题的一个很明显的解决方案是去掉init命令的串行特性，将其替换成并行化操作。
An obvious solution to this problem is to remove the serial nature of the init command and replace it with something that operates more in parallel.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
为了提高计算效能，研究更复杂的模型，很有必要将该有限元反演系统的算法实现并行化。
It is necessary to parallelize the algorithm of the finite element inversion system in order to improve computation efficiency and to study more complex models.
不幸的是，并非所有的问题都可以并行化，而且还有管理处理器的开销，所以速度的提高并没有这么大。
Unfortunately, because not all of the problem can be parallelized and there's overhead in managing the processors, the speedup is quite a bit less.
基于MIMD并行计算机模型，本文讨论了CFD问题应用显式有限差分方法的并行化问题。
Based on MIMD parallel computer model, parallel implementation of explicit finite difference methods has been discussed for computational fluid dynamics (CFD) problems.
没有进行显式的规划；相反，依赖关系简单地定义了服务初始化的流程，这个过程中隐含着并行化的操作。
No explicit planning occurs; instead, the dependencies simply define the flow of service initiation, with parallelization implicit in the process.
没有进行显式的规划；相反，依赖关系简单地定义了服务初始化的流程，这个过程中隐含着并行化的操作。
No explicit planning occurs; instead, the dependencies simply define the flow of service initiation, with parallelization implicit in the process.
应用推荐