1 / 29

Taxanomy of parallel machines

A taxonomy of parallel machines, including control mechanisms for SIMD and MIMD architectures, memory types (shared and distributed), and programming models for shared and distributed memory multiprocessors. The taxonomy covers interconnection networks and message-passing methods commonly used in parallel computing.

febner
Download Presentation

Taxanomy of parallel machines

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. Taxanomy of parallel machines

  2. Control SIMD MIMD Taxonomy of parallel machines • Memory • Shared mem. • Distributed mem.

  3. Shared Memory Multiprocessor

  4. Conventional Computer • Consists of a processor executing a program stored in a (main) memory: • Each main memory location located by its address. Addresses start at 0 and extend to 2b - 1 when there are b bits (binary digits) in address. Main memory Instr uctions (to processor) Data (to or from processor) Processor

  5. Shared Memory Multiprocessor System • Natural way to extend single processor model - have multiple processors connected to multiple memory modules, such that each processor can access any memory module : Memory module One address space Interconnection network Processors

  6. Simplistic view of a small shared memory multiprocessor Processors Bus Shared memory

  7. Typical Shared Memory Multiprocessor Processor Processor Processor Processor L1 cache L1 cache L1 cache L1 cache L2 Cache L2 Cache L2 Cache L2 Cache Bus interface Bus interface Bus interface Bus interface Processor/ memory b us I/O interf ace Memory controller I/O b us Memory Shared memory

  8. Programming Shared Memory Multiprocessors • Threads - programmer decomposes program into individual parallel sequences, (threads), each being able to access variables declared outside threads. Example: Pthreads • Sequential programming language with preprocessor compiler directives to declare shared variables and specify parallelism. • Example: OpenMP or Cilk - needs OpenMP or Cilk compiler

  9. Distributed Memory Multiprocessor

  10. Computers connected through an interconnection network: Interconnection network Messages Processor Local memory Computers

  11. Interconnection Networks • Limited and exhaustive interconnections • 2- and 3-dimensional meshes • Hypercube (not now common) • Using Switches: • Crossbar • Trees • Multistage interconnection networks

  12. Two-dimensional array (mesh) Computer/ Links processor • Also three-dimensional - used in some large high performance systems.

  13. Three-dimensional hypercube

  14. IBM Blue Gene

  15. IBM Blue Gene

  16. Tree Root Switch Links element Processors

  17. Four-dimensional hypercube • Hypercubes popular in 1980/90’s - not now

  18. Multistage Interconnection NetworkExample: Omega network 2 ´ 2 switch elements (straight-through or crossover connections) 000 000 001 001 010 010 011 011 Inputs Outputs 100 100 101 101 110 110 111 111

  19. Crossbar switch Memor ies Switches Processors

  20. Message-Passing • Distributed memory parallel machines are usually programmed via message passing. • Industry standard: MPI Interconnection netw or k Messages Processor Shared memory Computers

  21. Flynn’s Classifications

  22. Taxanomy of parallel machines MIMD SIMD Distributed memory CM/2 (legacy) clusters Shared memory multi-core GPU

More Related