Parallel intersection counting on shared-memory multiprocessors and GPUs
Computing intersections among sets of one-dimensional intervals is an ubiquitous problem in computational geometry with important applications in bioinformatics, where the size of typical inputs is large and it is therefore important to use efficient algorithms. In this paper we propose a parallel a...
Uloženo v:
| Vydáno v: | Future generation computer systems Ročník 159; s. 423 - 431 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.10.2024
|
| Témata: | |
| ISSN: | 0167-739X, 1872-7115 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Computing intersections among sets of one-dimensional intervals is an ubiquitous problem in computational geometry with important applications in bioinformatics, where the size of typical inputs is large and it is therefore important to use efficient algorithms. In this paper we propose a parallel algorithm for the 1D intersection-counting problem, that is, the problem of counting the number of intersections between each interval in a given set A and every interval in a set B. Our algorithm is suitable for shared-memory architectures (e.g., multicore CPUs) and GPUs. The algorithm is work-efficient because it performs the same amount of work as the best serial algorithm for this kind of problem. Our algorithm has been implemented in C++ using the Thrust parallel algorithms library, enabling the generation of optimized programs for multicore CPUs and GPUs from the same source code. The performance of our algorithm is evaluated on synthetic and real datasets, showing good scalability on different generations of hardware.
•Computing intersections among sets of one-dimensional intervals is required in many applications.•We describe a parallel algorithm for counting intersections among sets of one-dimensional intervals.•Our algorithm is suitable for multicore CPUs and GPUs.•Performance evaluation with real and synthetic datasets shows very good scalability. |
|---|---|
| AbstractList | Computing intersections among sets of one-dimensional intervals is an ubiquitous problem in computational geometry with important applications in bioinformatics, where the size of typical inputs is large and it is therefore important to use efficient algorithms. In this paper we propose a parallel algorithm for the 1D intersection-counting problem, that is, the problem of counting the number of intersections between each interval in a given set A and every interval in a set B. Our algorithm is suitable for shared-memory architectures (e.g., multicore CPUs) and GPUs. The algorithm is work-efficient because it performs the same amount of work as the best serial algorithm for this kind of problem. Our algorithm has been implemented in C++ using the Thrust parallel algorithms library, enabling the generation of optimized programs for multicore CPUs and GPUs from the same source code. The performance of our algorithm is evaluated on synthetic and real datasets, showing good scalability on different generations of hardware.
•Computing intersections among sets of one-dimensional intervals is required in many applications.•We describe a parallel algorithm for counting intersections among sets of one-dimensional intervals.•Our algorithm is suitable for multicore CPUs and GPUs.•Performance evaluation with real and synthetic datasets shows very good scalability. |
| Author | Birolo, Giovanni Fariselli, Piero Marzolla, Moreno D’Angelo, Gabriele |
| Author_xml | – sequence: 1 givenname: Moreno orcidid: 0000-0002-2151-5287 surname: Marzolla fullname: Marzolla, Moreno email: moreno.marzolla@unibo.it organization: Dipartimento di Informatica–Scienza e Ingegneria (DISI), Università di Bologna, Mura Anteo Zamboni, 7, Bologna, I-40126, Italy – sequence: 2 givenname: Giovanni orcidid: 0000-0003-0160-9312 surname: Birolo fullname: Birolo, Giovanni email: giovanni.birolo@unito.it organization: Dipartimento di Scienze Mediche, Università di Torino, Corso Dogliotti, 14, Torino, I-10124, Italy – sequence: 3 givenname: Gabriele orcidid: 0000-0002-3690-6651 surname: D’Angelo fullname: D’Angelo, Gabriele email: g.dangelo@unibo.it organization: Dipartimento di Informatica–Scienza e Ingegneria (DISI), Università di Bologna, Mura Anteo Zamboni, 7, Bologna, I-40126, Italy – sequence: 4 givenname: Piero orcidid: 0000-0003-1811-4762 surname: Fariselli fullname: Fariselli, Piero email: piero.fariselli@unito.it organization: Dipartimento di Scienze Mediche, Università di Torino, Corso Dogliotti, 14, Torino, I-10124, Italy |
| BookMark | eNp9kMFqwzAQREVJoU7aP-jBP2BXa9mWfSmU0CaFQHNIoTchS-tWxpaCZBfy93VIzzntHHaGmbckC-ssEvIINAUK5VOXttM4eUwzmuUpLVLK6hsSQcWzhAMUCxLNbzzhrP66I8sQOkopcAYR2e6ll32PfWzsiD6gGo2zsXKTHY39jmcdfqRHnQw4OH-Kh6kfzdE7hSE4H2JpdbzZf4Z7ctvKPuDD_12Rw9vrYb1Ndh-b9_XLLlGMwpg0FVZ5w0GzHCTIQmkqFbJMlqhaVmtZsibL6yoHpkuUrdaUyRqakrOyLhRbkfwSq7wLwWMrjt4M0p8EUHGGITpxgSHOMAQtxAxjtj1fbDhX-zXoRVAGrUJt_DxZaGeuB_wBvMZuLw |
| Cites_doi | 10.1093/bioinformatics/btaa827 10.1109/99.660313 10.1145/182.358434 10.1137/0217049 10.1007/BF01933636 10.1038/s41598-019-41451-3 10.1038/nature15393 10.1093/bioinformatics/bts652 10.1145/1498765.1498785 10.1109/12.42122 10.1093/bioinformatics/bts277 10.1145/3369759 10.1016/0167-8191(92)90114-M |
| ContentType | Journal Article |
| Copyright | 2024 The Author(s) |
| Copyright_xml | – notice: 2024 The Author(s) |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.future.2024.05.039 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-7115 |
| EndPage | 431 |
| ExternalDocumentID | 10_1016_j_future_2024_05_039 S0167739X24002723 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 29H 4.4 457 4G. 5GY 5VS 6I. 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABJNI ABMAC ABXDB ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W KOM LG9 M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SES SEW SPC SPCBC SSV SSZ T5K UHS WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ADNMO AEIPS AFJKZ AGQPQ AIIUN ANKPU APXCP CITATION EFKBS EFLBG ~HD |
| ID | FETCH-LOGICAL-c301t-b8e84b71d341a1a5cd0ace32a6ecf39da63b2498413d6eafdd03a91b673695c3 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001247948400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-739X |
| IngestDate | Sat Nov 29 03:48:13 EST 2025 Tue Jun 18 08:50:31 EDT 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | GPU programming Intersection counting Shared-memory algorithm Parallel algorithms Bioinformatics |
| Language | English |
| License | This is an open access article under the CC BY-NC-ND license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c301t-b8e84b71d341a1a5cd0ace32a6ecf39da63b2498413d6eafdd03a91b673695c3 |
| ORCID | 0000-0003-0160-9312 0000-0002-3690-6651 0000-0003-1811-4762 0000-0002-2151-5287 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.future.2024.05.039 |
| PageCount | 9 |
| ParticipantIDs | crossref_primary_10_1016_j_future_2024_05_039 elsevier_sciencedirect_doi_10_1016_j_future_2024_05_039 |
| PublicationCentury | 2000 |
| PublicationDate | October 2024 2024-10-00 |
| PublicationDateYYYYMMDD | 2024-10-01 |
| PublicationDate_xml | – month: 10 year: 2024 text: October 2024 |
| PublicationDecade | 2020 |
| PublicationTitle | Future generation computer systems |
| PublicationYear | 2024 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Blelloch (b12) 1989; 38 Tsigas, Zhang (b15) 2003 (b23) 2015 Dagum, Menon (b18) 1998; 5 The 1000 Genomes Project Consortium (b24) 2015; 526 Mao, Eran, Luo (b10) 2019; 9 Wheat, Evans (b14) 1992; 18 Layer, Skadron, Robins, Hall, Quinlan (b3) 2013; 29 Li, Rong (b8) 2020; 37 Marzolla, D’Angelo (b2) 2020; 30 Cole (b13) 1988; 17 Amdahl (b21) 1967 Bell, Hoberock (b17) 2012 (b19) 2022 Marr, Binns, Hill, Hinton, Koufaty, Miller, Upton (b20) 2002; 6 Six, Wood (b5) 1980; 20 Shamos, Hoey (b6) 1976 Neph, Kuehn, Reynolds, Haugen, Thurman, Johnson, Rynes, Maurano, Vierstra, Thomas, Sandstrom, Humbert, Stamatoyannopoulos (b7) 2012; 28 Williams, Waterman, Patterson (b22) 2009; 52 Allen (b11) 1983; 26 Otlu, Can (b9) 2019; 20 (b1) 2018 Allen (b4) 1983; 26 Wyllie (b16) 1979 Williams (10.1016/j.future.2024.05.039_b22) 2009; 52 Marzolla (10.1016/j.future.2024.05.039_b2) 2020; 30 Wheat (10.1016/j.future.2024.05.039_b14) 1992; 18 Bell (10.1016/j.future.2024.05.039_b17) 2012 Allen (10.1016/j.future.2024.05.039_b11) 1983; 26 Wyllie (10.1016/j.future.2024.05.039_b16) 1979 Dagum (10.1016/j.future.2024.05.039_b18) 1998; 5 (10.1016/j.future.2024.05.039_b23) 2015 Shamos (10.1016/j.future.2024.05.039_b6) 1976 Layer (10.1016/j.future.2024.05.039_b3) 2013; 29 Neph (10.1016/j.future.2024.05.039_b7) 2012; 28 Otlu (10.1016/j.future.2024.05.039_b9) 2019; 20 Six (10.1016/j.future.2024.05.039_b5) 1980; 20 Li (10.1016/j.future.2024.05.039_b8) 2020; 37 Blelloch (10.1016/j.future.2024.05.039_b12) 1989; 38 Tsigas (10.1016/j.future.2024.05.039_b15) 2003 Amdahl (10.1016/j.future.2024.05.039_b21) 1967 Cole (10.1016/j.future.2024.05.039_b13) 1988; 17 (10.1016/j.future.2024.05.039_b19) 2022 (10.1016/j.future.2024.05.039_b1) 2018 Marr (10.1016/j.future.2024.05.039_b20) 2002; 6 Allen (10.1016/j.future.2024.05.039_b4) 1983; 26 Mao (10.1016/j.future.2024.05.039_b10) 2019; 9 The 1000 Genomes Project Consortium (10.1016/j.future.2024.05.039_b24) 2015; 526 |
| References_xml | – volume: 28 start-page: 1919 year: 2012 end-page: 1920 ident: b7 article-title: BEDOPS: high-performance genomic feature operations publication-title: Bioinformatics – volume: 26 start-page: 832 year: 1983 end-page: 843 ident: b4 article-title: Maintaining knowledge about temporal intervals publication-title: Commun. ACM – volume: 18 start-page: 91 year: 1992 end-page: 102 ident: b14 article-title: An efficient parallel sorting algorithm for shared memory multiprocessors publication-title: Parallel Comput. – volume: 5 start-page: 46 year: 1998 end-page: 55 ident: b18 article-title: OpenMP: An industry-standard API for shared-memory programming publication-title: IEEE Comput. Sci. Eng. – start-page: 208 year: 1976 end-page: 215 ident: b6 article-title: Geometric intersection problems publication-title: 17th Annual Symposium on Foundations of Computer Science – start-page: 359 year: 2012 end-page: 371 ident: b17 article-title: Chapter 26 - Thrust: A productivity-oriented library for CUDA publication-title: GPU Computing Gems Jade Edition – year: 2018 ident: b1 publication-title: Handbook of Discrete and Computational Geometry – volume: 26 start-page: 832 year: 1983 end-page: 843 ident: b11 article-title: Maintaining knowledge about temporal intervals publication-title: Commun. ACM – volume: 38 start-page: 1526 year: 1989 end-page: 1538 ident: b12 article-title: Scans as primitive parallel operations publication-title: IEEE Trans. Comput. – year: 2022 ident: b19 article-title: NVidia CUDA home page – start-page: 372 year: 2003 ident: b15 article-title: A simple, fast parallel implementation of quicksort and its performance evaluation on SUN enterprise 10000 publication-title: 11th Euromicro Workshop on Parallel, Distributed and Network-Based Processing (PDP 2003), 5-7 February 2003, Genova, Italy – year: 1979 ident: b16 article-title: The Complexity of Parallel Computations – year: 2015 ident: b23 article-title: Programming languages – technical specification for C++ extensions for parallelism – volume: 30 year: 2020 ident: b2 article-title: Parallel data distribution management on shared-memory multiprocessors publication-title: ACM Trans. Model. Comput. Simul. – volume: 29 start-page: 1 year: 2013 end-page: 7 ident: b3 article-title: Binary Interval Search: a scalable algorithm for counting interval intersections publication-title: Bioinformatics – volume: 9 year: 2019 ident: b10 article-title: Efficient genomic interval queries using augmented range trees publication-title: Sci. Rep. – volume: 17 start-page: 770 year: 1988 end-page: 785 ident: b13 article-title: Parallel merge sort publication-title: SIAM J. Comput. – volume: 6 year: 2002 ident: b20 article-title: Hyper-threading technology architecture and microarchitecture publication-title: Intel Technol. J. – start-page: 483 year: 1967 end-page: 485 ident: b21 article-title: Validity of the single processor approach to achieving large scale computing capabilities publication-title: Proceedings of the April 18-20, 1967, Spring Joint Computer Conference – volume: 526 start-page: 68 year: 2015 end-page: 74 ident: b24 article-title: A global reference for human genetic variation publication-title: Nature – volume: 37 start-page: 1315 year: 2020 end-page: 1316 ident: b8 article-title: Bedtk: finding interval overlap with implicit interval tree publication-title: Bioinformatics – volume: 20 year: 2019 ident: b9 article-title: JOA: Joint overlap analysis of multiple genomic interval sets publication-title: BMC Bioinformatics – volume: 20 start-page: 426 year: 1980 end-page: 433 ident: b5 article-title: The rectangle intersection problem revisited publication-title: BIT – volume: 52 start-page: 65 year: 2009 end-page: 76 ident: b22 article-title: Roofline: an insightful visual performance model for multicore architectures publication-title: Commun. ACM – start-page: 359 year: 2012 ident: 10.1016/j.future.2024.05.039_b17 article-title: Chapter 26 - Thrust: A productivity-oriented library for CUDA – volume: 37 start-page: 1315 issue: 9 year: 2020 ident: 10.1016/j.future.2024.05.039_b8 article-title: Bedtk: finding interval overlap with implicit interval tree publication-title: Bioinformatics doi: 10.1093/bioinformatics/btaa827 – volume: 20 issue: 121 year: 2019 ident: 10.1016/j.future.2024.05.039_b9 article-title: JOA: Joint overlap analysis of multiple genomic interval sets publication-title: BMC Bioinformatics – start-page: 483 year: 1967 ident: 10.1016/j.future.2024.05.039_b21 article-title: Validity of the single processor approach to achieving large scale computing capabilities – year: 2022 ident: 10.1016/j.future.2024.05.039_b19 – volume: 5 start-page: 46 year: 1998 ident: 10.1016/j.future.2024.05.039_b18 article-title: OpenMP: An industry-standard API for shared-memory programming publication-title: IEEE Comput. Sci. Eng. doi: 10.1109/99.660313 – volume: 26 start-page: 832 issue: 11 year: 1983 ident: 10.1016/j.future.2024.05.039_b4 article-title: Maintaining knowledge about temporal intervals publication-title: Commun. ACM doi: 10.1145/182.358434 – volume: 17 start-page: 770 issue: 4 year: 1988 ident: 10.1016/j.future.2024.05.039_b13 article-title: Parallel merge sort publication-title: SIAM J. Comput. doi: 10.1137/0217049 – year: 1979 ident: 10.1016/j.future.2024.05.039_b16 – volume: 6 issue: 1 year: 2002 ident: 10.1016/j.future.2024.05.039_b20 article-title: Hyper-threading technology architecture and microarchitecture publication-title: Intel Technol. J. – start-page: 208 year: 1976 ident: 10.1016/j.future.2024.05.039_b6 article-title: Geometric intersection problems – volume: 20 start-page: 426 year: 1980 ident: 10.1016/j.future.2024.05.039_b5 article-title: The rectangle intersection problem revisited publication-title: BIT doi: 10.1007/BF01933636 – volume: 9 year: 2019 ident: 10.1016/j.future.2024.05.039_b10 article-title: Efficient genomic interval queries using augmented range trees publication-title: Sci. Rep. doi: 10.1038/s41598-019-41451-3 – volume: 526 start-page: 68 issue: 7571 year: 2015 ident: 10.1016/j.future.2024.05.039_b24 article-title: A global reference for human genetic variation publication-title: Nature doi: 10.1038/nature15393 – volume: 29 start-page: 1 year: 2013 ident: 10.1016/j.future.2024.05.039_b3 article-title: Binary Interval Search: a scalable algorithm for counting interval intersections publication-title: Bioinformatics doi: 10.1093/bioinformatics/bts652 – volume: 52 start-page: 65 issue: 4 year: 2009 ident: 10.1016/j.future.2024.05.039_b22 article-title: Roofline: an insightful visual performance model for multicore architectures publication-title: Commun. ACM doi: 10.1145/1498765.1498785 – year: 2015 ident: 10.1016/j.future.2024.05.039_b23 – year: 2018 ident: 10.1016/j.future.2024.05.039_b1 – volume: 38 start-page: 1526 issue: 11 year: 1989 ident: 10.1016/j.future.2024.05.039_b12 article-title: Scans as primitive parallel operations publication-title: IEEE Trans. Comput. doi: 10.1109/12.42122 – volume: 26 start-page: 832 issue: 11 year: 1983 ident: 10.1016/j.future.2024.05.039_b11 article-title: Maintaining knowledge about temporal intervals publication-title: Commun. ACM doi: 10.1145/182.358434 – start-page: 372 year: 2003 ident: 10.1016/j.future.2024.05.039_b15 article-title: A simple, fast parallel implementation of quicksort and its performance evaluation on SUN enterprise 10000 – volume: 28 start-page: 1919 issue: 14 year: 2012 ident: 10.1016/j.future.2024.05.039_b7 article-title: BEDOPS: high-performance genomic feature operations publication-title: Bioinformatics doi: 10.1093/bioinformatics/bts277 – volume: 30 issue: 1 year: 2020 ident: 10.1016/j.future.2024.05.039_b2 article-title: Parallel data distribution management on shared-memory multiprocessors publication-title: ACM Trans. Model. Comput. Simul. doi: 10.1145/3369759 – volume: 18 start-page: 91 issue: 1 year: 1992 ident: 10.1016/j.future.2024.05.039_b14 article-title: An efficient parallel sorting algorithm for shared memory multiprocessors publication-title: Parallel Comput. doi: 10.1016/0167-8191(92)90114-M |
| SSID | ssj0001731 |
| Score | 2.4112973 |
| Snippet | Computing intersections among sets of one-dimensional intervals is an ubiquitous problem in computational geometry with important applications in... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 423 |
| SubjectTerms | Bioinformatics GPU programming Intersection counting Parallel algorithms Shared-memory algorithm |
| Title | Parallel intersection counting on shared-memory multiprocessors and GPUs |
| URI | https://dx.doi.org/10.1016/j.future.2024.05.039 |
| Volume | 159 |
| WOSCitedRecordID | wos001247948400001&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7115 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001731 issn: 0167-739X databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3da9swEBdZuoe9rPtkXbuih7262JYdSY-h9JOuBJaNvBlZkllLZxcnK13_lP61vbMkN2vG6AZ7McLEibj7-e6ny30Q8rHMK3BypY1K8A8RgMLAKxVnkcyktWpkBe_aNX094aenYjaTk8HgNtTCXF3wuhbX1_Lyv6oa7oGysXT2L9TdfyncgDUoHa6gdrg-SvET1eJ8lIuuE0Q7t24WeD8TAtbzb5h1Hn3HJNufPqXQ1Qvg5B2MpB9MvsyXaet-13kExy1bjxjtp0H4VtA9M_-k2huEVhdobVpbN_dh-LZx__McYAJsXZ_1JDpkXMgxpti6z6iyxdr3Hl84LBGbh3a0F3x5sxyvAACEzDcfRFsppHFxTbDXnHVTdcEtOVssOJD_xFV79sba9w935jZztcrec2fOn6w4BRefON9xXVp2cFNdt1bXRelBu-3PuBXcCSbXpjxlT8haynMphmRtfLQ3O-79fML9tEu_9VCY2WUPrv7W74nPEpmZviDP_SmEjh16XpKBrV-R9TDhg3qD_5ocBjDRZTDRACYK61_ARB-AiQKYKILpDZnu7013DyM_eyPSYPIXUSmsyEqeGGA5KlG5NrHSlqXw-uqKSaNGrISTuwAOZEZWVcbETMmkxDRBmWv2lgzrprbvCBUikyYWVsHZOFNxLpTRlWFMAbVMK6k3SBTkUly6DitFSD08L5wcC5RjEecFyHGD8CC8wrNEx_4K0Pcfn3z_z09ukmf3UN4iw0X7w34gT_XV4mzebntg3AGkSJGv |
| linkProvider | Elsevier |
| 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=Parallel+intersection+counting+on+shared-memory+multiprocessors+and+GPUs&rft.jtitle=Future+generation+computer+systems&rft.au=Marzolla%2C+Moreno&rft.au=Birolo%2C+Giovanni&rft.au=D%E2%80%99Angelo%2C+Gabriele&rft.au=Fariselli%2C+Piero&rft.date=2024-10-01&rft.pub=Elsevier+B.V&rft.issn=0167-739X&rft.eissn=1872-7115&rft.volume=159&rft.spage=423&rft.epage=431&rft_id=info:doi/10.1016%2Fj.future.2024.05.039&rft.externalDocID=S0167739X24002723 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-739X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-739X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-739X&client=summon |