Empirical evaluation of parallel implementations of MergeSort
Sorting algorithms are a fundamental piece in the development of computer systems. MergeSort is a well-known sorting algorithm, much appreciated due to its efficiency, relative simplicity, and other features. This article presents an empirical evaluation of parallel versions of MergeSort, applying...
Saved in:
| Main Authors: | José Eduardo Solsona, Sergio Nesmachnow |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidad San Francisco de Quito USFQ
2025-05-01
|
| Series: | ACI Avances en Ciencias e Ingenierías |
| Subjects: | |
| Online Access: | https://revistas.usfq.edu.ec/index.php/avances/article/view/3701 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Parallel Sort Implementation and Evaluation in a Dataflow-Based Polymorphic Computing Architecture
by: David Hentrich, et al.
Published: (2025-05-01) -
Parallel Computing for Sorting Algorithms
by: Baghdad Science Journal
Published: (2014-06-01) -
A scalable parallel sorting algorithm by regular sampling for big data
by: Ying WANG, et al.
Published: (2024-07-01) -
Parallel construction of binary tree based on sorting
by: Ya. E. Romm, et al.
Published: (2018-12-01) -
Cluster Sort: A Novel Hybrid Approach to Efficient In-Place Sorting Using Data Clustering
by: Mohit Subramaniam, et al.
Published: (2025-01-01)