Explain parallelism based on grain size in detail, Computer Engineering

Assignment Help:

Parallelism based on Grain size

Grain size: Grain size/ Granularity are a measure that defines how much computation is involved in a process. Grain size is concluded by counting number of instructions in a program segment. The subsequent types of grain sizes have been recognized (shown in Figure):

406_Parallelism based on Grain size.png

Figure: Types of Grain sizes

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

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

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

Based on these grain sizes, parallelism may be classified at several stages in a program. These parallelism stages create a hierarchy according to which, lower the level the finer is granularity of process. The amount of parallelism reduces with raise in level. Each level according to a grain size requires scheduling overhead and communication. Following are parallelism levels (shown in Figure):

408_Parallelism based on Grain size 1.png

Figure: Parallelism Levels

1)  Instruction level: It is the lowest level and degree of parallelism is highest at this level. Fine grain size is used at statement or instruction level as just few instructions make the grain size here. The fine grain size may perhaps vary according to type of the program. E.g. for scientific applications, Instruction level grain size may be higher. As the higher degree of parallelism is able to be achieved at this level, the overhead for a programmer would be more.

2)  Loop Level: This is other stage of parallelism where iterative loop instructions able to be parallelized. Fine grain size is used at this stage too. Simple loops in program are simple to parallelize whereas the recursive loops are hard. This kind of parallelism can be achieved by the compilers.

 3) Subprogram or Procedure Level: This level consists of subroutines, subprograms or procedures. Medium grain size is used at this level including several thousands of instructions in a process. Multiprogramming is applied at this stage. Parallelism at this level has been developed by programmers however not through compilers. Parallelism through compilers hasn't been attained at the medium and coarse grain size.

4)  Program Level: It is the last level consisting of independent programs for parallelism. Coarse grain size is used at this stage including tens of thousands of instructions. Time sharing is attained at this level of parallelism. Parallelism at this stage has been exploited through the operating system.  

The relation between parallelism levels and grain sizes has been shown in Table.

628_Parallelism Levels.png

Table: Relation between grain sizes and parallelism

Coarse grain parallelism is conventionally applied in shared memory or tightly coupled multiprocessors such as the Cray Y-MP. Loosely coupled systems are used to perform medium grain program segments. Fine grain parallelism has been monitored in SIMD organization of computers.


Related Discussions:- Explain parallelism based on grain size in detail

Electronic brokerage facilitate search and retrieval, How does electronic b...

How does electronic brokerage facilitate search and retrieval of information? E Brokerage facilitates search and retrieval of Information: The success aspect of a brokera

What are two reasons for using layered protocol, What are two reasons for u...

What are two reasons for using layered protocol? Layered protocol implies protocols used into each layer are the layer's own business that is they don't influence protocol of a

Describe memory and memory unit, Q. Describe Memory and Memory unit? In...

Q. Describe Memory and Memory unit? Input devices can fetch instructions or data only sequentially though a program may or may not be executed sequentially because looping, jum

Types of reasoning - first-order logic, Types of reasoning - First-order lo...

Types of reasoning - First-order logic: Atleast five types of reasoning can be acknowledged here. • Firstly, why and how do we will think for the killer usually left a silk

Blocking and non-blocking network, Blocking and Non-Blocking network In...

Blocking and Non-Blocking network In non-blocking networks the route from any free input node to any free output node can always be offered. Crossbar is an best example of non-

Explain language processor development tools by diagram, Explain Language ...

Explain Language Processor Development Tools (LPDTs) through schematic diagram. LPDT that is Language processor development tools focuses upon generation of the analysis phase

What do you mean by lock synchronization, Q. What do you mean by Lock Synch...

Q. What do you mean by Lock Synchronization? Lock Synchronization: In this method contents of an atom are updated by requester process and sole access is granted before atomic

Deta sturcture, algorithm of travalling salesman problam

algorithm of travalling salesman problam

Utilization summary, Utilization Summary The Utilization Summary shows ...

Utilization Summary The Utilization Summary shows the status of each processor i.e. how much time (in the form of percentage) have been spent by every processor in busy mode, o

K-nearest neighbor for text classification, Assignment 2: K-nearest neighbo...

Assignment 2: K-nearest neighbor for text classification. The goal of text classification is to identify the topic for a piece of text (news article, web-blog, etc.). Text clas

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