Explain the term granularity, Computer Engineering

Assignment Help:

Granularity

In 'Parallel computing', Granularity can be defined as a qualitative assess of the ratio of computation to communication.

1) Coarse Granularity- relatively huge amount of computational work is done among communication events. 

2) Fine Granularity- relatively little amount of computational work is done between communication events.

3) Observed Speedup- Observed speedup of a code, which has been parallelized, is termed as:

(Wall-clock time of serial) / (wall-clock time of parallel)

Granularity is one of the simplest and most extensively used indicators for parallel program's performance. 

 


Related Discussions:- Explain the term granularity

Signed 1’s complement representation, Q. Signed 1s complement representatio...

Q. Signed 1s complement representation? Another possibility that is also simple is use of signed 1's complement. Signed 1's complement has a principal. Add both numbers includi

Two - bit correlating predictor, The history file, history.txt, is the bran...

The history file, history.txt, is the branch history of a run of the gcc compiler (the first field is the address of the branch instruction, the second field is the target branch a

Subtract the numbers using 2's complements, Subtract -27 from 68 using 2's ...

Subtract -27 from 68 using 2's complements. Ans. By using 2's complement 68-(-27)= 68-(-27) 2's complement representation of 68 = 01000100(64+4) 2's complement representatio

Logical user-centered interactive design methodology, Question: Logical...

Question: Logical User-Centered Interactive Design Methodology is a methodology that identifies six clear stages to help in software development while keeping the user in mind.

What are the steps in a bdc session, What are the steps in a BDC session? ...

What are the steps in a BDC session? The first step in a BDC session is to recognize the screens of the transaction that the program will process.  Next step is to write a pro

Discrete mathmetics and structures, how to prove the partial order R is a t...

how to prove the partial order R is a total order in discrete mathmetics and structures by topological sorting method in c programming

Illustrate associative memory, Q. Illustrate Associative Memory? The ti...

Q. Illustrate Associative Memory? The time required to find an item which is stored in memory can be decreased significantly if stored data can be identified for access by cont

Feature of micro-instruction execution, Q. Feature of micro-instruction exe...

Q. Feature of micro-instruction execution? Feature of micro-instruction execution is micro-instruction sequencing which involves address calculation of next micro-instruction.

Methods to resolve collision during hashing., What are the two methods to r...

What are the two methods to resolve collision during hashing. The two methods to resolve collision during hashing are: a) Open addressing and b) Chaining.

Identify the process of entering data into a ROM, The process of entering d...

The process of entering data into a ROM is called ? Ans. The process of entering data in ROM is termed as programming the ROM.

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