Survey of GPU Based Sorting Algorithms
Parallel sorting algorithms are widely studied nowadays. After the introduction of parallel processors such as graphics processing unit (GPU) and easy to use parallel programming languages such as CUDA and OpenCL, literature on parallel sorting algorithms has become vast and richer with new ideas an...
Gespeichert in:
| Veröffentlicht in: | International journal of parallel programming 2018-12, Vol.46 (6), p.1017-1034 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1034 |
|---|---|
| container_issue | 6 |
| container_start_page | 1017 |
| container_title | International journal of parallel programming |
| container_volume | 46 |
| creator | Singh, Dhirendra Pratap Joshi, Ishan Choudhary, Jaytrilok |
| description | Parallel sorting algorithms are widely studied nowadays. After the introduction of parallel processors such as graphics processing unit (GPU) and easy to use parallel programming languages such as CUDA and OpenCL, literature on parallel sorting algorithms has become vast and richer with new ideas and techniques applied to solve the famous problem of sorting. This paper presents a survey of GPU based sorting algorithms. Four sorting algorithms have been selected for this survey: Radix sort, Merge sort, Sample sort and Quick sort. Methods used in those algorithms are described in brief. The performance of these algorithms as claimed by their authors is also presented. A comparative analysis based on the literature is depicted. |
| doi_str_mv | 10.1007/s10766-017-0502-5 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2132193913</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2132193913</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-abee6f308a05f5451a2b51fa4732b021b936760443805d429aeb2677bda3961e3</originalsourceid><addsrcrecordid>eNp1kM1Kw0AURgdRMFYfwF1AcDd67_xnWYutQkGhdj1MmklMaZM6kwh9e1MiuHJ1N-d8Fw4htwgPCKAfI4JWigJqChIYlWckQak51UrAOUnAGEm1kOaSXMW4BYBMG5OQ-1Ufvv0xbct08b5On1z0RbpqQ1c3VTrdVW2ou899vCYXpdtFf_N7J2Q9f_6YvdDl2-J1Nl3SDUfVUZd7r0oOxoEspZDoWC6xdEJzlgPDPONKKxCCG5CFYJnzOVNa54XjmULPJ-Ru3D2E9qv3sbPbtg_N8NIy5AwzniEfKBypTWhjDL60h1DvXThaBHvKYcccdshhTzmsHBw2OnFgm8qHv-X_pR8UwV9c</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2132193913</pqid></control><display><type>article</type><title>Survey of GPU Based Sorting Algorithms</title><source>Springer Nature</source><creator>Singh, Dhirendra Pratap ; Joshi, Ishan ; Choudhary, Jaytrilok</creator><creatorcontrib>Singh, Dhirendra Pratap ; Joshi, Ishan ; Choudhary, Jaytrilok</creatorcontrib><description>Parallel sorting algorithms are widely studied nowadays. After the introduction of parallel processors such as graphics processing unit (GPU) and easy to use parallel programming languages such as CUDA and OpenCL, literature on parallel sorting algorithms has become vast and richer with new ideas and techniques applied to solve the famous problem of sorting. This paper presents a survey of GPU based sorting algorithms. Four sorting algorithms have been selected for this survey: Radix sort, Merge sort, Sample sort and Quick sort. Methods used in those algorithms are described in brief. The performance of these algorithms as claimed by their authors is also presented. A comparative analysis based on the literature is depicted.</description><identifier>ISSN: 0885-7458</identifier><identifier>EISSN: 1573-7640</identifier><identifier>DOI: 10.1007/s10766-017-0502-5</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Classification ; Comparative analysis ; Computer Science ; Graphics processing units ; Parallel programming ; Processor Architectures ; Programming languages ; Software Engineering/Programming and Operating Systems ; Sorting algorithms ; Theory of Computation</subject><ispartof>International journal of parallel programming, 2018-12, Vol.46 (6), p.1017-1034</ispartof><rights>Springer Science+Business Media New York 2017</rights><rights>International Journal of Parallel Programming is a copyright of Springer, (2017). All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c316t-abee6f308a05f5451a2b51fa4732b021b936760443805d429aeb2677bda3961e3</citedby><cites>FETCH-LOGICAL-c316t-abee6f308a05f5451a2b51fa4732b021b936760443805d429aeb2677bda3961e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10766-017-0502-5$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10766-017-0502-5$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27903,27904,41467,42536,51297</link.rule.ids></links><search><creatorcontrib>Singh, Dhirendra Pratap</creatorcontrib><creatorcontrib>Joshi, Ishan</creatorcontrib><creatorcontrib>Choudhary, Jaytrilok</creatorcontrib><title>Survey of GPU Based Sorting Algorithms</title><title>International journal of parallel programming</title><addtitle>Int J Parallel Prog</addtitle><description>Parallel sorting algorithms are widely studied nowadays. After the introduction of parallel processors such as graphics processing unit (GPU) and easy to use parallel programming languages such as CUDA and OpenCL, literature on parallel sorting algorithms has become vast and richer with new ideas and techniques applied to solve the famous problem of sorting. This paper presents a survey of GPU based sorting algorithms. Four sorting algorithms have been selected for this survey: Radix sort, Merge sort, Sample sort and Quick sort. Methods used in those algorithms are described in brief. The performance of these algorithms as claimed by their authors is also presented. A comparative analysis based on the literature is depicted.</description><subject>Algorithms</subject><subject>Classification</subject><subject>Comparative analysis</subject><subject>Computer Science</subject><subject>Graphics processing units</subject><subject>Parallel programming</subject><subject>Processor Architectures</subject><subject>Programming languages</subject><subject>Software Engineering/Programming and Operating Systems</subject><subject>Sorting algorithms</subject><subject>Theory of Computation</subject><issn>0885-7458</issn><issn>1573-7640</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNp1kM1Kw0AURgdRMFYfwF1AcDd67_xnWYutQkGhdj1MmklMaZM6kwh9e1MiuHJ1N-d8Fw4htwgPCKAfI4JWigJqChIYlWckQak51UrAOUnAGEm1kOaSXMW4BYBMG5OQ-1Ufvv0xbct08b5On1z0RbpqQ1c3VTrdVW2ou899vCYXpdtFf_N7J2Q9f_6YvdDl2-J1Nl3SDUfVUZd7r0oOxoEspZDoWC6xdEJzlgPDPONKKxCCG5CFYJnzOVNa54XjmULPJ-Ru3D2E9qv3sbPbtg_N8NIy5AwzniEfKBypTWhjDL60h1DvXThaBHvKYcccdshhTzmsHBw2OnFgm8qHv-X_pR8UwV9c</recordid><startdate>20181201</startdate><enddate>20181201</enddate><creator>Singh, Dhirendra Pratap</creator><creator>Joshi, Ishan</creator><creator>Choudhary, Jaytrilok</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20181201</creationdate><title>Survey of GPU Based Sorting Algorithms</title><author>Singh, Dhirendra Pratap ; Joshi, Ishan ; Choudhary, Jaytrilok</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-abee6f308a05f5451a2b51fa4732b021b936760443805d429aeb2677bda3961e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Classification</topic><topic>Comparative analysis</topic><topic>Computer Science</topic><topic>Graphics processing units</topic><topic>Parallel programming</topic><topic>Processor Architectures</topic><topic>Programming languages</topic><topic>Software Engineering/Programming and Operating Systems</topic><topic>Sorting algorithms</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Singh, Dhirendra Pratap</creatorcontrib><creatorcontrib>Joshi, Ishan</creatorcontrib><creatorcontrib>Choudhary, Jaytrilok</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Research Library</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>International journal of parallel programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Singh, Dhirendra Pratap</au><au>Joshi, Ishan</au><au>Choudhary, Jaytrilok</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Survey of GPU Based Sorting Algorithms</atitle><jtitle>International journal of parallel programming</jtitle><stitle>Int J Parallel Prog</stitle><date>2018-12-01</date><risdate>2018</risdate><volume>46</volume><issue>6</issue><spage>1017</spage><epage>1034</epage><pages>1017-1034</pages><issn>0885-7458</issn><eissn>1573-7640</eissn><abstract>Parallel sorting algorithms are widely studied nowadays. After the introduction of parallel processors such as graphics processing unit (GPU) and easy to use parallel programming languages such as CUDA and OpenCL, literature on parallel sorting algorithms has become vast and richer with new ideas and techniques applied to solve the famous problem of sorting. This paper presents a survey of GPU based sorting algorithms. Four sorting algorithms have been selected for this survey: Radix sort, Merge sort, Sample sort and Quick sort. Methods used in those algorithms are described in brief. The performance of these algorithms as claimed by their authors is also presented. A comparative analysis based on the literature is depicted.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10766-017-0502-5</doi><tpages>18</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0885-7458 |
| ispartof | International journal of parallel programming, 2018-12, Vol.46 (6), p.1017-1034 |
| issn | 0885-7458 1573-7640 |
| language | eng |
| recordid | cdi_proquest_journals_2132193913 |
| source | Springer Nature |
| subjects | Algorithms Classification Comparative analysis Computer Science Graphics processing units Parallel programming Processor Architectures Programming languages Software Engineering/Programming and Operating Systems Sorting algorithms Theory of Computation |
| title | Survey of GPU Based Sorting Algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T20%3A13%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Survey%20of%20GPU%20Based%20Sorting%20Algorithms&rft.jtitle=International%20journal%20of%20parallel%20programming&rft.au=Singh,%20Dhirendra%20Pratap&rft.date=2018-12-01&rft.volume=46&rft.issue=6&rft.spage=1017&rft.epage=1034&rft.pages=1017-1034&rft.issn=0885-7458&rft.eissn=1573-7640&rft_id=info:doi/10.1007/s10766-017-0502-5&rft_dat=%3Cproquest_cross%3E2132193913%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2132193913&rft_id=info:pmid/&rfr_iscdi=true |