Scribd
Upload
16 views14 pages

Unit 4 HPC Part4

Uploaded by

Pratik Oza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
16 views14 pages

Unit 4 HPC Part4

Uploaded by

Pratik Oza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 14

Sanjivani Rural Education Society’s

Sanjivani College of Engineering, Kopargaon-423 603


(An Autonomous Institute, Affiliated to Savitribai Phule Pune University, Pune)
NAAC ‘A’ Grade Accredited, ISO 9001:2015 Certified

Department of Computer Engineering


(NBA Accredited)

Course - High Performance Computing (410241)


Unit 4- Analytical Models of Parallel Programs

Prof. B. J. Dange
Assistant Professor
E-mail : [email protected]
Contact No: 91301 91301 Ext :145, 9604146122
Isoefficiency Metric of Scalability
• For a given problem size, as we increase the number of processing elements, the overall
efficiency of the parallel system goes down for all systems.

• For some systems, the efficiency of a parallel system increases if the problem size is
increased while keeping the number of processing elements constant.

DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 2


Isoefficiency Metric of Scalability

Variation of efficiency: (a) as the number of processing elements is increased for a given
problem size; and (b) as the problem size is increased for a given number of processing
elements. The phenomenon illustrated in graph (b) is not common to all parallel systems.
DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 3
Isoefficiency Metric of Scalability

• What is the rate at which the problem size must increase with respect to the number of
processing elements to keep the efficiency fixed?

• This rate determines the scalability of the system. The slower this rate, the better.

• Before we formalize this rate, we define the problem size W as the asymptotic number of
operations associated with the best serial algorithm to solve the problem.

DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 4


Isoefficiency Metric of Scalability
• We can write parallel runtime as:
(8)

• The resulting expression for speedup is

(9)
Finally, we write the expression for efficiency as

(10)

DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 5


Isoefficiency Metric of Scalability
• For scalable parallel systems, efficiency can be maintained at a fixed value (between
0 and 1) if the ratio To / W is maintained at a constant value.
• For a desired value E of efficiency,
(11)

• If K = E / (1 – E) is a constant depending on the efficiency to be maintained, since


To is a function of W and p, we have
(12)

DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 6


Isoefficiency Metric of Scalability
• The problem size W can usually be obtained as a function of p by algebraic manipulations
to keep efficiency constant.

• This function is called the isoefficiency function.

• This function determines the ease with which a parallel system can maintain a constant
efficiency and hence achieve speedups increasing in proportion to the number of
processing elements

DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 7


Isoefficiency Metric: Example
• The overhead function for the problem of adding n numbers on p processing elements
is approximately 2p log p .

• Substituting To by 2p log p , we get


= (13)

Thus, the asymptotic isoefficiency function for this parallel system is


.
• If the number of processing elements is increased from p to p’, the problem size (in this
case, n ) must be increased by a factor of (p’ log p’) / (p log p) to get the same efficiency
as on p processing elements.

DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 8


Isoefficiency Metric: Example
Consider a more complex example where
• Using only the first term of To in Equation 12, we get

= (14)

• Using only the second term, Equation 12 yields the following relation between W
and p:
(15)

• The larger of these two asymptotic rates determines the isoefficiency. This is given
by Θ(p3)
DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 9
Cost-Optimality and the Isoefficiency Function
• A parallel system is cost-optimal if and only if
(16)

• From this, we have:

(17)
(18)

• If we have an isoefficiency function f(p), then it follows that the relation W = Ω(f(p))
must be satisfied to ensure the cost-optimality of a parallel system as it is scaled up.

DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 10


Lower Bound on the Isoefficiency Function

• For a problem consisting of W units of work, no more than W processing elements can
be used cost-optimally.

• The problem size must increase at least as fast as Θ(p) to maintain fixed efficiency;
hence, Ω(p) is the asymptotic lower bound on the isoefficiency function.

DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 11


Summary

• Isoefficiency Metric of Scalability

• Cost-Optimality and the Isoefficiency Function

• Lower Bound on the Isoefficiency Function

DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 12


References

• Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar, "Introduction to
Parallel Computing", 2nd edition, Addison-Wesley, 2003, ISBN: 0-201-64865-2.

DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 13


Thank You.

DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 14

You might also like