Scalability versus Execution Time in Scalable Systems

Abstract

Parallel programming is elusive. The relative performance of different parallel implementations varies with machine architecture, system and problem size. How to compare different implementations over a wide range of machine architectures and problem sizes has not been well addressed due to its difficulty. Scalability has been proposed in recent years to reveal scaling properties of parallel algorithms and machines. In this paper, the relation between scalability and execution time is carefully studied. The concepts of crossing point analysis and range comparison are introduced. Crossing point analysis finds slow/fast performance crossing points of parallel algorithms and machines. Range comparison compares performance over a wide range of ensemble and problem size via scalability and crossing point analysis. Three algorithms from scientific computing are implemented on an Intel Paragon and an IBM SP2 parallel computer. Experimental and theoretical results show how the combination of scalability, crossing point analysis, and range comparison provides a practical solution for scalable performance evaluation and prediction. While our testings are conducted on homogeneous parallel computers, the proposed methodology applies to heterogeneous and network computing as well. © 2002 Elsevier Science (USA)

A Study of the Dynamic Characteristics of Software Implementation as an Essential Part for a Universal Description of Algorithm Properties

“…Approaches to scalability studies vary greatly according to different sources. These differences are explained both by different understandings of scalability [9], [10], [11], [12], [13] and by different methods of obtaining data on a program's scalability.…”

Adaptive Semantic Tag Mining from Heterogeneous Clinical Research Texts

“…Currently there is no wellaccepted definition for FSTs; therefore, the determination of the FSTs remains a contextual, task-dependent decision according to the feedback we collected from some medical doctors. Therefore, following the strategies used in [46,47], we resorted to comparing the trends (1) in the percentage of retrieved relevant FSTs over the maximum number of potential FSTs for a certain data size and (2) in the computational speed (i.e., the data size divided by the execution time) for various data sizes across the three text types.…”

Scalable Architectures for Platform-as-a-Service Clouds: Performance and Cost Analysis

“…Alternatively, if an application sustains consistent performance for individual users as the number of concurrent users grows, it is scaling. To evaluate application scalability, many scalability metrics have been proposed in distributed computing and parallel computing environments [9][10][11][12], such as 1) speedup (how the rate of doing workload increases with the number of processors compared to one processor), 2) efficiency (the workload rate per processor) or 3) resource usage. Here, we propose three metrics to evaluate the scalability in our case:…”

“…In a similar vein, [7] focusses on performance. These works consider earlier pre-cloud investigations as in [9] or [10].…”