A sample implementation for parallelizing Divide-and-Conquer algorithms on the GPU
The strategy of Divide-and-Conquer (D&C) is one of the frequently used programming patterns to design efficient algorithms in computer science, which has been parallelized on shared memory systems and distributed memory systems. Tzeng and Owens specifically developed a generic paradigm for paral...
Gespeichert in:
| Veröffentlicht in: | Heliyon Jg. 4; H. 1; S. e00512 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
England
Elsevier Ltd
01.01.2018
Elsevier |
| Schlagworte: | |
| ISSN: | 2405-8440, 2405-8440 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The strategy of Divide-and-Conquer (D&C) is one of the frequently used programming patterns to design efficient algorithms in computer science, which has been parallelized on shared memory systems and distributed memory systems. Tzeng and Owens specifically developed a generic paradigm for parallelizing D&C algorithms on modern Graphics Processing Units (GPUs). In this paper, by following the generic paradigm proposed by Tzeng and Owens, we provide a new and publicly available GPU implementation of the famous D&C algorithm, QuickHull, to give a sample and guide for parallelizing D&C algorithms on the GPU. The experimental results demonstrate the practicality of our sample GPU implementation. Our research objective in this paper is to present a sample GPU implementation of a classical D&C algorithm to help interested readers to develop their own efficient GPU implementations with fewer efforts. |
|---|---|
| AbstractList | The strategy of Divide-and-Conquer (D&C) is one of the frequently used programming patterns to design efficient algorithms in computer science, which has been parallelized on shared memory systems and distributed memory systems. Tzeng and Owens specifically developed a generic paradigm for parallelizing D&C algorithms on modern Graphics Processing Units (GPUs). In this paper, by following the generic paradigm proposed by Tzeng and Owens, we provide a new and publicly available GPU implementation of the famous D&C algorithm, QuickHull, to give a sample and guide for parallelizing D&C algorithms on the GPU. The experimental results demonstrate the practicality of our sample GPU implementation. Our research objective in this paper is to present a sample GPU implementation of a classical D&C algorithm to help interested readers to develop their own efficient GPU implementations with fewer efforts. The strategy of Divide-and-Conquer (D&C) is one of the frequently used programming patterns to design efficient algorithms in computer science, which has been parallelized on shared memory systems and distributed memory systems. Tzeng and Owens specifically developed a generic paradigm for parallelizing D&C algorithms on modern Graphics Processing Units (GPUs). In this paper, by following the generic paradigm proposed by Tzeng and Owens, we provide a new and publicly available GPU implementation of the famous D&C algorithm, QuickHull, to give a sample and guide for parallelizing D&C algorithms on the GPU. The experimental results demonstrate the practicality of our sample GPU implementation. Our research objective in this paper is to present a sample GPU implementation of a classical D&C algorithm to help interested readers to develop their own efficient GPU implementations with fewer efforts.The strategy of Divide-and-Conquer (D&C) is one of the frequently used programming patterns to design efficient algorithms in computer science, which has been parallelized on shared memory systems and distributed memory systems. Tzeng and Owens specifically developed a generic paradigm for parallelizing D&C algorithms on modern Graphics Processing Units (GPUs). In this paper, by following the generic paradigm proposed by Tzeng and Owens, we provide a new and publicly available GPU implementation of the famous D&C algorithm, QuickHull, to give a sample and guide for parallelizing D&C algorithms on the GPU. The experimental results demonstrate the practicality of our sample GPU implementation. Our research objective in this paper is to present a sample GPU implementation of a classical D&C algorithm to help interested readers to develop their own efficient GPU implementations with fewer efforts. |
| ArticleNumber | e00512 |
| Author | Zhao, Kunyang Xu, Nengxiong Mei, Gang Zhang, Jiayin |
| AuthorAffiliation | b Institute of Earth and Environmental Science, University of Freiburg, Albertstr. 23B 79104, Freiburg im Breisgau, Germany a School of Engineering and Technology, China University of Geosciences, Beijing 100083, China |
| AuthorAffiliation_xml | – name: b Institute of Earth and Environmental Science, University of Freiburg, Albertstr. 23B 79104, Freiburg im Breisgau, Germany – name: a School of Engineering and Technology, China University of Geosciences, Beijing 100083, China |
| Author_xml | – sequence: 1 givenname: Gang surname: Mei fullname: Mei, Gang email: gang.mei@cugb.edu.cn organization: School of Engineering and Technology, China University of Geosciences, Beijing 100083, China – sequence: 2 givenname: Jiayin surname: Zhang fullname: Zhang, Jiayin organization: School of Engineering and Technology, China University of Geosciences, Beijing 100083, China – sequence: 3 givenname: Nengxiong surname: Xu fullname: Xu, Nengxiong organization: School of Engineering and Technology, China University of Geosciences, Beijing 100083, China – sequence: 4 givenname: Kunyang surname: Zhao fullname: Zhao, Kunyang organization: School of Engineering and Technology, China University of Geosciences, Beijing 100083, China |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/29560430$$D View this record in MEDLINE/PubMed |
| BookMark | eNqFksFu1DAQhiNUREvpI4By5JLF49iOIyRQtUCpVAmE6NlynMmuV4692NmVytPjJVvUcunFtuz5v_k9My-LEx88FsVrIAsgIN5tFmt09i74BSUgF0gIB_qsOKOM8EoyRk4enE-Li5Q2hBDgUrRN_aI4pS0XhNXkrPhxWSY9bh2W9rCO6Cc92eDLIcRyq6N2Lmf6bf2q_GT3tsdK-75aBv9rh7HUbhWindZjKrNkWmN59f32VfF80C7hxXE_L26_fP65_FrdfLu6Xl7eVIYLMVWsZ6IXrO4otBoa2UFNYdCtBAmcYgs6mxdNQ6ATVA6IPTMdazskHbAeuvq8uJ65fdAbtY121PFOBW3V34sQV0rHyRqHStcDEtoYHEAw2aPmAsHIllCGRgBk1oeZtd11I_YmlyF__RH08Yu3a7UKe8UlbzjUGfD2CIghlyZNarTJoHPaY9glRTlllApO-dOhucO8lrQ-UN88tPXPz33_csD7OcDEkFLEQRk7NzC7tE4BUYeBURt1HJgDXap5YLKa_6e-T_CU7uOsw9zevcWokrHoDfY2oply_e0ThD-6Yt1L |
| CitedBy_id | crossref_primary_10_1007_s10851_023_01155_w crossref_primary_10_1016_j_future_2019_12_038 crossref_primary_10_1109_TAP_2020_3026489 crossref_primary_10_1016_j_jocs_2021_101298 |
| Cites_doi | 10.2298/CSIS120712021M 10.1080/15481603.2014.946666 10.1016/0020-0190(87)90086-X 10.1016/0167-6423(95)00022-4 10.1109/TVCG.2012.301 10.1016/j.parco.2011.10.007 10.1023/B:SUPE.0000026848.34971.27 10.1109/L-CA.2013.1 10.1016/j.cag.2012.02.012 10.1109/JPROC.2008.917757 10.1145/235815.235821 10.1109/TC.1983.1676280 10.1137/100806783 10.1016/j.cag.2012.03.015 10.1016/0020-0190(79)90072-3 10.1145/329366.301111 10.1111/j.1467-8659.2007.01012.x 10.1137/0218035 10.1007/s11071-012-0503-2 10.1177/1094342003017001007 |
| ContentType | Journal Article |
| Copyright | 2018 The Authors 2018 The Authors 2018 |
| Copyright_xml | – notice: 2018 The Authors – notice: 2018 The Authors 2018 |
| DBID | 6I. AAFTH AAYXX CITATION NPM 7X8 7S9 L.6 5PM DOA |
| DOI | 10.1016/j.heliyon.2018.e00512 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef PubMed MEDLINE - Academic AGRICOLA AGRICOLA - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed MEDLINE - Academic AGRICOLA AGRICOLA - Academic |
| DatabaseTitleList | PubMed MEDLINE - Academic AGRICOLA |
| Database_xml | – sequence: 1 dbid: DOA name: Directory of Open Access Journals (DOAJ) url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Medicine Computer Science |
| EISSN | 2405-8440 |
| ExternalDocumentID | oai_doaj_org_article_a3fe027cef1648dea56e1c89024ec611 PMC5857513 29560430 10_1016_j_heliyon_2018_e00512 S2405844016326032 |
| Genre | Journal Article |
| GroupedDBID | 0R~ 0SF 457 53G 5VS 6I. AACTN AAEDW AAFTH AAFWJ ABMAC ACGFS ACLIJ ADBBV ADEZE AEXQZ AFPKN AFTJW AGHFR AITUG ALMA_UNASSIGNED_HOLDINGS AMRAJ AOIJS BAWUL BCNDV DIK EBS EJD FDB GROUPED_DOAJ HYE IPNFZ KQ8 M~E NCXOZ O9- OK1 RIG ROL RPM SSZ AALRI AAYWO AAYXX ACVFH ADCNI ADVLN AEUPX AFJKZ AFPUW AIGII AKBMS AKRWK AKYEP APXCP CITATION NPM 7X8 7S9 L.6 5PM |
| ID | FETCH-LOGICAL-c566t-4d46d643b219a178b1321fa9818152e91a84467701b628feed4cb49be0b14d1b3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000432030800012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2405-8440 |
| IngestDate | Fri Oct 03 12:46:02 EDT 2025 Thu Aug 21 14:10:39 EDT 2025 Fri Jul 11 14:09:25 EDT 2025 Thu Oct 02 10:46:33 EDT 2025 Mon Jul 21 06:04:39 EDT 2025 Tue Nov 18 22:38:09 EST 2025 Sat Nov 29 01:44:14 EST 2025 Tue Jul 25 20:51:25 EDT 2023 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Computer science |
| Language | English |
| License | This is an open access article under the CC BY-NC-ND license. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/). |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c566t-4d46d643b219a178b1321fa9818152e91a84467701b628feed4cb49be0b14d1b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | https://doaj.org/article/a3fe027cef1648dea56e1c89024ec611 |
| PMID | 29560430 |
| PQID | 2016538233 |
| PQPubID | 23479 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_a3fe027cef1648dea56e1c89024ec611 pubmedcentral_primary_oai_pubmedcentral_nih_gov_5857513 proquest_miscellaneous_2524226525 proquest_miscellaneous_2016538233 pubmed_primary_29560430 crossref_citationtrail_10_1016_j_heliyon_2018_e00512 crossref_primary_10_1016_j_heliyon_2018_e00512 elsevier_sciencedirect_doi_10_1016_j_heliyon_2018_e00512 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-01-01 |
| PublicationDateYYYYMMDD | 2018-01-01 |
| PublicationDate_xml | – month: 01 year: 2018 text: 2018-01-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | England |
| PublicationPlace_xml | – name: England |
| PublicationTitle | Heliyon |
| PublicationTitleAlternate | Heliyon |
| PublicationYear | 2018 |
| Publisher | Elsevier Ltd Elsevier |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier |
| References | Stein, Geva, El-Sana (br0230) 2012; 36 Blelloch (br0330) 1990 Melkman (br0360) 1987; 25 Barber, Dobkin, Huhdanpaa (br0290) 1996; 22 Tzeng, Owens (br0280) Wu, Kung (br0030) 1991 Achatz, Schulte (br0040) 1996; 26 Sengupta, Harris, Zhang, Owens (br0190) 2007 Wang, Guo, Wei (br0090) 2004; 29 Owens, Luebke, Govindaraju, Harris, Krueger, Lefohn, Purcell (br0150) 2007; 26 Bell, Hoberock (br0310) 2012 CUDPP (br0300) 2014 Chen (br0200) 2012 Satish, Harris, Garland (br0180) 2009 Horowitz, Zorat (br0010) 1983; C-32 Czarnul (br0140) 2003; 17 Tzeng, Owens (br0320) Wu, Rui, Su, Cheng, Wang (br0220) 2014; 51 Chou, Liu, Chung, Gaudiot (br0080) 2014; 13 Rugina, Rinard (br0120) 1999; 34 CUDPP (br0370) 2014 Hijma, van Nieuwpoort, Jacobs, Bal (br0070) 2012; 38 Barber, Dobkin, Huhdanpaa (br0340) 1996; 22 Tang, Zhao, Tong, Manocha (br0240) 2012; 36 Andrew (br0350) 1979; 9 Rezaei, Monwar (br0110) 2006 Laflin, Anderson, Khan, Poursina (br0270) 2014; 9 Dorta, Leon, Rodriguez, Rojas (br0100) 2003 Srungarapu, Reddy, Kothapalli, Narayanan (br0390) 2011 Mateos, Zunino, Hirsch (br0060) 2013; 10 Srikanth, Kothapalli, Govindarajulu, Narayanan (br0380) 2009 Atallah, Cole, Goodrich (br0020) 1989; 18 Vomel, Tomov, Dongarra (br0170) 2012; 34 van Nieuwpoort, Kielmann, Bal (br0130) 2000; vol. 1900 Sreenivas, AlSabti, Ranka (br0050) 1999 Owens, Houston, Luebke, Green, Stone, Phillips (br0160) 2008; 96 M.C. Gao, T.T. Cao, A. Nanjappa, T.S. Tan, Z.Y. Huang, gHull: a GPU algorithm for 3D convex hull. Zhang, Huang, Liu, Bao (br0210) 2013; 19 Malczyk, Fraczek (br0260) 2012; 70 Wang (10.1016/j.heliyon.2018.e00512_br0090) 2004; 29 Blelloch (10.1016/j.heliyon.2018.e00512_br0330) 1990 Srungarapu (10.1016/j.heliyon.2018.e00512_br0390) 2011 Chen (10.1016/j.heliyon.2018.e00512_br0200) 2012 Sengupta (10.1016/j.heliyon.2018.e00512_br0190) 2007 Achatz (10.1016/j.heliyon.2018.e00512_br0040) 1996; 26 Zhang (10.1016/j.heliyon.2018.e00512_br0210) 2013; 19 Chou (10.1016/j.heliyon.2018.e00512_br0080) 2014; 13 Owens (10.1016/j.heliyon.2018.e00512_br0160) 2008; 96 Dorta (10.1016/j.heliyon.2018.e00512_br0100) 2003 Barber (10.1016/j.heliyon.2018.e00512_br0290) 1996; 22 Andrew (10.1016/j.heliyon.2018.e00512_br0350) 1979; 9 Srikanth (10.1016/j.heliyon.2018.e00512_br0380) 2009 Tzeng (10.1016/j.heliyon.2018.e00512_br0280) van Nieuwpoort (10.1016/j.heliyon.2018.e00512_br0130) 2000; vol. 1900 Owens (10.1016/j.heliyon.2018.e00512_br0150) 2007; 26 Sreenivas (10.1016/j.heliyon.2018.e00512_br0050) 1999 Czarnul (10.1016/j.heliyon.2018.e00512_br0140) 2003; 17 Horowitz (10.1016/j.heliyon.2018.e00512_br0010) 1983; C-32 Stein (10.1016/j.heliyon.2018.e00512_br0230) 2012; 36 Rezaei (10.1016/j.heliyon.2018.e00512_br0110) 2006 Hijma (10.1016/j.heliyon.2018.e00512_br0070) 2012; 38 Bell (10.1016/j.heliyon.2018.e00512_br0310) 2012 Tang (10.1016/j.heliyon.2018.e00512_br0240) 2012; 36 Wu (10.1016/j.heliyon.2018.e00512_br0220) 2014; 51 10.1016/j.heliyon.2018.e00512_br0250 Melkman (10.1016/j.heliyon.2018.e00512_br0360) 1987; 25 Malczyk (10.1016/j.heliyon.2018.e00512_br0260) 2012; 70 Atallah (10.1016/j.heliyon.2018.e00512_br0020) 1989; 18 Rugina (10.1016/j.heliyon.2018.e00512_br0120) 1999; 34 Satish (10.1016/j.heliyon.2018.e00512_br0180) 2009 Vomel (10.1016/j.heliyon.2018.e00512_br0170) 2012; 34 Wu (10.1016/j.heliyon.2018.e00512_br0030) 1991 CUDPP (10.1016/j.heliyon.2018.e00512_br0300) Tzeng (10.1016/j.heliyon.2018.e00512_br0320) Laflin (10.1016/j.heliyon.2018.e00512_br0270) 2014; 9 Barber (10.1016/j.heliyon.2018.e00512_br0340) 1996; 22 Mateos (10.1016/j.heliyon.2018.e00512_br0060) 2013; 10 CUDPP (10.1016/j.heliyon.2018.e00512_br0370) |
| References_xml | – volume: 38 start-page: 75 year: 2012 end-page: 89 ident: br0070 article-title: Generating synchronization statements in divide-and-conquer programs publication-title: Parallel Comput. – volume: 13 start-page: 13 year: 2014 end-page: 16 ident: br0080 article-title: An energy and performance efficient DVFS scheme for irregular parallel divide-and-conquer algorithms on the intel SCC publication-title: IEEE Comput. Archit. Lett. – start-page: 175 year: 2012 end-page: 177 ident: br0200 article-title: A divide-and-conquer algorithm of Delaunay triangulation with GPGPU publication-title: International Symposium on Parallel Architectures Algorithms and Programming – volume: 34 start-page: 72 year: 1999 end-page: 83 ident: br0120 article-title: Automatic parallelization of divide and conquer algorithms publication-title: ACM SIGPLAN Not. – year: 1990 ident: br0330 article-title: Vector Models for Data-Parallel Computing – start-page: 7 year: 2011 end-page: 12 ident: br0390 article-title: Fast two dimensional convex hull on the GPU publication-title: Advanced Information Networking and Applications (WAINA), 2011 IEEE Workshops of International Conference on – volume: 26 start-page: 59 year: 1996 end-page: 78 ident: br0040 article-title: Massive parallelization of divide-and-conquer algorithms over powerlists publication-title: Sci. Comput. Program. – volume: 19 start-page: 941 year: 2013 end-page: 952 ident: br0210 article-title: A divide-and-conquer approach to quad remeshing publication-title: IEEE Trans. Vis. Comput. Graph. – volume: vol. 1900 start-page: 690 year: 2000 end-page: 699 ident: br0130 article-title: Satin: efficient parallel divide-and-conquer in Java publication-title: Lecture Notes in Computer Science – ident: br0320 article-title: A paradigm for divide and conquer algorithms on the GPU and its application to the quickhull algorithm – volume: 9 start-page: 216 year: 1979 end-page: 219 ident: br0350 article-title: Another efficient algorithm for convex hulls in two dimensions publication-title: Inf. Process. Lett. – volume: 25 start-page: 11 year: 1987 end-page: 12 ident: br0360 article-title: On-line construction of the convex hull of a simple polyline publication-title: Inf. Process. Lett. – start-page: 1 year: 2009 end-page: 5 ident: br0380 article-title: Parallelizing two dimensional convex hull on NVIDIA GPU and Cell BE publication-title: International conference on high performance computing (HiPC) – volume: 22 start-page: 469 year: 1996 end-page: 483 ident: br0290 article-title: The quickhull algorithm for convex hulls publication-title: ACM Trans. Math. Softw. – volume: 26 start-page: 80 year: 2007 end-page: 113 ident: br0150 article-title: A survey of general-purpose computation on graphics hardware publication-title: Comput. Graph. Forum – year: 2003 ident: br0100 article-title: Parallel skeletons for Divide-and-Conquer and Branch-and-Bound techniques publication-title: Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, Proceedings – volume: 34 start-page: C70 year: 2012 end-page: C82 ident: br0170 article-title: Divide and conquer on hybrid GPU-accelerated multicore systems publication-title: SIAM J. Sci. Comput. – volume: 36 start-page: 498 year: 2012 end-page: 506 ident: br0240 article-title: GPU accelerated convex hull computation publication-title: Comput. Graph. – reference: M.C. Gao, T.T. Cao, A. Nanjappa, T.S. Tan, Z.Y. Huang, gHull: a GPU algorithm for 3D convex hull. – volume: 70 start-page: 871 year: 2012 end-page: 889 ident: br0260 article-title: A divide and conquer algorithm for constrained multibody system dynamics based on augmented Lagrangian method with projections-based error correction publication-title: Nonlinear Dyn. – volume: 96 start-page: 879 year: 2008 end-page: 899 ident: br0160 article-title: GPU computing publication-title: Proc. IEEE – start-page: 1 year: 2009 end-page: 10 ident: br0180 article-title: Designing efficient sorting algorithms for manycore GPUs publication-title: Parallel & Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium on – start-page: 97 year: 2007 end-page: 106 ident: br0190 article-title: Scan primitives for GPU computing publication-title: Graphics Hardware – volume: 10 start-page: 1129 year: 2013 end-page: 1163 ident: br0060 article-title: EasyFJP: providing hybrid parallelism as a concern for divide and conquer java applications publication-title: Comput. Sci. Inf. Syst. – year: 2014 ident: br0370 article-title: Code for computing the convex hull, Delaunay triangulation, Voronoi diagram, and halfspace intersection – year: 2006 ident: br0110 article-title: Divide-and-conquer algorithm for ClustalW-MPI publication-title: 2006 Canadian Conference on Electrical and Computer Engineering, vols. 1–5 – year: 2014 ident: br0300 article-title: Cuda data parallel primitives library – start-page: 359 year: 2012 end-page: 371 ident: br0310 article-title: Chapter 26 – Thrust: a productivity-oriented library for CUDA publication-title: GPU Computing Gems Jade Edition – start-page: 555 year: 1999 end-page: 562 ident: br0050 article-title: Parallel out-of-core divide-and-conquer techniques with application to classification trees publication-title: International Parallel Processing Symposium. Proceedings – ident: br0280 article-title: Finding convex hulls using quickhull on the GPU – volume: 9 start-page: 8 year: 2014 ident: br0270 article-title: Advances in the application of the divide-and-conquer algorithm to multibody system dynamics publication-title: J. Comput. Nonlinear Dyn. – year: 1991 ident: br0030 article-title: Communication complexity for parallel Divide-and-Conquer publication-title: Proceedings – 32nd Annual Symposium on Foundations of Computer Science – volume: 22 start-page: 469 year: 1996 end-page: 483 ident: br0340 article-title: The quickhull algorithm for convex hulls publication-title: ACM Trans. Math. Softw. – volume: C-32 start-page: 582 year: 1983 end-page: 585 ident: br0010 article-title: Divide-and-conquer for parallel processing publication-title: IEEE Trans. Comput. – volume: 51 start-page: 537 year: 2014 end-page: 554 ident: br0220 article-title: Novel parallel algorithm for constructing Delaunay triangulation based on a twofold-divide-and-conquer scheme publication-title: GISci. Remote Sens. – volume: 18 start-page: 499 year: 1989 end-page: 532 ident: br0020 article-title: Cascading divide-and-conquer: a technique for designing parallel algorithms publication-title: SIAM J. Comput. – volume: 29 start-page: 157 year: 2004 end-page: 170 ident: br0090 article-title: A divide-and-conquer algorithm for irregular redistribution in parallelizing compilers publication-title: J. Supercomput. – volume: 17 start-page: 77 year: 2003 end-page: 93 ident: br0140 article-title: Programming, tuning and automatic parallelization of irregular divide-and-conquer applications in DAMPVM/DAC publication-title: Int. J. High Perform. Comput. Appl. – volume: 36 start-page: 265 year: 2012 end-page: 271 ident: br0230 article-title: CudaHull: fast parallel 3D convex hull on the GPU publication-title: Comput. Graph. – year: 2003 ident: 10.1016/j.heliyon.2018.e00512_br0100 article-title: Parallel skeletons for Divide-and-Conquer and Branch-and-Bound techniques – volume: 10 start-page: 1129 issue: 3 year: 2013 ident: 10.1016/j.heliyon.2018.e00512_br0060 article-title: EasyFJP: providing hybrid parallelism as a concern for divide and conquer java applications publication-title: Comput. Sci. Inf. Syst. doi: 10.2298/CSIS120712021M – volume: 51 start-page: 537 issue: 5 year: 2014 ident: 10.1016/j.heliyon.2018.e00512_br0220 article-title: Novel parallel algorithm for constructing Delaunay triangulation based on a twofold-divide-and-conquer scheme publication-title: GISci. Remote Sens. doi: 10.1080/15481603.2014.946666 – volume: 25 start-page: 11 issue: 1 year: 1987 ident: 10.1016/j.heliyon.2018.e00512_br0360 article-title: On-line construction of the convex hull of a simple polyline publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(87)90086-X – volume: vol. 1900 start-page: 690 year: 2000 ident: 10.1016/j.heliyon.2018.e00512_br0130 article-title: Satin: efficient parallel divide-and-conquer in Java – volume: 26 start-page: 59 issue: 1–3 year: 1996 ident: 10.1016/j.heliyon.2018.e00512_br0040 article-title: Massive parallelization of divide-and-conquer algorithms over powerlists publication-title: Sci. Comput. Program. doi: 10.1016/0167-6423(95)00022-4 – volume: 19 start-page: 941 issue: 6 year: 2013 ident: 10.1016/j.heliyon.2018.e00512_br0210 article-title: A divide-and-conquer approach to quad remeshing publication-title: IEEE Trans. Vis. Comput. Graph. doi: 10.1109/TVCG.2012.301 – volume: 38 start-page: 75 issue: 1–2 year: 2012 ident: 10.1016/j.heliyon.2018.e00512_br0070 article-title: Generating synchronization statements in divide-and-conquer programs publication-title: Parallel Comput. doi: 10.1016/j.parco.2011.10.007 – start-page: 555 year: 1999 ident: 10.1016/j.heliyon.2018.e00512_br0050 article-title: Parallel out-of-core divide-and-conquer techniques with application to classification trees – volume: 29 start-page: 157 issue: 2 year: 2004 ident: 10.1016/j.heliyon.2018.e00512_br0090 article-title: A divide-and-conquer algorithm for irregular redistribution in parallelizing compilers publication-title: J. Supercomput. doi: 10.1023/B:SUPE.0000026848.34971.27 – volume: 13 start-page: 13 issue: 1 year: 2014 ident: 10.1016/j.heliyon.2018.e00512_br0080 article-title: An energy and performance efficient DVFS scheme for irregular parallel divide-and-conquer algorithms on the intel SCC publication-title: IEEE Comput. Archit. Lett. doi: 10.1109/L-CA.2013.1 – ident: 10.1016/j.heliyon.2018.e00512_br0250 – start-page: 175 year: 2012 ident: 10.1016/j.heliyon.2018.e00512_br0200 article-title: A divide-and-conquer algorithm of Delaunay triangulation with GPGPU – year: 2006 ident: 10.1016/j.heliyon.2018.e00512_br0110 article-title: Divide-and-conquer algorithm for ClustalW-MPI – year: 1991 ident: 10.1016/j.heliyon.2018.e00512_br0030 article-title: Communication complexity for parallel Divide-and-Conquer – volume: 36 start-page: 265 issue: 4 year: 2012 ident: 10.1016/j.heliyon.2018.e00512_br0230 article-title: CudaHull: fast parallel 3D convex hull on the GPU publication-title: Comput. Graph. doi: 10.1016/j.cag.2012.02.012 – volume: 96 start-page: 879 issue: 5 year: 2008 ident: 10.1016/j.heliyon.2018.e00512_br0160 article-title: GPU computing publication-title: Proc. IEEE doi: 10.1109/JPROC.2008.917757 – volume: 9 start-page: 8 issue: 4 year: 2014 ident: 10.1016/j.heliyon.2018.e00512_br0270 article-title: Advances in the application of the divide-and-conquer algorithm to multibody system dynamics publication-title: J. Comput. Nonlinear Dyn. – volume: 22 start-page: 469 issue: 4 year: 1996 ident: 10.1016/j.heliyon.2018.e00512_br0340 article-title: The quickhull algorithm for convex hulls publication-title: ACM Trans. Math. Softw. doi: 10.1145/235815.235821 – volume: C-32 start-page: 582 issue: 6 year: 1983 ident: 10.1016/j.heliyon.2018.e00512_br0010 article-title: Divide-and-conquer for parallel processing publication-title: IEEE Trans. Comput. doi: 10.1109/TC.1983.1676280 – year: 1990 ident: 10.1016/j.heliyon.2018.e00512_br0330 – start-page: 1 year: 2009 ident: 10.1016/j.heliyon.2018.e00512_br0380 article-title: Parallelizing two dimensional convex hull on NVIDIA GPU and Cell BE – start-page: 97 year: 2007 ident: 10.1016/j.heliyon.2018.e00512_br0190 article-title: Scan primitives for GPU computing – volume: 34 start-page: C70 issue: 2 year: 2012 ident: 10.1016/j.heliyon.2018.e00512_br0170 article-title: Divide and conquer on hybrid GPU-accelerated multicore systems publication-title: SIAM J. Sci. Comput. doi: 10.1137/100806783 – start-page: 1 year: 2009 ident: 10.1016/j.heliyon.2018.e00512_br0180 article-title: Designing efficient sorting algorithms for manycore GPUs – volume: 36 start-page: 498 issue: 5 year: 2012 ident: 10.1016/j.heliyon.2018.e00512_br0240 article-title: GPU accelerated convex hull computation publication-title: Comput. Graph. doi: 10.1016/j.cag.2012.03.015 – volume: 9 start-page: 216 issue: 5 year: 1979 ident: 10.1016/j.heliyon.2018.e00512_br0350 article-title: Another efficient algorithm for convex hulls in two dimensions publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(79)90072-3 – volume: 34 start-page: 72 issue: 8 year: 1999 ident: 10.1016/j.heliyon.2018.e00512_br0120 article-title: Automatic parallelization of divide and conquer algorithms publication-title: ACM SIGPLAN Not. doi: 10.1145/329366.301111 – ident: 10.1016/j.heliyon.2018.e00512_br0320 – volume: 22 start-page: 469 issue: 4 year: 1996 ident: 10.1016/j.heliyon.2018.e00512_br0290 article-title: The quickhull algorithm for convex hulls publication-title: ACM Trans. Math. Softw. doi: 10.1145/235815.235821 – volume: 26 start-page: 80 issue: 1 year: 2007 ident: 10.1016/j.heliyon.2018.e00512_br0150 article-title: A survey of general-purpose computation on graphics hardware publication-title: Comput. Graph. Forum doi: 10.1111/j.1467-8659.2007.01012.x – ident: 10.1016/j.heliyon.2018.e00512_br0280 – ident: 10.1016/j.heliyon.2018.e00512_br0370 – start-page: 7 year: 2011 ident: 10.1016/j.heliyon.2018.e00512_br0390 article-title: Fast two dimensional convex hull on the GPU – volume: 18 start-page: 499 issue: 3 year: 1989 ident: 10.1016/j.heliyon.2018.e00512_br0020 article-title: Cascading divide-and-conquer: a technique for designing parallel algorithms publication-title: SIAM J. Comput. doi: 10.1137/0218035 – volume: 70 start-page: 871 issue: 1 year: 2012 ident: 10.1016/j.heliyon.2018.e00512_br0260 article-title: A divide and conquer algorithm for constrained multibody system dynamics based on augmented Lagrangian method with projections-based error correction publication-title: Nonlinear Dyn. doi: 10.1007/s11071-012-0503-2 – start-page: 359 year: 2012 ident: 10.1016/j.heliyon.2018.e00512_br0310 article-title: Chapter 26 – Thrust: a productivity-oriented library for CUDA – volume: 17 start-page: 77 issue: 1 year: 2003 ident: 10.1016/j.heliyon.2018.e00512_br0140 article-title: Programming, tuning and automatic parallelization of irregular divide-and-conquer applications in DAMPVM/DAC publication-title: Int. J. High Perform. Comput. Appl. doi: 10.1177/1094342003017001007 – ident: 10.1016/j.heliyon.2018.e00512_br0300 |
| SSID | ssj0001586973 |
| Score | 2.0716069 |
| Snippet | The strategy of Divide-and-Conquer (D&C) is one of the frequently used programming patterns to design efficient algorithms in computer science, which has been... |
| SourceID | doaj pubmedcentral proquest pubmed crossref elsevier |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | e00512 |
| SubjectTerms | algorithms Computer science memory |
| Title | A sample implementation for parallelizing Divide-and-Conquer algorithms on the GPU |
| URI | https://dx.doi.org/10.1016/j.heliyon.2018.e00512 https://www.ncbi.nlm.nih.gov/pubmed/29560430 https://www.proquest.com/docview/2016538233 https://www.proquest.com/docview/2524226525 https://pubmed.ncbi.nlm.nih.gov/PMC5857513 https://doaj.org/article/a3fe027cef1648dea56e1c89024ec611 |
| Volume | 4 |
| WOSCitedRecordID | wos000432030800012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: Directory of Open Access Journals (DOAJ) customDbUrl: eissn: 2405-8440 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001586973 issn: 2405-8440 databaseCode: DOA dateStart: 20150101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2405-8440 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001586973 issn: 2405-8440 databaseCode: M~E dateStart: 20150101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELagQogLj_IKj8pIXL2NEye2j6W0cGlVISrtLbIdh02VJmh3iwQHfjszcbJsQGIvXPaQtbPxzHjnm4znG0LexhAjJ5WTTFhpmUi8YipNNat8pUvwOaXNTN9sQp6fq_lcX2y1-sIzYYEeOAju0KSVh9DJ-QqAvSq9yXLPHWbHhHd5qOqNpd4KpkJ9sMp1n14Gj5UxJUT8u3zn8Gq28E39vUP-U65mHi0zmTimnr9_4p_-xp9_HqPc8kunD8n9AVDSo7CQR-SWb_fJg7FZAx327j65ezZk0R-TT0d0ZZAVmNbX4_Fx1A8FAEuRC7xp4MF_gFOj77FayzPTluy4a-HJltQ0X7plvV5cryhMAfxIP1xcPiGXpyefjz-yobcCcwDg1kyUIi8BjVj4xzJcKgtRKa-MBv8NHt1rbkBmuZQxt3miKvCkwlmhrY8tFyW36VOy13atf04oSBpAjMht6r3QpbFIQqcqp12cWCN9RMQo2MINxOPY_6IpxhNmV8WgjwL1UQR9RGS2mfY1MG_smvAOtbYZjMTZ_QUwp2Iwp2KXOUVEjTovBgwSsAXcqt71-29GGylgj2LixbS-u1nhoDzDhGv6jzFZgkXNWZJF5Fmwq81KEgxiRRpHRE4sbrLU6Tdtvei5wjPswMrTF_9DNi_JPVxueAH1iuytlzf-Nbnjvq3r1fKA3JZzddBvQ_g8-3nyC_WdN3c |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+sample+implementation+for+parallelizing+Divide-and-Conquer+algorithms+on+the+GPU&rft.jtitle=Heliyon&rft.au=Mei%2C+Gang&rft.au=Zhang%2C+Jiayin&rft.au=Xu%2C+Nengxiong&rft.au=Zhao%2C+Kunyang&rft.date=2018-01-01&rft.issn=2405-8440&rft.eissn=2405-8440&rft.volume=4&rft.issue=1&rft.spage=e00512&rft_id=info:doi/10.1016%2Fj.heliyon.2018.e00512&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_heliyon_2018_e00512 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2405-8440&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2405-8440&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2405-8440&client=summon |