Skip to Main content Skip to Navigation
Conference papers

Sorting Algorithms on ARM Cortex A9 Processor

Abstract : Sorting is considered as one of the most well-known problems in the computer world. It is a common process among several application areas, such as real time decision support systems and intelligent transport applications. In this paper, we propose a software implementation for different sorting algorithms, such as InsertionSort, QuickSort, HeapSort, ShellSort, MergeSort and TimSort on the Zynq Zedboard platform. In addition, the performance of the different algorithms are compared in terms of averages and standard-deviation of computational time, energy consumption and stability. As demonstrated by the experimental results, the ShellSort is 42.1% faster and can even reach 72% when running on the ARM Cortex A9 processor mainly if the number of elements (n) to be sorted is greater than 64. Otherwise, TimSort is the best algorithm. Also, ShellSort is the best algorithm in terms of standard-deviation of computational times and energy consumption.
Document type :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03716647
Contributor : Kathleen TORCK Connect in order to contact the contributor
Submitted on : Thursday, July 7, 2022 - 4:15:18 PM
Last modification on : Friday, July 8, 2022 - 4:15:20 AM

Identifiers

Collections

Citation

Yomna Ben Jmaa Chtourou, David Duvivier, Mohamed Abidi. Sorting Algorithms on ARM Cortex A9 Processor. 35th International Conference on Advanced Information Networking and Applications, AINA 2021, May 2021, Toronto, Canada. pp.355-366, ⟨10.1007/978-3-030-75078-7_36⟩. ⟨hal-03716647⟩

Share

Metrics

Record views

5