ISSN 2394-5125
 

Research Article 


PARALLELIZATION OF TIM SORT ALGORITHM USING MPI AND CUDA

Siva Thanagaraja, Keshav Shanbhag, Ashwath Rao B, Shwetha Rai, N Gopalakrishna Kini.

Abstract
Tim Sort is a sorting algorithm developed in 2002 by Tim Peters. It is one of the secure engineered
algorithms, and its high-level principle includes the sequence S is divided into monotonic runs (i.e., nonincreasing
or non-decreasing subsequence of S), which should be sorted and should be combined pairwise
according to some specific rules. To interpret and examine the merging strategy (meaning that the order in
which merge and merge runs are performed) of Tim Sort, we have implemented it in MPI and CUDA
environment. Finally, it can be seen the difference in the execution time between serial Tim Sort and parallel
Tim sort run in O (n log n) time .

Key words: Hybrid algorithm, Tim sort algorithm, Parallelization, Merge sort algorithm, Insertion sort algorithm


 
ARTICLE TOOLS
Abstract
PDF Fulltext
How to cite this articleHow to cite this article
Citation Tools
Related Records
 Articles by Siva Thanagaraja
Articles by Keshav Shanbhag
Articles by Ashwath Rao B
Articles by Shwetha Rai
Articles by N Gopalakrishna Kini
on Google
on Google Scholar


How to Cite this Article
Pubmed Style

Siva Thanagaraja, Keshav Shanbhag, Ashwath Rao B, Shwetha Rai, N Gopalakrishna Kini. PARALLELIZATION OF TIM SORT ALGORITHM USING MPI AND CUDA. JCR. 2020; 7(9): 2910-2915. doi:10.31838/jcr.07.09.454


Web Style

Siva Thanagaraja, Keshav Shanbhag, Ashwath Rao B, Shwetha Rai, N Gopalakrishna Kini. PARALLELIZATION OF TIM SORT ALGORITHM USING MPI AND CUDA. http://www.jcreview.com/?mno=130051 [Access: April 18, 2021]. doi:10.31838/jcr.07.09.454


AMA (American Medical Association) Style

Siva Thanagaraja, Keshav Shanbhag, Ashwath Rao B, Shwetha Rai, N Gopalakrishna Kini. PARALLELIZATION OF TIM SORT ALGORITHM USING MPI AND CUDA. JCR. 2020; 7(9): 2910-2915. doi:10.31838/jcr.07.09.454



Vancouver/ICMJE Style

Siva Thanagaraja, Keshav Shanbhag, Ashwath Rao B, Shwetha Rai, N Gopalakrishna Kini. PARALLELIZATION OF TIM SORT ALGORITHM USING MPI AND CUDA. JCR. (2020), [cited April 18, 2021]; 7(9): 2910-2915. doi:10.31838/jcr.07.09.454



Harvard Style

Siva Thanagaraja, Keshav Shanbhag, Ashwath Rao B, Shwetha Rai, N Gopalakrishna Kini (2020) PARALLELIZATION OF TIM SORT ALGORITHM USING MPI AND CUDA. JCR, 7 (9), 2910-2915. doi:10.31838/jcr.07.09.454



Turabian Style

Siva Thanagaraja, Keshav Shanbhag, Ashwath Rao B, Shwetha Rai, N Gopalakrishna Kini. 2020. PARALLELIZATION OF TIM SORT ALGORITHM USING MPI AND CUDA. Journal of Critical Reviews, 7 (9), 2910-2915. doi:10.31838/jcr.07.09.454



Chicago Style

Siva Thanagaraja, Keshav Shanbhag, Ashwath Rao B, Shwetha Rai, N Gopalakrishna Kini. "PARALLELIZATION OF TIM SORT ALGORITHM USING MPI AND CUDA." Journal of Critical Reviews 7 (2020), 2910-2915. doi:10.31838/jcr.07.09.454



MLA (The Modern Language Association) Style

Siva Thanagaraja, Keshav Shanbhag, Ashwath Rao B, Shwetha Rai, N Gopalakrishna Kini. "PARALLELIZATION OF TIM SORT ALGORITHM USING MPI AND CUDA." Journal of Critical Reviews 7.9 (2020), 2910-2915. Print. doi:10.31838/jcr.07.09.454



APA (American Psychological Association) Style

Siva Thanagaraja, Keshav Shanbhag, Ashwath Rao B, Shwetha Rai, N Gopalakrishna Kini (2020) PARALLELIZATION OF TIM SORT ALGORITHM USING MPI AND CUDA. Journal of Critical Reviews, 7 (9), 2910-2915. doi:10.31838/jcr.07.09.454