Performance Evaluation of Binary Sort and Odd-Even Transposition Sort Parallel Programs In Transputer Network

Writer/Researcher : M. A. Kartawidjaja

Area of Research : Computer Engineering

Journal : Metris

Volume : 7, No.2

Year : 2006

Sorting data is a time-consuming process performed by computers, especially if it concerns an enormous set of data. Therefore it is reasonable to consider parallel computation in sorting data. In this article the performance of two parallel sorting algorithms, binary sort and odd-even transposition sort, is analyzed on a transputer network. It is observed that binary sort provides a better performance compared to odd-even transposition sort in terms of speedup on transputer network with ring configuration.