Listing 1. Pseudo-code for generic divide-and-conquer parallel algorithms.
清单1.通用divide - and - conquer并行算法的伪代码。
Discusses the sequential and parallel algorithms about matrix optimum path.
本文讨论了矩阵最优路径的串行和并行算法。
Two ways in designing efficient parallel algorithms for interval graphs are discussed.
对区间图上的图问题并行求解，给出两种算法设计方法。
After parallel algorithms came grid computing, which ran parallel computations on idle desktops.
并行算法发明以来，首先迎来的是网格计算，网格计算是借助空闲的桌面计算机资源进行并行计算。
We'll use the algorithm described in the section on parallel algorithms to solve this problem elegantly.
我们将使用在并行算法一节中介绍的算法来很好地解决这个问题。
Parallel programming has its own set of parallel algorithms that take advantage of the underlying hardware.
并行编程有自己的一些并行算法，它们可以充分利用底层硬件的性能。
Our work focuses on automatic registration technology for RS images and its efficient parallel algorithms.
本文全面深入地研究了基于流域变换的图像分割串、并行算法。
Part 2 covers parallel algorithms, how to write parallel programs, how to set up clusters, and cluster benchmarking.
第2部分将介绍并行算法的知识，并介绍如何编写并行程序、如何构建集群以及如何进行基准测试。
This article covers parallel algorithms, and shows you how to write parallel programs, set up clusters, and benchmark clusters.
本文介绍了并行算法，并介绍了如何编写并行程序、构建集群以及对集群进行基准测试。
This architecture releases application researchers from the complicated data-driven parallel algorithms and their programming.
该体系结构大幅降低了有向数据依赖关系计算方法并行程序的研制难度。
We also implemented several typical message-passing based parallel algorithms in GOOMPI, and compared them with their MPI counterparts.
利用GOOMPI实现了若干典型的基于消息传递的并行算法，并与相应的MPI实现进行了对比。
Hence, these local and parallel algorithms only involve one small original problem on coarse mesh and some correction problems on local fine grid.
因此，这种局部和并行算法仅仅涉及一个粗网格上的整体逼近和细网格上的局部校正。
This model made full use of the pre-judgment knowledge in the image, and designed a workstation of COW cluster to achieve the parallel algorithms.
该模型充分利用图像中每一个像素的预判断知识，设计COW工作站机群以结合实现并行算法。
Some experiments of all these parallel algorithms are presented, the testing results indicate that the proposed algorithms are of high efficiency.
对以上算法分别进行测试，试验结果表明算法是高效可行的。
In this paper, I design a series of high-efficiency serial schemes and parallel algorithms for one-dimension and two-dimension hyperbolic equation.
本文针对一维和二维双曲型方程的初边值问题，设计了几类高效率串行格式和并行算法。
So, a new sample-based classification algorithm, PSS, is proposed. AS, HS and VS algorithms which are parallel algorithms of PSS are presented also.
因此提出一种新的基于抽样的数据分类算法PSS，并提出三种PSS并行化算法AS，HS和VS算法。
Moreover, the structure description of the task and the parallel algorithms are studied for the strategy of the information integration in this paper.
此外，本文对信息的融合策略从任务结构描述、并行处理方面做了研究。
The test results show that the PSS algorithm as well as its parallel algorithms are high efficient when they are used in classification of massive database.
实验结果表明，PSS算法及其并行化算法是一种高效的数据分类算法，尤其适用于解决海量数据库中的数据分类问题。
In this paper, a class of parallel algorithms for the problems in differential algebraic equations are proposed. The errors of the algorithms are estimated.
本文提出求解微分代数方程的一类并行算法，进行误差估计。
It can guide the optimal matching of the parallel applications and the parallel machines, and is beneficial to the design and improvement of the parallel algorithms.
这对算法和并行机的最优匹配有指导作用，同时有益于并行算法设计和改进。
The SCAN operation is a basic block for building other parallel algorithms. This paper first describes SCAN operations and the design of their sequential and parallel algorithms.
SCAN算法是构成某些并行算法的一个简单而常用的基本模块．本文首先描述了SCAN操作及其串行和并行算法的设计；
The Accelerator system encourages you to express data-parallel algorithms in terms of whole array operations which leads to efficient implementations for various back ends (" targets ").
Accelerator系统鼓励你以整个数组操作的方式来表述数据并行处理算法，对不同的后台程序(或“目标”)的实现更有效。
There were problems in traditional parallel algorithms for mining frequent itemsets more or less: data deviation, large scale communication, frequent synchronization and scanning database.
传统的挖掘频繁项集的并行算法存在数据偏移、通信量大、同步次数较多和扫描数据库次数较多等问题。
In the early 1990s, as a demonstration of the power of parallel algorithms, members of Leiserson's group designed a chess-playing program that finished second in the 1995 computer chess championship.
在上个世纪九十年代的早期，作为并行算法的演示案例，Leiserson小组的成员设计了一个在秒钟级就可以完成计算的国际象棋程序，并参加了1995年的计算机象棋大赛。
Parallel programming is not just a new library or a new set of language features. It is a new way of designing and programming, and often requires new algorithms.
并行编程并非仅仅是个新的程序库或是新的语言特性集，而是全新的设计与编程方式，通常需要使用新的算法。
The principal benefit of using the fork-join technique is that it affords a portable means of coding algorithms for parallel execution.
使用fork-join技术的主要好处是，它提供了一种编写并行执行的算法的简便方法。
Divide-and-conquer algorithms are often useful in sequential environments but can become even more effective in parallel environments because the subproblems can often be solved concurrently.
divide - and - conquer算法也可用于顺序环境中，但是在并行环境中更加有效，因为可以并行处理子问题。
Instead, Hadoop can be viewed as a way to distribute both data and algorithms to hosts for faster parallel processing.
相反地，Hadoop可以被视为一种可以同时将数据和算法分配到主机以获得更快速的并行处理速度的方法。
All sorts of sorting, searching, and numerical algorithms are amenable to parallel decomposition. in the future, standard library mechanisms like Arrays.sort .
所有的排序、搜索和数字算法都可以进行并行分解(以后，像Arrays . sort这样的标准库机制将会使用fork - join框架，允许应用程序免费享有并行分解的益处)。
All sorts of sorting, searching, and numerical algorithms are amenable to parallel decomposition. in the future, standard library mechanisms like Arrays.sort .
所有的排序、搜索和数字算法都可以进行并行分解(以后，像Arrays . sort这样的标准库机制将会使用fork - join框架，允许应用程序免费享有并行分解的益处)。
应用推荐