This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance Measures for Evaluating Algorithms for SIMD Machines
July 1982 (vol. 8 no. 4)
pp. 319-331
L.J. Siegel, School of Electrical Engineering, Purdue University
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 "sprice" which assigns a weighted value to computations and processors.
Index Terms:
SIMD machines, Algorithm evaluation, parallel processing, performance measures, reconfigurable systems
Citation:
L.J. Siegel, H.J. Siegel, P.H. Swain, "Performance Measures for Evaluating Algorithms for SIMD Machines," IEEE Transactions on Software Engineering, vol. 8, no. 4, pp. 319-331, July 1982, doi:10.1109/TSE.1982.235426
Usage of this product signifies your acceptance of the Terms of Use.