Parallelism based on granularity size-granularity, Computer Engineering

Assignment Help:

Parallelism based on Granularity size

Granularity:  Granularity or Grain size is a determine which measure how much computation is devoted in a process.Granularity size is determined by counting the number of instructions in a program section. The following types of grain sizes have been recognized (shown in Figure):

                                        2282_Parallelism based on Granularity size-Granularity.png

 1)   Fine Grain: This type includes approximately less than 20 instructions.

2)   Medium Grain: This type includes approximately less than 500 instructions.

3)   Coarse Grain: This type includes approximately greater than or identical to one thousand instructions.

Based on these Granularity sizes, parallelism can be specified at various stages in a program. These parallelism stages form a hierarchy according to which, lower the level, the greater is the granularity of the process. The degree of parallelism reduces with increase in level. Every stages according to a granularity size demands scheduling and communication overhead. Following are the parallelism levels (shown in Figure ):

                                     788_Parallelism based on Granularity size-Granularity 1.png


Related Discussions:- Parallelism based on granularity size-granularity

Design issues related to interrupt-driven input - output, Q. Design issues ...

Q. Design issues related to interrupt-driven Input - output? So interrupt handling includes interruption of currently executing program, execution of interrupt servicing progra

Define device interface, Define device interface. The buffer registers ...

Define device interface. The buffer registers DATAIN and DATAOUT and the status flags SIN and SOUT are part of circuitry commonly called as a device interface.

Java, mine sweeper algorithm.

mine sweeper algorithm.

#title.linear programming, zmax=7.5x1-3x2 subject to constraints 3x1-x2-x3>...

zmax=7.5x1-3x2 subject to constraints 3x1-x2-x3>=3 x1-x2+x3>=2 x1,x2,x3>=0

Pc cross assembler, 1.0 By working throughthe first time guide this will ga...

1.0 By working throughthe first time guide this will gain familiarity with the on board monitor and the PC cross assembler  After connecting the system to the terminal program,

Variable-partition multiprogramming, Choose the descriptions below with the...

Choose the descriptions below with the most appropriate memory management scheme (A through D).  Solutions may be used once, more than once, or not at all. A.     Fixed-partitio

Minimax search, Minimax search: Always notice there that the process a...

Minimax search: Always notice there that the process above was in order for player one to choose his and her first move for that. The whole entire process would require to fre

Proof by contradiction, Proof by Contradiction: Now for forward chaini...

Proof by Contradiction: Now for forward chaining and backward chaining both have drawbacks. But another approach is to think about proving theorems by contradiction. So we can

Design goals of computer system, Design goals: The correct form of a c...

Design goals: The correct form of a computer system depends on the constraints and aim for which it was optimized. Computer architectures frequently trade off   cost, standard

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