Super sort algorithm using mpi and cuda

Anaghashree, Sushmita Delcy Pereira, Rao B. Ashwath, Shwetha Rai, N. Gopalakrishna Kini

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

Abstract

Sorting algorithms have been a subject of research. Throughout the years various sorting algorithms have been implemented and their performance has been evaluated by comparing the space and time complexity. In this paper the super sort sorting algorithm with time complexity O(nlogn) has been implemented with MPI and CUDA. The intention is to compare the time taken by super sort algorithm when executed sequentially using C program and the time taken when implemented using CUDA and MPI.

Original languageEnglish
Title of host publicationIntelligent Data Engineering and Analytics - Frontiers in Intelligent Computing
Subtitle of host publicationTheory and Applications, FICTA 2020
EditorsSuresh Chandra Satapathy, Yu-Dong Zhang, Vikrant Bhateja, Vikrant Bhateja, Ritanjali Majhi
PublisherSpringer Science and Business Media Deutschland GmbH
Pages165-170
Number of pages6
ISBN (Print)9789811556784
DOIs
Publication statusPublished - 2021
Event8th International Conference on Frontiers of Intelligent Computing: Theory and Applications, FICTA 2020 - Mangalore, India
Duration: 04-01-202005-01-2020

Publication series

NameAdvances in Intelligent Systems and Computing
Volume1177
ISSN (Print)2194-5357
ISSN (Electronic)2194-5365

Conference

Conference8th International Conference on Frontiers of Intelligent Computing: Theory and Applications, FICTA 2020
CountryIndia
CityMangalore
Period04-01-2005-01-20

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Super sort algorithm using mpi and cuda'. Together they form a unique fingerprint.

Cite this