Estimation of the Speedup of Distributed Applications

Zuberek, W. M. (2004) Estimation of the Speedup of Distributed Applications. In: INTERNATIOAL CONFERENCE ON ADVANCES IN THE INTERNET, SYSTEMS, AND INTERDISCIPLINARY RESEARCH (IPSI’04), June 4-5, 2004, Studenica Monastery, Serbia. (Submitted)

[img] [English] PDF - Submitted Version
Available under License Creative Commons Attribution Non-commercial.

Download (139kB)


Speedup is one of the main performance charac- teristics of distributed applications. It is defined as the ratio of application’s execution time on a single processor to the execution time, of the same workload, on a system composed on N processors. This paper analyzes, in very general terms, the speedup that can be achieved in distributed environ- ments and shows why some applications scale very well with the number of processors while others have strict limitations on the speedup that can be achieved in distributed environ- ments. The existence of such limitations simply means that a straightforward distribution of a (sequential) workload is not a satisfactory approach, and new algorithms are needed to use distributed environments in a more satisfactory way.

Item Type: Conference or Workshop Item (Paper)
Item ID: 14564
Keywords: Distributed systems, speedup estimation, computation-to-communication ratio, iterative methods, state space generation, SETI@home
Department(s): Science, Faculty of > Computer Science
Date: June 2004
Date Type: Submission
Related URLs:

Actions (login required)

View Item View Item


Downloads per month over the past year

View more statistics