1 / 12

10.Introduction to Data-Parallel architectures

10.Introduction to Data-Parallel architectures. SIMD {Single Instruction Multiple Data} 10.1 Introduction 10.2 Connectivity 10.3 Alternative architecture e.g. add: (c1=a1+b1), (c2=a2+b2), (c3=a3+b3). TECH Computer Science. CH01. Data-parallel computation (bit parallel).

jera
Download Presentation

10.Introduction to Data-Parallel architectures

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 10.Introduction to Data-Parallel architectures • SIMD {Single Instruction Multiple Data} • 10.1 Introduction • 10.2 Connectivity • 10.3 Alternative architecture • e.g. add: (c1=a1+b1), (c2=a2+b2), (c3=a3+b3) TECH Computer Science CH01

  2. Data-parallel computation (bit parallel)

  3. Application of Data-parallel Architectures: One data entity processed by one PE

  4. Mapping Problem space into Architectural Space:Data entity onto PE (1-to-1 mapping)

  5. Near-neighbor connectivity (2-D: Mesh)

  6. Tree: 2-D hierarchy

  7. Pyramid: 3-D hierarchy

  8. Hypercube: 2^N nodes in N dimension

  9. Hypercube: 4-D Long and short-range connections

  10. Data-parallel approaches

  11. Principal characteristics of data-parallel systems

More Related