DeepAI AI Chat

Comparative Analysis for Quick Sort Algorithm under four Different Modes of Execution

09/03/2021

∙

by Mohammad Fasha, et al.

∙

∙

This work presents a comparison for the performance of sequential sorting algorithms under four different modes of execution, the sequential processing mode, a conventional multi-threading implementation, multi-threading with OpenMP Library and finally parallel processing on a super computer. Quick Sort algorithm was selected to run the experiments performed by this effort and the algorithm was run using different arrays sizes and different number of processors. The results and findings were analyzed uncovering limitations as well as enhancement potentials of sequential sorting algorithms using parallelism.

∙ 08/14/2022

Towards Parallel Learned Sorting

We introduce a new sorting algorithm that is the combination of ML-enhan...

0 Ivan Carvalho, et al. ∙

∙ 05/09/2023

Performance Evaluation of Parallel Sortings on the Supercomputer Fugaku

Sorting is one of the most basic algorithms, and developing highly paral...

0 Tomoyuki Tokuue, et al. ∙

∙ 08/29/2018

A study of integer sorting on multicores

Integer sorting on multicores and GPUs can be realized by a variety of a...

0 Alexandros V. Gerbessiotis, et al. ∙

∙ 08/23/2018

Exploring Parallel Execution Strategies for Constraint Handling Rules - Work-in-Progress Report

Constraint Handling Rules (CHR) is a declarative rule-based formalism an...

0 Thom Frühwirth, et al. ∙

∙ 12/01/2020

Huskysort

Much of the copious literature on the subject of sorting has concentrate...

0 R. C. Hillyard, et al. ∙

∙ 09/28/2020

Engineering In-place (Shared-memory) Sorting Algorithms

We present sorting algorithms that represent the fastest known technique...

0 Michael Axtmann, et al. ∙

∙ 08/09/2018

LED Arrays of Laser Printers as Sources of Valuable Emissions for Electromagnetic Penetration Process

Protection of information against electromagnetic eavesdropping is an im...

0 Ireneusz Kubiak, et al. ∙