1 / 11

### Understanding MIMD Distributed Memory Architectures and Message-Passing in Multicomputers ###

MIMD (Multiple Instruction Multiple Data) Distributed Memory Architectures utilize a message-passing mechanism for communication between nodes. Each node contains a full processor and memory, connected via a high-speed interconnect network. Key systems include PVM (Parallel Virtual Machine) and MPI (Message Passing Interface), designed for high-performance computing. These systems facilitate explicit communication commands like send and receive, vital for synchronization among processors. High bandwidth and scalable connections enhance multi-processor communication, while minimizing deadlock concerns. ###

ryu
Télécharger la présentation

### Understanding MIMD Distributed Memory Architectures and Message-Passing in Multicomputers ###

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. MIMD Distributed Memory Architectures message-passing multicomputers

  2. MIMD-DM organization • Each node includes • full processor (control and ALU) • memory • connection to interconnect network • Typically commodity processors, memory • Value in interconnect • high speed, high bandwidth

  3. Node Node Node CPU CPU CPU M e m M e m M e m Comm Comm Comm MIMD-DM Network

  4. MIMD-DM Issues • Connection Network • fast • high bandwidth • scalable • Communications • explicit message passing • parallel languages • Occam 2, variations of C, Pascal • libraries for sequential languages • PVM, MPI, Java with CSP

  5. Message Passing • Point-to-Point • Requires explicit commands in program • Send, Receive • Must be synchronized among different processors • Sends and Receives must match • Avoid Deadlock -- all processors waiting, none able to communicate • Multi-processor communications • e.g. broadcast, reduce

  6. Deadlock Send Send Send Send

  7. Message Passing Systems • PVM Parallel Virtual Machine • developed at national lab • intended for use with local area networks • adapted for most MIMD parallel computers • IBM SP2, Cray T3E, SGI Origin • Provides library of function calls for C or FORTRAN • Send, Receive, broadcast, reduce • message packing/unpacking • synchronization

  8. Message Passing Systems • MPI Message Passing Interface • developed by consortium of vendors, users, labs • intended to replace proprietary systems, PVM • thus providing portability • takes best ideas from several systems • adapted for most MIMD parallel computers • IBM SP2, Cray T3E, SGI Origin • Provides library of function calls for C or FORTRAN • Send, Receive, broadcast, reduce • message packing/unpacking • synchronization

  9. Message Passing Systems • Occam 2 • full parallel language • co-developed with processor, Inmos Transputer • provides parallelism within and among processors • uses CSP model • Communicating Sequential Processes • Developed by Anthony Hoare • explicit point-to-point channels for communications • no longer imp[ortant • transputer fell behind in development race

  10. Message Passing Systems • Java with CSP • intended for concurrent and parallel computing in Java • Based on CSP / Occam 2 model • Provides processes, channels, in Java • for a single processor • between processors • Processor-to-processor channels developed at Colgate

  11. Interconnection Network • Speed and Bandwidth are critical • Low cost networks • local area network (ethernet, token ring) • can be set up with packages • PVM • MPI • High Speed Networks • The heart of a MIMD-DM Parallel Machine

More Related