Performance measures for evaluating algorithms for SIMD machines

Journal Article · Thu Jul 01 04:00:00 EDT 1982 · IEEE Trans. Software Eng.; (United States)

DOI:https://doi.org/10.1109/TSE.1982.235426· OSTI ID:5000975

Siegel, L J; Siegel, H J; Swain, P H

This paper examines measures for evaluating the performance of algorithms for single instruction stream-multiple data stream (SIMD) machines. The SIMD mode of parallelism involves using a large number of processors synchronized together. All processors execute the same instruction at the same time; however, each processor operates on a different data item. The complexity of parallel algorithms is, in general, a function of the machine size (number of processors), problem size, and type of interconnection network used to provide communications among the processors. Measures which quantify the effect of changing the machine-size/problem-size/network-type relationships are therefore needed. A number of such measures are presented and are applied to an example SIMD algorithm from the image processing problem domain. The measures discussed and compared include execution time, speed, parallel efficiency, overhead ratio, processor utilization, redundancy, cost effectiveness, speed-up of the parallel algorithm over the corresponding serial algorithm, and an additive measure called price which assigns a weighted value to computations and processors. 28 references.

• Research Organization: Purdue Univ., West Lafayette, IN
• OSTI ID: 5000975
• Journal Information: IEEE Trans. Software Eng.; (United States), Journal Name: IEEE Trans. Software Eng.; (United States) Vol. 4; ISSN IESED
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
ARRAY PROCESSORS
COMMUNICATIONS
IMAGE PROCESSING
MATHEMATICAL LOGIC
PARALLEL PROCESSING
PERFORMANCE
PROCESSING
PROGRAMMING