Structural classification-flynns classification , Computer Engineering

Assignment Help:

Structural Classification

Flynn's classification examine the behavioural concept and does not receive into consideration the computer's structure. Parallel computers can be classified stand on their structure also, which is discussed under and shown in Figure 8.

As we have know, a parallel computer (MIMD) can be characterised as a set of multiple processors and memory modules or shared memory communicating via an interconnection network. When multiprocessors commune through the global shared memory modules then this organisation is called as tightly coupled systems or Shared memory computer as shown in Figure 9. Similarly, when each processor in a multiprocessor system, have its own local memory and the processors commune via messages transmitted among their local memories, then this organisation is said as Loosely coupled system or Distributed memory computer as shown in Figure 10. Figures  9 and 10 show the easy diagrams of both organisations.

The memory and processors in both organisations are interrelated via an interconnection  network. This interconnection network may be in dissimilar forms like multistage network, crossbar switch, etc. which will be discussed in the next unit.

                                                  545_Structural Classification.png


Related Discussions:- Structural classification-flynns classification

Define elimination of common sub expression, Explain Elimination of common ...

Explain Elimination of common sub expression during code optimization An optimizing transformation is a regulation for rewriting a segment of a program to enhance its execution

Explain hypertext transfer protocol, Explain Hypertext Transfer Protocol. ...

Explain Hypertext Transfer Protocol. HTTP is used mainly in today's society like a set of rules for exchanging files (graphic images, text, sound, other multimedia files or vid

Define both fork and vfork, How and when race conditions happen in process ...

How and when race conditions happen in process control? How can it be avoided? b. Differentiate among following functions giving related syntax: (i) fork and vfork (ii) w

Define functions with that virtual memory can be implemented, Virtual memor...

Virtual memory can be implemented with ? With Segmentation and Paging Virtual memory can be implemented.

Perform binary addition and subtraction on two numbers, Q Develop a menu ...

Q Develop a menu driven program to perform Binary addition and subtraction on two numbers that are inputted. Check that entered numbers are in base 2 or not else error messag

Define nondeterministic tm, Define nondeterministic TM?  Arbitraril...

Define nondeterministic TM?  Arbitrarily chooses move when more than one possibility exists Accepts if there is at least one computation that terminates in an acceptin

Define the message queues, The message queue provides the information about...

The message queue provides the information about sizes of queues under utilization of various processors. It points to size of every processor incoming message queue that would be

Minimumshelf program in c, At a shop of marbles, packs of marbles are prepa...

At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with thes

C, Drawbacks of linear arrays

Drawbacks of linear arrays

What are the difference between heap and stack, What are the difference bet...

What are the difference between heap and stack? The Stack is more or less responsible for maintaining track of what's executing into our code or what's been "called". The Heap

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