A sorting algorithm on a PC cluster

Abstract

A S o r t i n g A l g o r i t h m on a P C C l u s t e rJ a n e z Brest, A l e k s a n d e r Vre2e, V i l j e m Z u m e r U n i v e r s i t y of M a r i b o r F a c u l t y of E l e c t r i c a l E n g i n e e r i n g a n d C o m p u t e r Science S m e t a n o v a 17, SI-2000 M a r i b o r , S l o v e n i a janez.brest@uni-mb.si K e y words: computing system, network, parallel processing, data sorting, quicksort. AbstractData sorting is the most studied problem in computer science, for both, its theoretical importance and its use in so many applications. A parallel sorting algorithm on a heterogeneous system -PC cluster was implemented to minimize the application execution time. In this paper we propose a scheme for communicating data among subtasks during application program execution.We present some experimental results of the parallel sorting algorithm on a PC cluster.