Data Parallel Algorithms Computer Science数据并行算法计算机科学.pptVIP

Data Parallel Algorithms Article by W. DANIEL HILLIS and GUY L. STEELE, JR. Overview Review: Data Parallel vs. Control Parallel Connection Machine Programming Model Differences of the Connection Machine Model Algorithms Summation Prefix summation by doubling Finding the end of a Linked List All partial sums of a Linked List Matching up elements of two Linked Lists Data vs. Control Parallel Data parallel (SIMD) same instruction is executed synchronous by all processors on multiple data items. Control parallel (MIMD) each processor may execute a different instruction from the same code asynchronously on multiple data items. Connections Machine Programming Model Consists of two parts: 1. Front-end computer -traditional SISD computer serves as controller, VAX or Symbolics 3600 2. Array of Connection Machine processors -each with own local memory -to the front end processor array appears as memory Executing Instructions Selecting Processors Executes in SIMD fashion -A single instruction stream from front-end acts on multiple data items. Each processor has state bit or context flag -Context flag set to 1 means CPU is selected Instructions are one of two types -Conditional, only CPU’s selected will execute -Unconditional, all CPU’s will execute regardless of context flag Differences of the Connection Machine Model General pointer-based communication Virtual Processors General Communication? Typical computers of fine-grained SIMD style restrict communication to patterns such as a grid or tree wired into the hardware. The connection machine model allows any CPU to communicate with any other CPU while other CPU’s communicate concurrently via a SEND instruction. SEND Instruction SEND Instruction takes two operands 1. address of the data to be sent 2. A processor pointer -i.e. CPU number and field within that CPU to which data is to be placed. Virtual Processors The connection machine model is abstracted from the hardware that supports it. (i.