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

Basic operational concepts of a computer, Basic Operational Concepts of a C...

Basic Operational Concepts of a Computer: Most of computer operations are executed in the ALU (arithmetic and logic unit) of a processor. For an example: to add 2 numb

Maximum size of a database, What is the maximum size of a database that can...

What is the maximum size of a database that can be opened in Microsoft Access? Ans) 1 Gigabyte

Basic architecture of computer system, Q. Basic Architecture of computer sy...

Q. Basic Architecture of computer system? Replacing the ALU and CU (i.e., CPU) of Figure by a microprocessor, and storing instructions and data in the same memory, one arrives

Dbms, Find a 3NF decomposition of the following relation scheme: University...

Find a 3NF decomposition of the following relation scheme: University (Faculty, Dean, Department, Chair, Professor, Rank, Student}. The University relation satisfies the following

What are near and far pointers, These days, they're pretty much obsolete; t...

These days, they're pretty much obsolete; they're definitely system-particular. They had to do with 16-bit programming under MS-DOS and perhaps some early on versions of Windows. I

Illustrate domain names and address resolution, Q. Illustrate Domain Names ...

Q. Illustrate Domain Names and Address Resolution? But what if you don't know IP address of the computer you want to connect to? What happens if you need to access a web server

Array user interface, You were offered bonus marks for separating the user ...

You were offered bonus marks for separating the user interface code from the main logic of your program. This design choice makes it very easy to replace the user interface without

Differentiate between unit testing and integration testing, Unit testing an...

Unit testing and integration testing: Unit testing focuses on the least element of software design by the module. Unit test is conducted on every of the modules to uncover er

Sql requirements in the sap development system, Which interface converts SQ...

Which interface converts SQL requirements in the SAP development system to those of the database? Database Interface converts SQL in the SAP.

Algorithmic complexity theory, Algorithmic Complexity theory: Moreover...

Algorithmic Complexity theory: Moreover a similar situation occurs in broad to specific ILP systems when the inference rules are deductive thus they specialize. So at some sta

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