Adaptation of multiway-merge sorting algorithm to MIMD architectures with an experimental study

Simple item page
buir.advisorAykanat, Cevdet
dc.contributor.authorCantürk, Levent
dc.date.accessioned2016-01-08T18:18:40Z
dc.date.available2016-01-08T18:18:40Z
dc.date.issued2002
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionAnkara : The Department of Computer Engineering and the Institute of Engineering and Science of Bilkent University, 2002.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2002.en_US
dc.descriptionIncludes bibliographical references leaves 73-78.en_US
dc.description.abstractSorting is perhaps one of the most widely studied problems of computing. Numerous asymptotically optimal sequential algorithms have been discovered. Asymptotically optimal algorithms have been presented for varying parallel models as well. Parallel sorting algorithms have already been proposed for a variety of multiple instruction, multiple data streams (MIMD) architectures. In this thesis, we adapt the multiwaymerge sorting algorithm that is originally designed for product networks, to MIMD architectures. It has good load balancing properties, modest communication needs and well performance. The multiway-merge sort algorithm requires only two all-to-all personalized communication (AAPC) and two one-to-one communications independent from the input size. In addition to evenly distributed load balancing, the algorithm requires only size of 2N/P local memory for each processor in the worst case, where N is the number of items to be sorted and P is the number of processors. We have implemented the algorithm on the PC Cluster that is established at Computer Engineering Department of Bilkent University. To compare the results we have implemented a sample sort algorithm (PSRS Parallel Sorting by Regular Sampling) by X. Liu et all and a parallel quicksort algorithm (HyperQuickSort) on the same cluster. In the experimental studies we have used three different benchmarks namely Uniformly, Gaussian, and Zero distributed inputs. Although the multiwaymerge algorithm did not achieve better results than the other two, which are theoretically cost optimal algorithms, there are some cases that the multiway-merge algorithm outperforms the other two like in Zero distributed input. The results of the experiments are reported in detail. The multiway-merge sort algorithm is not necessarily the best parallel sorting algorithm, but it is expected to achieve acceptable performance on a wide spectrum of MIMD architectures.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityCantürk, Leventen_US
dc.format.extentxv, 81 leaves, tables, graphs, 30 cmen_US
dc.identifier.itemidBILKUTUPB063136
dc.identifier.urihttp://hdl.handle.net/11693/15452
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectSortingen_US
dc.subjectParallel sortingen_US
dc.subjectAlgorithmsen_US
dc.subjectMultiway-merge sortingen_US
dc.subjectSorting in clustersen_US
dc.subject.lccQA76.6 .C36 2002en_US
dc.subject.lcshSorting (Electronic computers)en_US
dc.subject.lcshParallel processing (Electronic computers)en_US
dc.titleAdaptation of multiway-merge sorting algorithm to MIMD architectures with an experimental studyen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0002017.pdf
Size:
582.17 KB
Format:
Adobe Portable Document Format
Download
Collections
Dept. of Computer Engineering - Master's degree