eduzhai > Applied Sciences > Engineering >

Embedding Parallelism in the Process of Sorting

  • Save

... pages left unread,continue reading

Document pages: 7 pages

Abstract: This paper is aimed at discussing the efficiency gained in the process of sorting by embedding parallelism in the task of comparing the values. The interconnection networks to implement the logic and the criteria embedded to generate parallelism in the process are discussed. Depending on the logic embedded to generate parallelism in sorting, improvement in the performance of the process of sorting varies. Speedup gained and efficiency generated by three sorting algorithms: enumeration sort, odd-even transposition sort, parallel quicksort are discussed. As improvement in performance demands extra cost, hence the criteria chosen to embed parallelism is a trade off between the increase in overall cost and decrease in time taken in generating the result. The scenario in which each of the algorithms generates good performance and is preferred to be implemented is discussed and the efficiency gained by each criteria of parallelism is illustrated.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×