Speed up factor, Computer Engineering

Assignment Help:

Remember, the value of α is between 0 and 1. Now, let us put some values of α and compute the speed up factor for increasing values of number of processors.  We get that the S(N) keeps on decreasing with increase in the value of α (i.e. number of sequential operations as shown in Figure).

1703_Speed up factor.png

No. of processors required

Figure:- Speed-up vs. Number of Processors

The graph in Figure clearly shows that there is a bottleneck caused due to sequential operations in a parallel computer. Even when the amount of sequential operations is more, after increasing the number of processors, the speed up factor S (N) degrades.

The sequential fraction i.e. α can be compared with speed up factor S(N) for a fixed value of N say 500. Figure shows a pictorial view of effect of Amdahl's law on the speed up factor.

299_Speed up factor1.png

  α (Sequential Operations)


Related Discussions:- Speed up factor

Software Engineering, Software Engineering is a layered technology. Explain...

Software Engineering is a layered technology. Explain

How does tcp take of wrapping over of sequence numbers, How does TCP take o...

How does TCP take of wrapping over of sequence numbers? To handle out of instruct deliveries, transport protocols utilize sequencing. The sending side attaches a sequence numbe

Describe website features and functionality, This assignment relates to all...

This assignment relates to all of the course objectives but more specifically to your practical understanding and evaluation of the key issues in relation to the development of the

Define alphabet and string, Define Alphabet and String? A finite set of...

Define Alphabet and String? A finite set of symbols is termed as alphabet. An alphabet is frequently signified by sigma, yet can be specified any name. B = {0, 1} here B is

Explain optimal page replacement algorithm, Optimal Page Replacement Algori...

Optimal Page Replacement Algorithm The optimal page replacement algorithm that as well known as OPT is an algorithm which works as follows: while a page needs to be swapped in,

Boolean algebra, Prove the following Boolean identities using the laws of B...

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

C programming, At a shop of marbles, packs of marbles are prepared. Packets...

At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with thes

Describe set-associative mapping, Q. Describe Set-Associative Mapping? ...

Q. Describe Set-Associative Mapping? A third type of cache organization known as set-associative mapping is an improvement on direct mapping organization in that every word of

Learning abilities of perceptrons - ann, Learning Abilities of Perceptrons ...

Learning Abilities of Perceptrons - Artificial intelligence Computational learning theory is the study of what concepts specific learning schemes (representation and method) ca

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd