Paper Info
Title
Parallelization of Fast Sort Algorithm.
Abstract
Sorting algorithms are widely used in databases and various information systems to organize and search for information. In this paper, author describes version of parallization of fast sort algorithm for large data sets. Examination of the paralization of fast sort algorithm performance was subject to performance tests, that showed validity.
Year
DOI
Venue
2017
10.1007/978-3-319-67642-5_34
Communications in Computer and Information Science
Keywords
Field
DocType
Parallel algorithm,Data sorting,Data mining,Analysis of computer algorithms
Information system,Data set,Parallel algorithm,Computer science,Parallel computing,Sorting algorithm
Conference
Volume
ISSN
Citations 
756
1865-0929
0
PageRank 
References 
Authors
0.34
18
1
Name
Order
Citations
PageRank
Zbigniew Marszalek1315.95