Define structural classification, Computer Engineering

Assignment Help:

Structural Classification

Flynn's classification explains the behavioural idea and doesn't take concern into the computer's structure. Parallel computers can be categorized based on their organization also, that is discussed below and shown in Figure below. As we have seen a parallel computer (MIMD) can be explained as a set of numerous processors and mutual memory or memory modules communicating through an interconnection network. When multiprocessors communicate via the universally shared memory modules then this organisation is termed as tightly coupled systems or Shared memory computer as shown in Figure. In the same way when every processor in a multiprocessor system has its own local memory and the processors communicate through messages broadcasted between their local memories then this organisation is termed as 'Loosely coupled system' or 'Distributed memory computer' as shown in Figure. Figures 1 and 2 shows the simplified diagrams of both organisations together. The memory and processors in both organisations are interrelated by an interconnection network. This interconnection network can be in different forms such as multistage network and crossbar switch. 

231_Structural Classification.png

                                                              Figure 1: Structural classification

1913_Structural Classification 1.png

Figure 2: Tightly coupled system

1121_Loosely coupled system.png

Figure 3: Loosely coupled system


Related Discussions:- Define structural classification

Dynamic memory allocation function, Name the dynamic memory allocation func...

Name the dynamic memory allocation function? Three dynamic memory allocation functions are: a) malloc, b) calloc and c) free.

What is sorted linked list, Linked list means node which is linked each oth...

Linked list means node which is linked each other with  a line. It means that every node is connected with another one. Every node of the list hold the reference of the next node.

Explain about the links and association, Links and Association Links a...

Links and Association Links and associations are the basic means used for establishing relationships among objects and classes of the system. In the next subsection we will di

Multiple instruction and multiple data stream (mimd), Multiple Instruction ...

Multiple Instruction and Multiple Data stream (MIMD): In this categorization, numerous processing elements and multiple control units are ordered as in MISD. However the differ

What are conditional chain statement, What are conditional chain statement?...

What are conditional chain statement? ON CHAIN-INPUT similar to ON INPUT. The ABAP/4 module is called if any one of the fields in the chain having a value other than its in

Reading every record , You have a file having sporting goods that are sold ...

You have a file having sporting goods that are sold online. Every item record contains the item id, item name, item description, item category, item price, and the units in stock.

Prove boolean identities using boolean algebra, Prove the following Boolean...

Prove the following Boolean identities using the laws of Boolean algebra: ABC + AB ‾C + ABC ‾ = A(B + C) Ans. ABC+AB'C+ABC'=A(B + C) LHS AC(B+B')+AB(C+C') OR  AC+AB OR  A(B

Relational algebra expressions , Write Relational algebra expressions for t...

Write Relational algebra expressions for the given queries. (i) List the employee numbers, employee names and their manager numbers working in several branches who earn more than

Padovan string , A Padovan string P(n) for a natural number n is defined as...

A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string of t

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