By Topic

Speedup, communication complexity and blocking-a La Recherche du Temps Perdu

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
$33 $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)
D. C. Marinescu ; Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA ; J. R. Rice

The paper investigates the time lost in a parallel computation due to sequential and duplicated work, communication and control, and blocking. It introduces the concept of relative speedup and proposes characterizations of parallel algorithms based upon the communication complexity and the blocking model. The paper discusses the impact of the processor's architecture upon the measured speedup. It shows that a large speedup may be due to an inefficient sequential computation, e.g. due to the cache management, rather than to an efficient parallel computation. A model of parallel computations which takes into account sequential and duplicated work, communication and control and blocking is presented. The paper shows that the scalability of a parallel computation is determined by the communication complexity. The model is used to predict the asymptotic behavior, the maximum speedup and the optimal number of processors. An incore 3D FFT algorithm for distributed memory MIMD systems and a Chebyshev iterative algorithm for solving a linear system of equations are used to illustrate the concepts

Published in:

Parallel Processing Symposium, 1993., Proceedings of Seventh International

Date of Conference:

13-16 Apr 1993