By Topic

A Memory-Constrained Scalability Metric

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

A performance evaluation metric called CMP scalability is introduced This metric is useful in analyzing performance of a parallel algorithm as the number of processors grows but the memory size per processor is fixed. The CMP scalability metric is derived for the parallel Matrix Multiplication (MM). Gauss Jordan Elimination (GJE), and Fast Fourier Transform (FFT). These examples show that the CMP scalability metric and the isoefficiency metric really address different aspects of scalability and could lead to very different conclusions. According to the CMP scalability analysis FFT is more scalable than GJE. Interestingly, conclusions drawn from the isoefficiency analysis are quite the opposite. The CMP scalability metric, and so also the isoefficiency metric, is a function indicating the asymptotic behavior as the number of processors becomes large. However, the CMP analysis can also help to analyze the performance of an algorithm on a given architecture with a limited number of processors. We present such an analysis of the three algorithms on a 16K processor MasPar MP-1 machine.

Published in:

Parallel Processing, 1994. ICPP 1994 Volume 3. International Conference on  (Volume:3 )

Date of Conference:

15-19 Aug. 1994