TY - JFULL AU - Ezequiel Herruzo and Juan José Cruz and José Ignacio Benavides and Oscar Plata PY - 2008/10/ TI - A Message Passing Implementation of a New Parallel Arrangement Algorithm T2 - International Journal of Electrical and Computer Engineering SP - 3217 EP - 3223 VL - 2 SN - 1307-6892 UR - https://publications.waset.org/pdf/13070 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 21, 2008 N2 - This paper describes a new algorithm of arrangement in parallel, based on Odd-Even Mergesort, called division and concurrent mixes. The main idea of the algorithm is to achieve that each processor uses a sequential algorithm for ordering a part of the vector, and after that, for making the processors work in pairs in order to mix two of these sections ordered in a greater one, also ordered; after several iterations, the vector will be completely ordered. The paper describes the implementation of the new algorithm on a Message Passing environment (such as MPI). Besides, it compares the obtained experimental results with the quicksort sequential algorithm and with the parallel implementations (also on MPI) of the algorithms quicksort and bitonic sort. The comparison has been realized in an 8 processors cluster under GNU/Linux which is running on a unique PC processor. ER -