Skip to main content

Sorting Algorithms on ARM Cortex A9 Processor

  • Conference paper
  • First Online:
Advanced Information Networking and Applications (AINA 2021)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 227))

  • 988 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Baklouti, M., Aydi, Y., Marquet, P., Dekeyser, J., Abid, M.: Scalable MPNOC for massively parallel systems - design and implementation on FPGA. J. Syst. Architect. Embedded Syst. Des. 56, 278–292 (2010)

    Article  Google Scholar 

  2. Ben Jmaa, Y.: Implémentation temps réel des algorithmes de tri dans les applications de transports intelligents en se basant sur l’outil de synthèse haut niveau HLS. Ph.D dissertation, University of Valenciennes and Hainaut-Cambresis (UVHC), France (2019)

    Google Scholar 

  3. Nikolajevic, K.: Dynamic autonomous decision-support function for piloting a helicopter in emergency situations. Ph.D dissertation, UVHC, France (2016)

    Google Scholar 

  4. Miao, M., Jianfeng, W., Sheng, W., Jianfeng, M.: Publicly verifiable database scheme with efficient keyword search. Int. J. Inf. Sci. 475 (2019)

    Google Scholar 

  5. Aronovich, L., Ron, A., Eitan, B., Haim, B., Michael, H., Shmuel, T.K.: Systems and methods for efficient data searching, storage and reduction, U.S (2019)

    Google Scholar 

  6. Usmani, A.R.: A novel time and space complexity efficient variant of counting-sort algorithm. In: An International Conference on Innovative Computing (ICIC), Lahore, Pakistan (2019)

    Google Scholar 

  7. Boyan, L.: A Data Sorting Hardware Accelerator on FPGA. KTH, School of Electrical Engineering and Computer Science (EECS) (2020)

    Google Scholar 

  8. Dominik, Z., Marcin, P., Maciej, W., Kazimierz, W.: The comparison of parallel sorting algorithms implemented on different hardware platforms. Comput. Sci. 14 (2013)

    Google Scholar 

  9. Chhugani, J., Macy, W., Baransi, A., Nguyen, A.D., Hagog, M., Kumar, S., Dubey, P.: Efficient implementation of sorting on multi-core SIMD CPU architecture. Proc. VLDB Endow. (2008)

    Google Scholar 

  10. Patti, R.S.: Three-dimensional integrated circuits and the future of system-on-chip designs. Proc. IEEE 94 (2006)

    Google Scholar 

  11. Jmaa, Y.B., Atitallah, R.B., Duvivier, D., Jemaa, M.B.: A comparative study of sorting algorithms with FPGA acceleration by high level synthesis. Computación y Sistemas 23(1), 213–230 (2019)

    Google Scholar 

  12. Diallo, A., Zopf, M., Johannes, F.: Permutation Learning via Lehmer Codes. In: 24th European Conference on Artificial Intelligence (ECAI ). Santiago de Compostela, Spain (2020)

    Google Scholar 

  13. Jmaa, Y.B., Ali, K.M., Duvivier, D., Jemaa, M.B., Atitallah, R.B.: An efficient hardware implementation of timsort and mergesort algorithms using high level synthesis. In: International Conference on High Performance Computing and Simulation (HPCS), Genoa, Italy, pp. 580–587. IEEE (2017)

    Google Scholar 

  14. Magis, A.T., Price, N.D.: The top-scoring ‘N’ algorithm: a generalized relative expression classification method from small numbers of biomolecules. BMC Bioinf. 13 (2012)

    Google Scholar 

  15. Mehdi, M.: Parallel hybrid optimization methods for permutation based problems. Ph.D. dissertation, Lille University of Science and Technology, France (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yomna Ben Jmaa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ben Jmaa, Y., Duvivier, D., Abid, M. (2021). Sorting Algorithms on ARM Cortex A9 Processor. In: Barolli, L., Woungang, I., Enokido, T. (eds) Advanced Information Networking and Applications. AINA 2021. Lecture Notes in Networks and Systems, vol 227. Springer, Cham. https://doi.org/10.1007/978-3-030-75078-7_36

Download citation

Publish with us

Policies and ethics