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:
what is mutual induction in theory of computation
What are the registers generally contained in the processor? MAR-memory address register MDR-memory data register IR-Instruction Register RO-Rn-General purpose registe
A Network uses a star topology if? A Network utilizes a star topology if all computers attach to a single central point.
Q. Determine the performance of a parallel algorithm? One more method of determining the performance of a parallel algorithm can be performed after calculating a parameter know
What are difference between Mealy and Moore state machine? Difference between Mealy and Moore state machine: 1) Mealy and Moore models are the fundamental models of state ma
Q. What do you mean by Processor Arrangements? It is a very common event in data parallel programming to combine many processors to execute specific tasks. To achieve this obje
Assignment 1: Decision tree learning for cancer diagnosis In this mini-project, you will implement a decision-tree algorithm and apply it to breast cancer diagnosis. For each p
The digital circuits that we use now-a-days are constructed with NOR or NAND gates in place of AND-OR-NOT gates. NOR & NAND gates are known as Universal Gates as we can realize any
What is a Region? A Region is a continuous area of a process's address space (like text, data and stack). The kernel in a "Region Table" that is local to the process mainta
What is link destruction? Link destruction is inverse of link creation. When a link is destroyed makes sure the associated objects accessible by other handles or intentionally
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