Evaluate fixed execution time, Computer Engineering

The statement of Gustafson's law can be described with the help of an illustration. Let us take a problem, say P, which has to be solved using a parallel computer. Let Ts be the time taken which is in use as constant for implementing sequential operations. Let Tp (N, L) be the time taken for running the parallel operations with L as total load on a parallel computer with N processors. The total time taken for finding the answer of problem is T=Ts + Tp. Thus, S (N) can be calculated as under:

2037_Gustafsons Law1.png

 

Also, Tp (1, L)= N* Tp (N, L) i.e. time taken to implement parallel operations having a load of L on one processor is equivalent to the N multiplied by the time taken by one computer having N processor. If α be the fraction of sequential load for a given problem i.e.

α =          Ts / Ts + T p ( N , L)

Substituting Tp (1, L)= N* Tp (N, L) we find,

 

S (n) =   Ts + N * T p ( N , L) / Ts +T p( N , L)

150_Gustafsons Law2.png

Fixed Execution Time for Gustafson's Law

1440_Gustafsons Law3.png

Now, let us change the total equation of S(N) in the form of X. We get

S(N) = α +N * (1-α)

S (N) = N -α * (N-1)

Now, let us put some values of α and compute the speed up factor for increasing values of α i.e. sequential factor of work load for a fixed number of processors say N.  Figure shows a pictorial view of effect of Gustafson's Law on the speed up factor. The graph illustrate as the value of α increases, the speed up factor increases. This decrease is because of overhead caused by inter-processor communication.

1773_Gustafsons Law4.png

α  (Sequential Operations)

Figure: S (N) vs. α (Graph is not to scale)

Posted Date: 3/5/2013 5:05:28 AM | Location : United States







Related Discussions:- Evaluate fixed execution time, Assignment Help, Ask Question on Evaluate fixed execution time, Get Answer, Expert's Help, Evaluate fixed execution time Discussions

Write discussion on Evaluate fixed execution time
Your posts are moderated
Related Questions
The process of importing data from one more Access database follows these common steps they are. ? Preparing the document for import operation and make ensure that extensions ar

Grounding a variable - first-order logic: The perform of making ourselves clear about a variable by introducing an exists or a forall sign is called quantifying the variable.

Prove the following Boolean identities using the laws of Boolean algebra (A + B)(A  + C) = A + BC Ans. (A+B)(A+C)=A+BC LHS AA+AC+AB+BC=A+AC+AB+BC OR  A((C+1)+A(B+1))+BC

Define register file. All general purpose registers are combined into a one block called the register file.

How many select lines will a 32:1 multiplexer will have ? Ans. 5 select lines will be required for 32 inputs, as 2 5 = 32.

Q. Multithreaded Architecture? It is clear at the moment if we provide a lot of contexts to multiple threads then processors with numerous contexts are known as multithreaded s

Ask question #Midifference between cardinality and modality nimum 100 words accepted#

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

Describe the properties of Attributesand operations Attributes are named slots for data values that belong to the class. Previously we have studied in MCS-024, different o

Q. Explain about Associative Memory Organisations? The associative memory is arranged in w words with b bits per word. In w x b array, every bit is known as a cell. Every cell