Performance analysis of 2-D inverse fast cosine transform employing multiprocessors

Abstract

The modeling and performance analysis of the two-dimensional (2-D) inverse fast cosine transform (FCT) algorithm on a multiprocessor has been considered. The computational and communication complexities of this algorithm on a shared bus, multistage interconnection network, and on mesh-connected multiprocessor architectures have been determined. The performance of the three multiprocessor architectures has been compared in terms of speedup, efficiency, and cost effectiveness. The evaluation shows that for this application, the indirect binary n-cube MIN connected multiprocessor architecture is the best in terms of speedup and efficiency among all three architectures considered.