Performance modelling of three parallel sorting algorithms on a pipelined transputer network

✍ Scribed by Narasimhan, V. Lakshmi; Armstrong, J.

• Publisher: John Wiley and Sons
• Year: 1996
• Tongue: English
• Weight: 961 KB
• Volume: 8
• Category: Article
• ISSN: 1040-3108
• DOI: 10.1002/(sici)1096-9128(199606)8:5<335::aid-cpe202>3.0.co;2-y

✦ Synopsis

The implementation of three parallel sorting algorithms, namely binary sort, odd-even transposition sort and bitonic sort, on a network of transputers is analysedin the paper. The variation in the performance of these algorithms as the number of processors and sort size are changed is investigated. Experimental results show that when up to eight transputers are used, connected as a linear pipeline configuration, all three algorithms can achieve reasonable speedup ratios. The bitonic sort, binary sort and odd-even transposition sort achieve speedup ratios of 5 4 . 4 and 4, respectively, when eight processors are used to sort 100,000 integers. Analytical models are derived which can be used to predict the performance of the three algorithms when a linear pipeline configuration is used. The predicted performance of the algorithms is compared with the experimental performance in order to validate the model. When the models are used to predict the performance using 16 transputers, it is found that the speedup does not significantly improve compared to the performance achieved with eight transputers. This shows that interprocessor communication has a significant effect on the algorithmic performance when a larger number of processors are used. The conclusions reinforce the fact that the binary and bitonic sorting algorithms are not well-suited to a linear pipeline configuration and that they may perform better if a different topology were used, for example a mesh or a cube connection scheme. Further, the analytical technique used for performance modelling as elaborated in the paper can be employed profitably for other multiprocessor systems as well.