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)

NachoS, Can I get the scheduling code for NachOS?

Can I get the scheduling code for NachOS?

Phython, super ascii string checker

super ascii string checker

#logic function, Minimize the following logic function using K-maps and rea...

Minimize the following logic function using K-maps and realize using NAND and NOR gates. F(A,B,C,D) =?_m(1,3,5,8,9,11,15) + d(2,13).

Electrically erasable programmable rom - computer memory, Explain Electrica...

Explain Electrically Erasable Programmable ROM - Computer Memory? The next level of erasability is the EEPROM which able to be erased under software control. This is the most f

Rubbers, engineering plastics ,rubbers ,composites

engineering plastics ,rubbers ,composites

The spanning tree of connected graph with 10 vertices, The spanning tree of...

The spanning tree of connected graph with 10 vertices have 9 edges of spanning tree of connected graph with 10 vertices

Cookies, basic purpose of cookies

basic purpose of cookies

Minimum degree of t=1 for a b-tree, Why don't we permit a minimum degree of...

Why don't we permit a minimum degree of t=1 for a B-tree? According to the definition of B-Tree, a B-Tree of order n means that every node in the tree has a maximum of n-1 keys

Describe about full adder, Q. Describe about full adder? Let's take ful...

Q. Describe about full adder? Let's take full adder. For this other variable carry from previous bit addition is added let'us call it 'p'. Truth table and K-Map for this is dis

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