Review: fork-join decomposition.
回顾：fork - join分解。
Listing 1. Merge-sort using the fork-join library.
清单1.使用fork - join库进行合并排序。
In this regard, JPFF can be viewed as an extended, distributed fork-join framework.
从这个角度来讲，我们可以把JPPF看作一个扩展的、分布式的fork - join框架。
It's easy to express such problems using fork-join, as you saw in the previous installment.
用fork - join可以很容易地表示这类问题，正如您在上一期中看到的那样。
The fork-join framework reduces contention for the work queue by using a technique known as work stealing.
fork - join框架通过一种称作工作窃取(work stealing)的技术减少了工作队列的争用情况。
The pattern in Figure 14 presents the correct way to model parallel branching by using a matching fork-join pair.
图14中的模式展示了使用匹配的 fork-join 对建立并行分支模型的正确方法。
Listing 2 shows an example of a problem that is suitable to a fork-join solution: searching a large array for its maximal element.
清单2显示了一个适合使用fork - join解决方案的问题示例：在大型数组中搜索其中的最大元素。
You then use the description to actually execute the array operations (which USES the fork-join framework under the hood) in parallel.
然后用该描述并行地执行数组操作(幕后使用的是fork - join框架)。
The principal benefit of using the fork-join technique is that it affords a portable means of coding algorithms for parallel execution.
使用fork-join技术的主要好处是，它提供了一种编写并行执行的算法的简便方法。
For most runs, the number of threads in the fork-join pool was equal to the number of hardware threads (cores times threads-per-core) available.
对于大多数运行，fork - join池中的线程数量与可用的硬件线程(内核数乘以每个内核中的线程数)相等。
The fork-join framework supports several styles of ForkJoinTasks, including those that require explicit completions and those executing cyclically.
fork - join框架支持几种风格的ForkJoinTasks，包括那些需要显式完成的，以及需要循环执行的。
To assess the effectiveness of ParallelArray, I wrote a simple, unscientific program that runs the query for various sizes of array and fork-join pools.
为了评估ParallelArray的效率，我编写了一个简单的程序，针对各种大小的数组和fork-join池运行查询。
Of course, this is a very simple example, but the fork-join technique is suitable for a wide variety of searching, sorting, and data analysis problems.
虽然这个示例非常简单，但是fork - join技术可用于各种各样的搜索、排序和数据分析问题。
The fork-join approach offers a portable means of expressing a parallelizable algorithm without knowing in advance how much parallelism the target system will offer.
fork-join方法提供了一种表示可并行化算法的简单方式，而不用提前了解目标系统将提供多大程度的并行性。
This kind of parallel decomposition is often called fork-join because executing a task forks (starts) multiple subtasks and then joins (waits for completion) with them.
这种并行分解方法常常称作fork-join，因为执行一个任务将首先分解（fork）为多个子任务，然后再合并（join）（完成后）。
This is typical of fork-join problem implementations because the process of recursively dividing the problem will create a potentially large number of new Problem objects.
这在fork-join问题实现中很常见，因为递归分解问题的过程将会创建大量的新Problem对象。
This cyclic dependency between the join and the decision, and the join and the fork (where the join must be executed before the decision or fork and vice versa) is the reason why a deadlock occurs.
join和decision以及join和fork之间的这种循环依赖关系(其中join必须在decision或fork之前执行，反之亦然)便是发生死锁的原因。
Similarly, every fork should eventually be followed by a matching join, which combines all the paths starting from the fork.
同理，每个fork最终也都应跟随一个匹配的join，并由后者组合从 fork开始的所有路径。
We already showed the decision/merge mapping in the MultiMethod project, so this part will concentrate on the fork/join mapping.
我们在 MultiMethod项目中已经介绍了decision/merge映射，因此该部分将集中讨论一下fork/join 映射。
Revisiting the example from Listing 6, notice that max() is a method already provided on parallel collections, so there is no need to define and invoke a fork/join task directly, as in Listing 7
再看一下清单6中的示例，注意到，max()是一个已经在并行集合中提供的方法，因此没有必要直接定义和调用fork/join任务，如清单 7 所示
Decision and merge are always mapped to several input and output criteria-one for each branch, while fork and join correspond to a single output and input criterion, respectively.
Decision和merge始终映射到多个输入和输出条件，每个分支对应一个条件，而fork和join则分别对应于一个输出和输入条件。
We describe solutions based on gateway pairs that are built with the decision, merge, fork, and join modeling elements.
我们基于用decision、merge、fork和join建模元素构建的网关对来描述解决方案。
Similarly, the same requirement applies to the connections between the fork and the join.
同理，此要求也适用于fork和join之间的连接。
It has exactly the same kind of cyclic dependency as the anti-pattern in Figure 19, now between the join and the fork.
它与图19中的循环依赖关系的类型完全相同，但现在涉及的是join和fork。
For alternative branching, an identical pattern results where the fork is replaced by a decision and the join is replaced by a merge.
为了进行可选分支，会产生一个相同的模式，在其中fork被替换为decision,join被替换为merge。
The role of the join action is to synchronize multiple threads of parallel execution started by fork actions.
join动作的功能是要同步fork动作启动的多个并行执行的线程。
So the simulation implements a semantics where items get multiplied by a fork and the join does not behave symmetrically, i.e., it does not undo the multiplication.
因此，模拟实现了一个语义，在其中，项目被某个fork增殖成几份，而join不会做出与之对称的行为，也就是说，它不会撤消增殖操作。
Cyclic deadlocks through join-fork and join-decision pairs.
因join - fork和join - decision对导致的循环死锁。
All the paths connecting Fork and Join nodes will be implemented in parallel.
与Fork和Join节点相连接的路径可以并行实现。
All the paths connecting Fork and Join nodes will be implemented in parallel.
与Fork和Join节点相连接的路径可以并行实现。
应用推荐