这种方法称为并行分配补偿法。
最后基于具体图像处理系统硬件拓扑结构研究了算法并行分配的实现。
At last, a parallel structure based on master-slave hardware system is adopted, and the problem of algorithm distribution is discussed.
第一个是并行的资源分配。
分配组还有助于在多处理器系统上优化并行io性能，因为可以同时有多个元数据更新处于“在传输中”。
Allocation groups also help to optimize parallel IO performance on multiprocessor systems, because more than one metadata update can be "in transit" at the same time.
在这个场景中，把一个并行路由任务分配给一个用户组。
In this scenario, a parallel routing task is assigned to a group of users.
正如您将从我前一篇文章所回忆的一样，分配组让XFS并行执行多个元数据操作。
As you'll recall from my previous article, allocation groups let XFS perform multiple metadata operations in parallel.
主要原因是，XFS使用分配组，以便能有效地处理并行io。
Primarily, XFS USES allocation groups so that it can efficiently handle parallel IO.
一些负载本身不适合并行处理，所以跨多个服务器分配负载或添加更多CPU不会有帮助。
Some loads do not lend themselves to parallel processing, so splitting the load across multiple servers or adding more CPUs doesn't help.
go运行时环境提供了对goroutines的支持，会为它分配单独的线程，但现在还不支持并行执行，该功能会在以后提供。
The go runtime environment provides support for goroutines, which are allocated a single thread, and does not support parallel execution yet, which may be provided later.
然后MapReduce按照各个键改组映射输出，对重新分配的映射输出执行另一项并行计算，在计算的归纳阶段将结果写入到文件系统中。
Then MapReduce shuffles the map output by key and does another parallel computation on the redistributed map output, writing the results to the file system in the Reduce phase of the computation.
相反地，Hadoop可以被视为一种可以同时将数据和算法分配到主机以获得更快速的并行处理速度的方法。
Instead, Hadoop can be viewed as a way to distribute both data and algorithms to hosts for faster parallel processing.
通过MapReduce的抽象，google工程师可以简单地进行运算，而不必考虑并行运算的细节、数据的分配、负载平衡和错误处理。
MapReduce is an abstraction that allows Google engineers to perform simple computations while hiding the details of parallelization, data distribution, load balancing and fault tolerance.
由于GPars将这些任务分配给了一批作业员，我现在可以并行执行我的所有搜索了(只要内存池足够大)。
Because GPars gives these tasks to a pool of workers, I can now perform all of my searches in parallel (provided the pool is large enough).
分区还允许并行作业的分配(例如，通过将设计的特定部分分配给一个团队，而将设计的另一部分分配给另一个团队)。
Partitions also allow for the assignment of parallel work (for example, by assigning the design of a particular set of parts to one team, and of another set of parts to another team).
团队工作：体系结构的结构方面允许为不同的团队(可能是并行地工作，也可能在地理位置上是分开的)分配任务。
Team work: the structural aspect of architecture allows for the assignment of tasks to teams that can work both in parallel and physically separated from each other.
这样就允许了并行开发，每个项目小组就可以在它们自己的项目环境中为满足这个请求而分配和跟踪工作。
This allows for parallel development where each project team assigns and tracks work for satisfying the request in the context of its own project.
由于您无需等待一个列表生成完毕(停止并前进)或者分配一个线程用于处理循环(并行管道)，这可能是最有效率的方法了。
Since you do not have to wait for a list to be generated (stop and go) or allocate a thread to processing the loop (pipelining), this can be the most efficient method.
此外，通过跨多个数据库分区分散数据以使多个分区可并行处理分配到其上的数据，也能减少复杂的分析查询的响应时间。
Also, the response time of complex analytical queries can be reduced by spreading the data across multiple database partitions, such that all partitions work on their assigned data in parallel.
多亏了分配组，XFS代码将允许多个线程和进程持续以并行方式运行，即使它们中的许多线程和进程正在同一文件系统上执行大规模IO 操作。
Thanks to allocation groups, the XFS code will allow multiple threads and processes to continue to run in parallel, even if many of them are performing non-trivial IO on the same filesystem.
此类架构在多线程应用程序中运行良好，该类应用程序中线程可能被分配给多个处理器以实现并行操作。
This type of architecture works well in multi-threaded applications where threads can be distributed across the processors to operate in parallel.
分配单一资源给并行进行的项目，其中没有合适的缓冲以及一些执行，也是糟糕的项目管理。
Assigning single resources on parallel projects without the proper buffers and supporting cast is also bad program management.
所有关于“并行化如此容易”的理由都倾向于使用简单数组操作做例子，甚至不包含对象的分配和释放。
There's a reason all the examples of "look how easy it is to parallelize things" tend to use simple arrays and don't ever have allocations or freeing of the objects.
在两个节点之间多条并行的流量主干上进行负载分配是一个十分重要的问题。
Load distribution across multiple parallel traffic trunks between two nodes is an important consideration.
为了提高嵌入式多媒体应用的实时性能，提出了一种最大化数据并行访问以便充分发挥CPU处理能力的片上存储器分配方法。
A memory allocation algorithm was developed to maximize parallel data access and make full use of CPU processing ability to improve real-time performance of embedded multimedia applications.
在此平台的基础上通过对信号处理算法的并行设计，以及对处理任务的合理分配，实现了高速实时雷达信号处理。
Then, basing on this platform, a high speed real-time digital signal processing of radar is carried out, making good use of the parallel design of algorithm and a reasonable assignment of tasks.
通过对全球气象资料客观分析系统串行算法的研究，提出了一种静态分配数据的分布式并行算法。
A distributed parallelized algorithm is described by means of static data distribution after researching into the sequential algorithm of the global atmospheric data objective analysis system.
在OFDMA中，相临的多个子载波被分配给不同的用户来为用户并行低速传输数据。
In OFDMA, closely spaced multiple subcarriers are assigned to different users for parallel data transmission.
S4R网可以建模复杂的、拥有多个并行加工进程的资源分配系统，而且不同的工序可以申请不同类型的多个资源。
S4R can model complicated resource allocation systems with multiple concurrent processes, and different types of multiple resources can be requested by different processes.
在并行重组过程中，采用二维链表保存（例如会话列表、相应状态和任务分配结果等）关键信息。
Some key information such as sessions and their corresponding states, operation results were saved by using a two-dimensional linked list in parallel reassembly process.
在并行重组过程中，采用二维链表保存（例如会话列表、相应状态和任务分配结果等）关键信息。
Some key information such as sessions and their corresponding states, operation results were saved by using a two-dimensional linked list in parallel reassembly process.
应用推荐