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 "turn-around" time of a user job is the? Ans. Total time taken to execute the job is called "turn around" time.

Write the expression for Boolean function for F (A, B, C) = ∑m (1,4,5,6,7) in standard POS form.                                   Ans: f (A,B,C )= ΣM (1,4,5,6,7) in standard POS

Fitness function - canonical genetic algorithm: Conversely the fitness function will use an evaluation function to calculate a value of worth for the individual accordingly th

Function name or connective symbol: Whether if we write op(x) to signify the symbol of the compound operator then predicate name and function name or connective symbol are the

Side tone is the speech heard by (A)  the receiving subscriber (B)  both the receiving and calling subscriber (C) by on looker (D) by calling subscriber Ans

Define a B tree of order m. B Tree of order m  A balanced multiway search tree of order m in which every non root node having at least m/2 keys is known as a B-Tree of order

Suppose that the working register W contains the value 0x4F, the register FSR contains the value 0x2B; the register with address 0x2B contains 0x2F and the instruction ADDWF INDF,

Define the difference between static RAM and dynamic RAM? The RAM family comprises two important memory devices that are static RAM (SRAM) and dynamic RAM (DRAM). The main diff

What is big endian and little endian format? The name big endian is used when lower byte addresses are used for the more important of the word. The name little endian is used f