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

Assignment Help:

Multiple Instruction and Multiple Data stream (MIMD):

In this categorization, numerous processing elements and multiple control units are ordered as in MISD. However the difference is that now in this organization multiple instruction streams function on multiple data streams. So, for handling multiple processing elements, several instruction streams and multiple control units are organized in such a way that multiple processing elements are controlling multiple data streams from main memory as shown in Figure below. The processors work on their individual data with their individual instructions. Tasks performed by various processors can begin or complete at different times. They aren't lock-stepped as in SIMD computers although run asynchronously. This categorization exactly identifies the parallel computer. Which means in real sense MIMD organisation is said to be a Parallel computer. All multiprocessor organizations fall under this categorization. Illustrations include; Burroughs D825, C.mmp, Cray-2, S1, Cray X-MP, Tandem/16, HEP, Pluribus, IBM 370/168 MP, Univac 1100/80,  IBM 3081/3084, C.m*, BBN Butterfly, Meiko Computing Surface (CS-1), FPS T/40000, iPSC. 

This kind of computer organisation is represented as:

Is > 1

Ds > 1

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

Figure:  MIMD Organisation

Of the categorizations mentioned above, MIMD classification is the largely popular for a Parallel computer. In the actual intellect parallel computers implement the instructions in MIMD mode.


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

When can we see layer groups in gimp, Sometimes it is nice to place layers ...

Sometimes it is nice to place layers in groups. It makes them simple to organize when you have lots of them. It also means you can simply apply the similar effect to lots of layers

Visualization, Visualization Visualization is a general method in contr...

Visualization Visualization is a general method in contract to search based tools.  In this method visual aids are given like pictures to assist the programmer in evaluating th

Define cache line, Define cache line. Cache block is used to refer to a...

Define cache line. Cache block is used to refer to a set of contiguous address location of some size. Cache block is also referred to as cache line.

What is microprocessor, Microprocessor is a program-controlled device, whic...

Microprocessor is a program-controlled device, which fetches the instructions from memory, decodes and implements the instructions. Most Micro Processor is single- chip devices.

Associative array processing, Associative Array Processing Consider tha...

Associative Array Processing Consider that a list of record or a table is stored in the memory and you want to search some information in that list. For example, the list havin

Find the physical address of instruction, Q. Find the Physical address of i...

Q. Find the Physical address of instruction? Value of Instruction Pointer and holding address of instruction = 1234h Value of code segment register (CS) = 448Ah Physical

Write an algorithm for the braking system, Question: a) Consider a car ...

Question: a) Consider a car having a collision detection mechanism. Write an algorithm (in simple English) to illustrate the collision detection mechanism. b) The same car

How to create a layout table in dreamweaver, Q. How to Create a Layout Tabl...

Q. How to Create a Layout Table in dreamweaver? In last section you used cells to create a table. Now, you will see how to start with a table and add cells later. 1.  In Obj

Define flash memory, Define Flash Memory. It is an approach same to EEP...

Define Flash Memory. It is an approach same to EEPROM technology. A flash cell is based on a one transistor controlled by trapped charge just like an EEPROM cell.

What do you mean by perfect shuffle permutation, Q. What do you mean by Per...

Q. What do you mean by Perfect Shuffle Permutation? Perfect Shuffle Permutation: It was proposed by Harold Stone (1971). Consider N objects each is represented by n bit number

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