COMPUTATIONAL SIMILARITY (REPRINTED FROM CONCURRENCY PRACTICE AND EXPERIENCE VOL 7, PG 147-166, 1995)
UNSPECIFIED (1995) COMPUTATIONAL SIMILARITY (REPRINTED FROM CONCURRENCY PRACTICE AND EXPERIENCE VOL 7, PG 147-166, 1995). SUPERCOMPUTER, 11 (4). pp. 102-123. ISSN 0168-7875Full text not available from this repository.
This paper enunciates the principle of Computational Similarity, whereby calculations with the same values for certain dimension less ratios are said to be ''computationally similar'' and as a consequence have the same optimum self-speedup and optimum number of processors. Based on a three-parameter description of the computer hardware, two dimensionless ratios, which are only a function of the problem size and the hardware parameters, completely determine the scaling. Contours of constant self-speedup can be drawn on a two-dimensional dimensionless Universal Scaling Diagram (DUSD). This diagram is for a particular class of timing expressions that can be shown to represent approximately the performance of a corresponding class of computer programs or benchmarks, but it applies to all computers describable by the three hardware parameters and to all problem sizes. Thus the dimensionless ratios play a similar role in the study of computer performance as do the Reynolds and other dimensionless numbers in fluid dynamics. This dimensional analysis of computer performance is illustrated by the case of the FFT1 benchmark from the Southampton ''Genesis'' distributed-memory Benchmarks.
|Item Type:||Journal Item|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Journal or Publication Title:||SUPERCOMPUTER|
|Number of Pages:||22|
|Page Range:||pp. 102-123|
Actions (login required)