Back to search

Institutional Repository of Vilnius University

Greitojo duomenų rikiavimo lygiagretinimas /

Abstract

dc:description

Quicksort and its variations remain one of the most popular and effective data sorting algorithms. Sorted data is extremely useful for efficient data search. While technologies are improving, influence of parallelism is rising rapidly and benefit of data sorting algorithm remains the same. Quicksort algorithm has several different parallelism solutions, which have non-trivial realization and efficiency. Furthermore, Quicksort has several different selection of pivot, partitioning and recursion methods, which have different pros and cons. Purpose of this paper is to present recommendations for parallelism of Quicksort. Different solutions are realized and their efficiencies are compared in this paper. Additionally, this paper contains evaluation of various Quicksort variations and their influence to parallel Quicksort.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2020

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Steponavičius, Arnas,
Contributors dc:contributor
  • Radavičius, Irmantas

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
lit

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Steponavičius, Arnas,. Greitojo duomenų rikiavimo lygiagretinimas /. Institutional Repository of Vilnius University, 2020. https://repository.vu.lt/VU:ELABAETD81805541&prefLang=en_US