Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
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!
To calculate speed up performance various laws have been developed. These laws are discussed here.
Amdahl's Law
Remember, the speed up factor helps us in knowing the relative gain achieved in shifting the implementation of a task from sequential computer to parallel computer and the performance does not enhance linearly with the increase in number of processors. Due to the above reason of saturation in 1967 Amdahl's law was derived. Amdahl's law states that a program have two types of operations i.e. complete sequential operations which should be done sequentially and complete parallel operations which can be implemented on multiple processors. The statement of Amdahl's law can be described with the help of an example.
Let us take a problem say P which has to be solved using a parallel computer. According to Amdahl's law, there are generally two types of operations. Thus, the problem will have some sequential operations and some parallel operations. We already know that it needs T (1) amount of time to implement a problem using a sequential algorithm and sequential machine. The time to compute the sequential operation is a fraction α (alpha) (α ≤ 1) of the total implementation time i.e. T (1) and the time to compute the parallel operations is (1- α). Thus, S (N) can be calculated as under:
In a particular exchange during busy hour 1200 calls were offered to a group of trunks, during this time 6 calls were lost. The average call duration being 3 minutes Calculate
about java types
What are kinds of models? Class model - Objects in the system and their relationships. State model - Life history of the objects. Interaction model - Interactions between
A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string of t
What is Hamiltonian path? A Hamiltonian path in a directed graph G is a directed path that goes by each node exactly once. We consider a special case of this difficulty where
Q. What is Bus arbitration? In this technique, I/O interface first needs to control bus and only after that it can request for an interrupt. In this technique because only one
Q. Learn synchronization principles? To learn synchronization subsequent dependencies are recognized: i) Data Dependency: These are RAW, WAW and WAR dependency. ii) Co
Q. Illustration to demonstrate design of sequential circuits? Let us take an illustration to demonstrate above process. Suppose we want to design 2-bit binary counter employing
Q. Illustrate TCP - IP Networking Model? TCP/IP is an acronym for Transmission Control Protocol / Internet Protocol. It is a collection of applications, protocols and services.
Make a data structure to store information about the elements in the periodic table of elements. For each element, store the name, atomic number, chemical symbol, class, atomic we
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd