Granularity-concept of parallel execution and concurrent , Computer Engineering

Granularity

Granularity refers to the quantity of computation done in parallel relative to the dimension of the entire program. In parallel computing, granularity is a qualitative determine of the component of computation to communication. According to granularity of the technique, parallel- processing systems can be divided into two groups: fine-grain systems and coarse-grain systems.  In fine-grained systems, parallel parts are comparatively little and that means more recurrent communication. They have short calculation to communication ratio and require high statement overhead.  In coarse-grained systems parallel parts are comparatively great and that means extra computation and a smaller amount communication. If granularity is also fine it is feasible that the overhead required for communications and synchronization among tasks takes longer than the computation. On some other hand, in coarse-grain parallel systems, comparatively large quantity of computational work is complete. They have elevated computation to communication ratio and entail more opportunity for presentation increase.

The amount of granularity in a system is unwavering by the algorithm practical and the hardware environment in which it runs. On the architecturally neutral system, the granularity doesn't affect the performance of the resulting program. The statement of data required to start a big process may take a substantial amount of time. On the other hand, a huge process will often have minus communication to do during processing. A process may need only a little amount of data to get leaving, but may need to obtain more data to carry on processing, or may require doing a lot of communication with other Processes in order to achieve its processing. In most times the overhead associated with connections and synchronization is high virtual to execution speed so it is advantageous to have common granularity.

 

Posted Date: 3/1/2013 4:23:48 AM | Location : United States







Related Discussions:- Granularity-concept of parallel execution and concurrent , Assignment Help, Ask Question on Granularity-concept of parallel execution and concurrent , Get Answer, Expert's Help, Granularity-concept of parallel execution and concurrent Discussions

Write discussion on Granularity-concept of parallel execution and concurrent
Your posts are moderated
Related Questions
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

Solve the following 8-department problem using the MIP method.  What is the resulting layout and flow-distance score?  Note that the aspect ratio of each department should be 2.

What are threads? A thread, sometimes termed as a lightweight process (LWP), is a fundamental unit of CPU utilization; this comprises a thread ID a register set and a stack and

We also need to know, given a cell, which of its neighbours has all of its walls intact. Write the function wallsintact that accepts the grid and a list of neighbouring cells and r

Q. Explain working of Digital Versatile Disk? With the capacious digital versatile disk (DVD) electronics industry has ultimately found an acceptable replacement for videotape

During instruction execution, there are other parts of the CPU that can determine when a physical register might be freed. Briefly describe where else we can put freeing logic and

How would ASP and ASP.NET apps run at the same time on the same server? Both ASP and ASP.net can be run at similar server, becuase IIS has the capability to respond/serve both

First-Order Models: Here if we proposed first-order logic as a good knowledge representation language than propositional logic is just because there is more expressive than we

With reference to telephone traffic, explain the terms BHCA. BHCA: The number of call attempts in the busy hour is termed as busy hour call attempts (BHCA) that is an importa

What is reducibility?  The primary method of proving some problems are computationally unsolvable.       It is known as reducibility. Reducibility always includes two problems