Parallel Sort Implementation and Evaluation in a Dataflow-Based Polymorphic Computing Architecture
This work presents two variants of an odd–even sort algorithm that are implemented in a dataflow-based polymorphic computing architecture. The two odd–even sort algorithms are the “fully unrolled” variant and the “compact” variant. They are used as test kernels to evaluate the polymorphic computing...
Saved in:
| Main Authors: | David Hentrich, Erdal Oruklu, Jafar Saniie |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-05-01
|
| Series: | Computers |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-431X/14/5/181 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Parallel Computing for Sorting Algorithms
by: Baghdad Science Journal
Published: (2014-06-01) -
Empirical evaluation of parallel implementations of MergeSort
by: José Eduardo Solsona, et al.
Published: (2025-05-01) -
Cluster Sort: A Novel Hybrid Approach to Efficient In-Place Sorting Using Data Clustering
by: Mohit Subramaniam, et al.
Published: (2025-01-01) -
A Systematic Review of the Comparison of Different Types of Card Sorting
by: Elinda Tchivi, et al.
Published: (2025-01-01) -
An Automatic Sorting Control System Applied to Logistics Industry
by: YANG Yu, et al.
Published: (2019-08-01)