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!
Q. Speed Up - metrics for performance evaluation?
Speed up is ratio of time needed to execute a given program employing a specific algorithm on a machine with single processor (It implies that T (1) (where n=1)) to time needed to execute same program using a particular algorithm on a machine with multiple processors (It implies that T (n)). Fundamentally speed up factor helps us in knowing relative gain achieved in shifting from a sequential machine to a parallel computer. It can be noted the term T(1) denotes amount of time taken to execute a program employing the best sequential algorithm It implies that the algorithm with least time complexity.
Let's take an illustration and explain practical use of speedup. Suppose we have a problem of multiplying n numbers. Time complexity of sequential algorithm for a machine with single processor is O(n) because we require one loop for reading and computing output. But in the parallel computer let every number is assigned to specific processor and computation model being used being a hypercube. In such a condition the total number of steps essential to compute result is log n it implies that time complexity is O(log n). Figure below explains the steps to be followed for achieving the required output in a parallel hypercube computer model.
As number of steps followed is equivalent to 3 it implies that log 8 where n is number of processors. Therefore complexity is O(log n).
In view of fact sequential algorithm takes 8 steps whereas above mentioned parallel algorithm takes 3 steps speed up is as under:
Because value of S(n) is inversely proportional to time needed to calculate output on a parallel number that in turn is dependent on number of processors used for performing the computation. The relation amid S(n) versus Number of processors is displayed in Figure. The speedup is directly proportional to number of processors so a linear arc is portrayed. But in situations where there is parallel overhead the arc is sub-linear.
Figure: Steps followed for multiplying n numbers stored on n processors
Figure: Speed-up vs. Number of Processors
How are devices represented in UNIX? All devices are shown by files called special files that are located in /dev directory. Therefore, device files and other files are named a
Andrew, a 17 zear old university student decided to hold a post exams party for his friends. Andrew asked Kath, a family friend and the owner of 'Kath's Katerers' to supply food
Q. Explain the Structured Design of system? Structured Design utilizes graphic description (Output of system analysis) and focuses on development of software specifications.
Q. Explain the Message Passing Interface? The Message Passing Interface (MPI) is a universal benchmark for providing communication among multiple simultaneous processes on a di
Application and Function Areas - artificial intelligence: Individual applications and function often drive "AI" research much more than the long term relative field described
flow chart for ''sin x'' as sum of serie
How blocking and non blocking statements get executed? Execution of blocking assignments can be viewed just like a one-step process: 1. Evaluate RHS (right-hand side equatio
MINI PROJECT ON UNIVERSITY SCHEMA
Q. Starting parallel virtual machine? To initialize PVM on any host on that PVM has been installed we can type % pvm The PVM console known as pvm is a standalone PVM t
Describe an abstract class 'Bank' having abstract methods as 'CreateAccount' 'depositAmount' & 'withDrawAmount'.Add method definitions for 'CalculateInterest' and 'SetInterest' as
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