Parallel and distributed computation
Parallel and distributed computation
复制标题
DOI：
10.1201/b11043-9
复制
发表时间：
2011-07
期刊：
影响因子：
--
通讯作者：
G. Steel
中科院分区：
文献类型：
--
作者：
G. Steel
并行计算：连续耦合的处理器几乎可以像执行计算分布式计算一样迅速：宽松的夫妇处理器，该处理器的通信比计算慢了2个婴儿车模型。和沟通问题，并关注问题并行的任务。允许各种处理器同时访问相同的内存位置。 ew =独家写作，只有一个处理器可以在任何1步中写一个位置•CW =并发写入，任何数量的处理器都可以在一个步骤中编写一个位置。共同：所有处理器都必须试图编写相同的价值 - 任意：任意处理器在写作冲突的情况下取得了成功 - 优先级：最低数字处理器成功的“正确”模型可能是EREW PRAM，但我们将研究其他作为学术练习，我们有时会通过这些算法设计的算法，例如
Parallel computation: Tightly coupled processors that can communicate almost as quickly as perform a computation Distributed computation: Loosely couple processor for which communication is much slower than computation 2 PRAM Model A PRAM machine consists of m synchronous processors with shared memory. This model ignores synchronization problems and communication issues, and concentrates on the task of parallelization of the problem. One gets various variations of this model depending on how various processors are permitted to access the same memory location at the same time. • ER= Exclusive Read, only one processor can read a location in any 1 step • CR= Concurrent Read, any number of processors can read a location in a step • EW= Exclusive write, only one processor can write a location in any 1 step • CW= Concurrent Write, any number of processors can write a location in a step. What it 2 processors try to write different values? – Common: All processors must be trying to write the same value – Arbitrary: An arbitrary processor succeeds in the case of a write conflict – Priority: The lowest number processor succeeds The " right " model is probably an EREW PRAM, but we will study other models as academic exercises. We will sometimes refer to algorithms by the type of model that these algorithms are designed for, e.g. an EREW PRAM algorithm.