Skip to main content
Conference Proceedings

Parallelization of fast sort algorithm

Communications in Computer and Information Science (2017) 756 408-421
DOI: 10.1007/978-3-319-67642-5_34
3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Marszałek, Z. (2017). Parallelization of fast sort algorithm. In Communications in Computer and Information Science (Vol. 756, pp. 408–421). Springer Verlag. https://doi.org/10.1007/978-3-319-67642-5_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free