Fast Parallel Sorting Algorithm Using Subsets and Quick Sort

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Balkan Journal of Electrical and Computer Engineering
Volume:3 Issue:1
Fast Parallel Sorting Algorithm Using Subsets and Quick Sort

Fast Parallel Sorting Algorithm Using Subsets and Quick Sort

Authors : A BOSAKOVAARDENSKA, N VASİLEV, L KOSTADİNOVAGEORGİEVA

Pages : 27-29

Doi:10.17694/bajece.12812

View : 21 | Download : 12

Publication Date : 2015-02-27

Article Type : Review Paper

Abstract :— This paper presents fast parallel sorting algorithm which uses division in subsets and quick sort algorithm. The proposed algorithm is evaluated by analytic way and results shows that it will be faster than algorithm in [3] when time for division in subsets of all set is bigger than time for sending/receiving of partial subsets
Keywords :

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.

Index of Academic Documents
İzmir Academy Association
CopyRight © 2023-2025