A Parallel Implementation of FastBit Radix Sort Using MPI and CUDA

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The sorting operation arranges the data in an easily reproducible format, making it easy to search and store the data. With the search operation being highly optimized on sorted data, it is no surprise that sorting has become a very important computing operation. Many sorting algorithms have been developed over the years and the main aim is to reduce the time and space complexities for sorting in the worst- and average-case scenarios. Radix sort is one of the non-comparative-based sorting algorithms that performs the sorting operation in linear time. This paper proposes a parallel approach on a variation of Radix Sort namely, FastBit Radix Sort. 9 × speedup is achieved through the parallel algorithm proposed.

Original languageEnglish
Title of host publicationElectronic Systems and Intelligent Computing - Proceedings of ESIC 2021
EditorsPradeep Kumar Mallick, Akash Kumar Bhoi, Akash Kumar Bhoi, Alfonso González-Briones, Prasant Kumar Pattnaik
PublisherSpringer Science and Business Media Deutschland GmbH
Pages1-13
Number of pages13
ISBN (Print)9789811694875
DOIs
Publication statusPublished - 2022
Event2nd International Conference on Electronic Systems and Intelligent Computing, ESIC 2021 - Bhubaneswar, India
Duration: 05-11-202106-11-2021

Publication series

NameLecture Notes in Electrical Engineering
Volume860
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

Conference2nd International Conference on Electronic Systems and Intelligent Computing, ESIC 2021
Country/TerritoryIndia
CityBhubaneswar
Period05-11-2106-11-21

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'A Parallel Implementation of FastBit Radix Sort Using MPI and CUDA'. Together they form a unique fingerprint.

Cite this