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
Q. Explain about Parity bit? Parity bit is an error detection bit added to binary data such that it creates total number of 1's in the data either odd or even. For illustration

Define Cloud Computing with example. Cloud computing is a model for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g., se

It allows code reusability. Reusability saves time in program development. It encourages the reuse of proven and debugged high-quality software, thus decreasing problem after a sys

Speedup First, we take the speedup factor which is we see how much speed up performance we achieve by pipelining. First we take ideal case for measuring the speedup. Let n b

What are several issues for selecting best workarounds in multiple inheritances? Some restrictions methods are used. Use two approaches of delegations, which is an implementati

Creating a contacts application: First, a contact is defined as the tuple: firstName, lastName, phoneNumber and email. You will create a class Contact that allows getting a

Define buffering.  A buffer is a memory area that keeps data while they are transferred among two devices or among a device and an application. Buffering is done for three reas

Printers are devices which put ink on paper in a controlled manner. They manually produce photographic images orreadable text. Printers have gone through a large transition in tech

pebble merchant

An experts system has knowledge that lets it reason about its own operations plus a structure that simplifies this reasoning process. For example if an expert system