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
What is write miss? During the write operation if the addressed word is not in cache then said to be write miss.

Explain Simplifying the SOP f the Boolean expression using the K-Map? To simplify the SOP of the Boolean expression using the K map, first identify all the input combinations tha

What are the two aspects of locality of reference? Define them. Two aspects of locality of reference are temporal aspects and spatial aspect. Temporal aspect is that a r

The C programming language is a standardized programming language forrned in the early 1970s by Ken Thompson and Dennis Ritchie for use on the UNIX operating system. It has since s

A 2-digit BCD D/A converter is a weighted resistor type with E R = 1 Volt, with R = 1M? , R f = 10K? . Find resolution in Percent and Volts. Ans. Resolution = 1/2 2 = 0.25 vo

How many Flip-Flops are required for mod-16 counter? Ans. 4 flip-flops is required for Mod-16 Counter. For Mod-m Counter, we require N flip-flops where N is selected to be the

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

Ring This is a easy linear array where the end nodes are connected.  It is equivalent to a engage with wrap around connections. The data transmit in a ring is normally one dire

Your shell should accept and execute the pipe "|"  operator. This will look like the following: | The functionality of this operator is to execute command1 and send i