The same holds for the fork and join.
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节点相连接的路径可以并行实现。
The fork and join in Figure 1 cannot execute due to their dangling inputs.
图1中的fork和join由于有悬空输入，它们将无法执行。
We used a fork and join and placed additional copies of the tasks between them.
我们使用了一个fork和一个join，并将任务的其他副本置于两者之间。
All inputs of the decision and the merge, as well as of the fork and join, must be connected.
decision和merge以及fork和join之间的所有输入都必须连接在一起。
A could bypass the fork and join, but it still needs to enter and leave the process fragment in the upper branch of the fork.
A可以绕过fork和join，但它仍然需要进入和离开 fork 的靠上那条分支中的流程片断。
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则分别对应于一个输出和输入条件。
The steps branch out using a fork, and come back together using a join.
步骤使用分叉分出，并使用联合返回。
The TaskBarrier class mentioned above was used by the fork/join framework to manage the boundaries between the various tasks, and merge their results; in other words: to join the tasks.
前面提到的TaskBarrier类被fork/join框架用来管理不同任务的边界，并合并运行结果，换句话说就是连接任务。
Figure 1 shows an example process with dangling control flow (small white arrows) and data flow (small gray arrows) inputs and outputs in a fork and a join.
在图1显示的示例流程中，有一个fork和一个join，其中有悬空控制流(白色小箭头)和数据流(灰色小箭头)输入和输出。
The creeks Rattlesnake, Butler, Lolo, Rock and Deep shimmer and surge; the Blackfoot and the Bitterroot rivers join the Clark Fork just outside of town.
响尾蛇、管家、罗罗、岩石和深水这几条溪闪亮而汹涌；黑足和比特鲁特和刚好在城外汇入克拉克•福克河。
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 所示
However, such a solution should be used with care in models that contain both types of branching, i.e., forks and decisions, to avoid suddenly closing a fork with a merge or a decision with a join.
但是，在同时包含两类分支(即fork和decision)的模型中，使用此类解决方案应十分谨慎，以避免在不经意间用一个join关闭一个fork或用一个merge关闭一个decision。
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 sorting and searching problems, the fork-join library gives you an even easier means of expressing parallelizable operations on data sets: the ParallelArray classes.
对于排序和搜索问题，fork - join库提供了一种表示可以并行化的数据集操作的非常简单的途径：parallelarray类。
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技术可用于各种各样的搜索、排序和数据分析问题。
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任务。
We describe solutions based on gateway pairs that are built with the decision, merge, fork, and join modeling elements.
我们基于用decision、merge、fork和join建模元素构建的网关对来描述解决方案。
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。
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之前执行，反之亦然)便是发生死锁的原因。
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不会做出与之对称的行为，也就是说，它不会撤消增殖操作。
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）（完成后）。
The fork-join framework supports several styles of ForkJoinTasks, including those that require explicit completions and those executing cyclically.
fork - join框架支持几种风格的ForkJoinTasks，包括那些需要显式完成的，以及需要循环执行的。
The third cycle starts in the fork preceding the end node, and leads back to the join following the decision.
第三个循环从结束节点之前的 fork中开始，并引回decision之后的 join。
Similarly, the same requirement applies to the connections between the fork and the join.
同理，此要求也适用于fork和join之间的连接。
The two patterns represent the correct pairings of decision with merge and fork with join.
这两个模式描述了正确的decision -merge和fork -join对。
In order to make the multitask scheduling be realized by system management scheduler of the Operating system, modified solutions for join and fork models are presented.
我们对合并和分叉模型进行了修改，使多任务系统可以方便地通过操作系统管理程序进行调度。
Main product has fork-lift truck of grab of lorry of type of fork-lift truck, join with a hinge, hydraulic pressure, land leveler, mining and slippage fork-lift truck to wait.
主要产品有装载机、铰接式卡车、液压挖掘机、平地机、挖掘装载机和滑移装载机等。
应用推荐