单词查询
parallelized
释义
「
」
网络释义： 并行；并行模型；
例句
Therefore, the finite element code can be parallelized and executed on different cluster nodes on which PVM is available.
因此，有限元节点代码可以被并行化、在不同的基于PVM机群结点上运行。
Each of these problems can be easily parallelized using divide-and-conquer, and can be easily represented as fork-join tasks.
其中的每个问题都可以用divide-and-conquer轻松地并行化，并能轻松地表示为fork-join任务。
Few tasks can be truly parallelized in such a way as to require no coordination between threads.
如果线程之间不需要协调，那么几乎没有任务可以真正地并行。
In most cases, a query involves some operators that either cannot be parallelized, or that slow down parallel execution.
大多数情况下，查询包含某些无法进行并行化或会减慢并行执行速度的运算符。
Provide the realization scheme of the simulated distributive and parallelized cryptographic algorithm.
给出模拟的分布式、并行化密码算法实现方案。
Thus, nodal code of Finite Element Method can be parallelized and operated in the connecting point of different groups of PVM.
因此，有限元节点代码可以被并行化、并能在基于不同的PVM机群结点上运行。
Assuming that an operation can be parallelized, the more computationally expensive it is, the greater the opportunity for speedup.
假定某个操作可并行化，则它的计算开销越高，加速的可能性就越大。
A variable declared with lastprivate cannot be used as the index inside a parallelized loop.
使用lastprivate声明的变量不能用作并行化循环中的索引。
This paper first describes the steps involved in primal-dual interior point algorithm and explains which step in it can be parallelized.
首先介绍了原-对偶内点算法的主要计算步骤，阐明哪一步上可以进行并行化处理。
The complete solution procedure is parallelized.
因此，有限元节点代码可以被并行化、在不同的基于PVM机群结点上运行。
Each of these problems can be easily parallelized using divide-and-conquer, and can be easily represented as fork-join tasks.
其中的每个问题都可以用divide-and-conquer轻松地并行化，并能轻松地表示为fork-join任务。
Few tasks can be truly parallelized in such a way as to require no coordination between threads.
如果线程之间不需要协调，那么几乎没有任务可以真正地并行。
In most cases, a query involves some operators that either cannot be parallelized, or that slow down parallel execution.
大多数情况下，查询包含某些无法进行并行化或会减慢并行执行速度的运算符。
Provide the realization scheme of the simulated distributive and parallelized cryptographic algorithm.
给出模拟的分布式、并行化密码算法实现方案。
Thus, nodal code of Finite Element Method can be parallelized and operated in the connecting point of different groups of PVM.
因此，有限元节点代码可以被并行化、并能在基于不同的PVM机群结点上运行。
Assuming that an operation can be parallelized, the more computationally expensive it is, the greater the opportunity for speedup.
假定某个操作可并行化，则它的计算开销越高，加速的可能性就越大。
A variable declared with lastprivate cannot be used as the index inside a parallelized loop.
使用lastprivate声明的变量不能用作并行化循环中的索引。
This paper first describes the steps involved in primal-dual interior point algorithm and explains which step in it can be parallelized.
首先介绍了原-对偶内点算法的主要计算步骤，阐明哪一步上可以进行并行化处理。
The complete solution procedure is parallelized.