Experimental analysis of SIMD recursive digital filtering on the PASM system prototype

Experimental analyses of an implementation of an SIMD algorithm for recursive digital filtering using the partitionable SIMD/MIMD (PASM) parallel processing system prototype at Purdue University are presented. The algorithm used easily generalizes to use N processing elements (PEs). Timing-based analyses are made based on a four-PE version by examining the following constituent execution times: microcontroller execution time, PE execution time, broadcast communication time, and the execution time of five additional phases in the recursive digital filtering summation calculation. Broadcast execution time was found to account for roughly 44% of the total execution time, and the implication of this is discussed for larger problem sizes and machine sizes. The total measured execution time is verified through summation of execution times for the various components of the algorithm.<<ETX>>