Explain classification based on grain size, Computer Engineering

Assignment Help:

Explain Classification Based On Grain Size

This categorization is based on distinguishing the parallelism in a program to be executed on a multiprocessor system. The concept is to recognize the subtasks or instructions in a program which can be executed in parallel. E.g. there are three statements in a program and statements S1 and S2 can be exchanged. It implies, these are not serial as shown in Figure. Then S1 and S2 are able to be executed in parallel.

483_Classification Based On Grain Size.png

Figure: Parallel execution for S1 and S2

However it's not enough to check for parallelism between processes or statements in a program. The decision of parallelism too depends on the subsequent factors:

  • Types and Number of processors available, it implies that architectural features of host computer
  • Dependency of data, control and resources
  • Memory organisation

Related Discussions:- Explain classification based on grain size

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

Explain the client-server interaction using messages, Explain the Client-Se...

Explain the Client-Server Interaction Using Messages As we have learned, client- server interaction may be managed in many ways. A message- based interaction is perhaps the bes

Which is the best tool for monitoring weblogic server(wls8), WLS8 handles J...

WLS8 handles JMX but it uses weblogic execution of JMX server. It does not supports generalise sun javax API which can be used with any JVM. There are some patches available which

Define micro routine and microinstruction, Define micro routine and microin...

Define micro routine and microinstruction. A sequence of control words corresponding to the control sequence of a machine instruction represents the micro routine for that ins

Computation step in time complexity of an algorithm, Q. Computation step in...

Q. Computation step in time complexity of an algorithm? So First in the computation step the local processor executes an arithmetic and logic operation. Afterwards the several

Array is a pointer to pointer to int, Array is a pointer-to-pointer-to-int:...

Array is a pointer-to-pointer-to-int: at the first level, it points to a block of pointers, one for each row. That first-level pointer is the first one we allocate; it has nrows e

Write the truth table and simplify karnaugh map, For F = A.B.C + B.C.D ...

For F = A.B.C + B.C.D ‾ + A‾.B.C ,  write  the  truth  table and simplify using Karnaugh map . And. Simplification of Logic Function F = A B C + B C‾ D + A‾ B C. Therefore the

What is sector sparing, What is sector sparing? Low-level formatting al...

What is sector sparing? Low-level formatting also sets aside spare sectors not visible to the operating system. The controller can be told to change each bad sector logically w

., advantages and disadvantages of a header node

advantages and disadvantages of a header node

Explain the acceptance and request determination, Explain the Acceptance an...

Explain the Acceptance and Request Determination As we have learned, much of the overhead in client-server interaction occurs in the CSInteface, either client or server. It is

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