Already have an account? Get multiple benefits of using own account!
Login in your account..!
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
Find out the two inputs when the NAND gate output will be low. Ans. The output of NAND gate will be low if the two inputs are 11. The Truth Table of NAND gate is shown
What are advantages and drawbacks of latches? Advantages and drawbacks of latches: Area of a latch is classically less than a Flip Flop. It consumes less power, becaus
Unions allow the same area of memory to be accessed as different data types. The insurance example above would not work. Unions are useful (often in embedded programming) when i
Analysis and design form the basis on any significant software artifact. Analysis is critical in terms of making sure that the final artifact actually meets user requirements (ie b
The three main elements of LDB are:- Structure Selections and Database Program.
Analyse the future of Operating Systems with reference to Virtualisation.words accepted#
How do I connect to an SQL Server instance that is running on a machine with multiple instances of SQL Server 2000? Ans) Every instance of MS SQL Server must be listening on a d
Construct a shift register from S-R flip-flops. Explain its working. Ans: S-R Flip-Flop Shift Register: Shift registers can be built through using SR flip-flops. Fig.(a)
Explain Big - Endian and Little- Endian representations Ans: The Big- endian is used where lower byte addresses are used for the more significant bytes (leftmost bytes) of the
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