Multiple instruction and multiple data stream (mimd), Computer Engineering

Assignment Help:

Multiple Instruction and Multiple Data stream (MIMD)

In this association, multiple control units and multiple processing elements are prepared as in MISD. But the discrepancy is that now in this association multiple instruction streams function on multiple data streams . Thus, for handling multiple control units, multiple instruction streams and multiple processing elements are organized in the way of  multiple processing elements are conducting multiple data streams from the Main memory as given  in Figure 7. The processors work on their own given data with their own instructions. Tasks implemented by different processors can start or finish at dissimilar times. They are not lock-stepped, as in SIMD computers, although run asynchronously. This classification actually distinguished the parallel computer. That means in the actual sense MIMD organisation is supposed to be a Parallel computer. All multiprocessor systems drop under this classification. Examples include; Burroughs D825, Cray X-MP, C.mmp Cray-2, S1, HEP, Pluribus, Univac 1100/80, IBM 370/168 MP, Tandem/16, IBM 3081/3084, BBN Butterfly, C.m*, FPS T/40000, iPSC, Meiko Computing Surface (CS-1),.

This type of computer organisation is indicated as:

                                                                           Is > 1

                                                                           Ds > 1

                          2217_Multiple Instruction and Multiple Data stream (MIMD).png

Of the classifications discussed over, MIMD organization is the most accepted for a parallel computer. In the actual sense, parallel computers implement the instructions in MIMD mode.


Related Discussions:- Multiple instruction and multiple data stream (mimd)

Specify the default alignment, Specify the default alignment for the follow...

Specify the default alignment for the following field types: 'D' - Left, 'F'-Right, 'N'-Left, 'I'-Right, 'T'-Left.

Define a technique of temporarily removing inactive program, is a technique...

is a technique of temporarily removing inactive programs from the memory of computer system? Swapping is a technique of temporarily eliminating inactive programs from the memor

Backpropagation learning routine, Backpropagation Learning Routine: Co...

Backpropagation Learning Routine: Conversely as with perceptrons there the information in the network is stored in the weights than the learning problem comes down to the ques

Name the appliances which are controlled by micro-processor, Name the appli...

Name the appliances which are controlled by micro-processor Many household appliances which are microprocessor-controlled do not have operating systems (for example microwave o

C token, describe briefly about the c token with suitable example program

describe briefly about the c token with suitable example program

Generates sequence code, The basic project will have each group generate a ...

The basic project will have each group generate a sequence of 1's and 0's using  the Motorola 688HC11 board to turn ON and then turn OFF the TV set installed in ATRC 306. Each tele

Subsequent step in karnaugh map, The subsequent step in Karnaugh map is to ...

The subsequent step in Karnaugh map is to map truth table in the map. Mapping is done by putting a 1 in respective square belonging to 1 value in truth table. This mapped map is us

Why gateways are used during mail transfer, Why Gateways are used during ma...

Why Gateways are used during mail transfer? Email using SMTP effort best while both the sender and the receiver are on the internet and can hold TCP connections in between send

What must the requirement of designer to get memory capacity, In applicatio...

In applications where the required memory capacity cannot be satisfied by a single available memory IC chip, what should the designer do to meet this requirement? Ans: If th

Meaning of all variable, A project having of a set of jobs and a set of pre...

A project having of a set of jobs and a set of precedences, where precedence (i; j) show that job j cannot begin before job i is completed. Let c i be the duration of job i. We wi

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd