3D parallel tiled code implementing a modified Knuth's optimal binary search tree algorithm
•3D tiled OBST code improves data locality.•Improved data locality of 3D tiled code allows us to increase code.•performance and scalability.•3D tiled OBST code considerably outperforms 2D tiled OBST code. This paper presents an approach to generation of 3D parallel tiled code implementing an optimal...
Saved in:
| Published in | Journal of computational science Vol. 48; p. 101246 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
01.01.2021
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1877-7503 1877-7511 |
| DOI | 10.1016/j.jocs.2020.101246 |
Cover
| Abstract | •3D tiled OBST code improves data locality.•Improved data locality of 3D tiled code allows us to increase code.•performance and scalability.•3D tiled OBST code considerably outperforms 2D tiled OBST code.
This paper presents an approach to generation of 3D parallel tiled code implementing an optimal binary search tree (OBST) algorithm. We demonstrate that the features of data dependences available in the code implementing Knuth's OBST algorithm allow us to generate only 2D tiled code. We suggest a way of transformation of Knuth's OBST algorithm to a modified one exposing dependences allowing us to generate 3D parallel tiled code. The polyhedral model and the corresponding tools supporting that model are used by us to generate 3D target tiled code on the basis of the modified Knuth's OBST algorithm. Program parallelism is based on the wavefront technique and it is presented in the OpenMP C/C++ standard. Experiments carried out by us with obtained 3D tiled code demonstrate that this code considerably outperforms 2D tiled code generated on the basis of serial code implementing classic Knuth's OBST algorithm. Increased code performance is achieved due to much larger locality of 3D tiled code in comparison with that of 2D one. |
|---|---|
| AbstractList | •3D tiled OBST code improves data locality.•Improved data locality of 3D tiled code allows us to increase code.•performance and scalability.•3D tiled OBST code considerably outperforms 2D tiled OBST code.
This paper presents an approach to generation of 3D parallel tiled code implementing an optimal binary search tree (OBST) algorithm. We demonstrate that the features of data dependences available in the code implementing Knuth's OBST algorithm allow us to generate only 2D tiled code. We suggest a way of transformation of Knuth's OBST algorithm to a modified one exposing dependences allowing us to generate 3D parallel tiled code. The polyhedral model and the corresponding tools supporting that model are used by us to generate 3D target tiled code on the basis of the modified Knuth's OBST algorithm. Program parallelism is based on the wavefront technique and it is presented in the OpenMP C/C++ standard. Experiments carried out by us with obtained 3D tiled code demonstrate that this code considerably outperforms 2D tiled code generated on the basis of serial code implementing classic Knuth's OBST algorithm. Increased code performance is achieved due to much larger locality of 3D tiled code in comparison with that of 2D one. |
| ArticleNumber | 101246 |
| Author | Poliwoda, Maciej Blaszynski, Piotr Bielecki, Wlodzimierz |
| Author_xml | – sequence: 1 givenname: Wlodzimierz surname: Bielecki fullname: Bielecki, Wlodzimierz email: wbielecki@zut.edu.pl – sequence: 2 givenname: Piotr orcidid: 0000-0001-8892-7705 surname: Blaszynski fullname: Blaszynski, Piotr email: pblaszynski@zut.edu.pl – sequence: 3 givenname: Maciej surname: Poliwoda fullname: Poliwoda, Maciej email: mpoliwoda@zut.edu.pl |
| BookMark | eNp9kDtPwzAQgC1UJErpH2DyxpRix86jEgsqT1GJBSYGy3YurSPHjmyD1H9PShEDQ2-5052-0913jibOO0DokpIFJbS87had13GRk_ynkfPyBE1pXVVZVVA6-asJO0PzGDsyBqvrJWVT9MHu8CCDtBYsTsZCg7VvAJt-sNCDS8ZtsMS9b0xrxuGL-0zbq4j9kEwvLVbGybDDEWTQW5wCAJZ244NJ2_4CnbbSRpj_5hl6f7h_Wz1l69fH59XtOtOMkJQVmjZKVTwnBVU850wT0pB2yWjNW07KWucVLWlBS8WZqoBXpC6WlCtFoSjris1Qftirg48xQCuGMB4XdoISsTckOrE3JPaGxMHQCNX_IG2STMa7FKSxx9GbAwrjU18GgojagNPQmAA6icabY_g3tceCWg |
| CitedBy_id | crossref_primary_10_1016_j_parco_2023_103016 crossref_primary_10_3390_electronics12173579 crossref_primary_10_3390_electronics13030488 crossref_primary_10_1080_17445760_2022_2102168 |
| Cites_doi | 10.1007/978-1-4615-4123-3_4 10.2991/emeit.2012.45 10.1016/0898-1221(95)00138-O 10.4018/ijghpc.2014040105 10.1109/JAS.2017.7510310 10.1145/305138.305197 10.1145/79173.79181 10.1145/1375581.1375595 10.1145/564870.564916 10.1007/s00453-001-0109-4 10.1007/BF00264289 10.1007/s11227-018-2678-x 10.1007/s11227-011-0601-9 10.1007/3-540-63165-8_195 10.1007/s41019-019-0093-9 10.1109/12.293256 10.1142/S0129626491000173 10.1007/3-540-48311-X_99 10.1007/978-3-540-39993-3_17 10.1016/j.jpdc.2019.12.007 |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier B.V. |
| Copyright_xml | – notice: 2020 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.jocs.2020.101246 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Sciences (General) Business |
| EISSN | 1877-7511 |
| ExternalDocumentID | 10_1016_j_jocs_2020_101246 S1877750320305445 |
| GroupedDBID | --K --M .~1 0R~ 1B1 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABFRF ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BKOJK BLXMC EBS EFJIC EFLBG EJD EP3 FDB FEDTE FIRID FNPLU FYGXN GBLVA GBOLZ HVGLF HZ~ J1W KOM M41 MO0 N9A O-L O9- OAUVE P-8 P-9 P2P PC. Q38 RIG ROL SDF SES SPC SPCBC SSV SSZ T5K UNMZH ~G- AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c300t-5c1dbb742051b4243c00d0f93184f4068c27161516b43b7e47085914bb1e56873 |
| IEDL.DBID | .~1 |
| ISSN | 1877-7503 |
| IngestDate | Wed Oct 01 04:25:08 EDT 2025 Thu Apr 24 23:07:29 EDT 2025 Fri Feb 23 02:48:44 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | 68P05 Optimal binary search tree Parallel computing Tiled code Polyhedral model 68N19 68M20 Dynamic programming Code locality 65Y05 68P10 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c300t-5c1dbb742051b4243c00d0f93184f4068c27161516b43b7e47085914bb1e56873 |
| ORCID | 0000-0001-8892-7705 |
| ParticipantIDs | crossref_primary_10_1016_j_jocs_2020_101246 crossref_citationtrail_10_1016_j_jocs_2020_101246 elsevier_sciencedirect_doi_10_1016_j_jocs_2020_101246 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | January 2021 2021-01-00 |
| PublicationDateYYYYMMDD | 2021-01-01 |
| PublicationDate_xml | – month: 01 year: 2021 text: January 2021 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of computational science |
| PublicationYear | 2021 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Tang, Gupta (bib0045) 1995; 30 Palkowski, Bielecki (bib0150) 2019 Palkowski, Bielecki (bib0155) 2020; 137 Cheatham, Fahmy, Stefanescu, Valiant (bib0115) 1996 Alves, Cáceres, Dehne (bib0090) 2002 Jacoby, King (bib0185) 2017 Tchendji, Myoupo (bib0065) 2012; 61 Kechid, Myoupo (bib0055) 2008 Higa, Stefanes (bib0050) 2012 Chang, Tsay (bib0170) 1994; 43 Vaucher (bib0075) 2004 Verdoolaege, Grosser (bib0020) 2012 Frigo, Leiserson, Prokop, Ramachandran (bib0130) 1999 Risset, Robert (bib0175) 1991; 1 Knuth (bib0005) 1971; 1 Tchendji, Zeutouo (bib0125) 2019; 4 Lim, Cheong, Lam (bib0035) 1999 Brodal, Fagerberg, Jacob (bib0145) 2002 Bielecki, Skotnicki (bib0160) 2019; 75 Rajopadhye, Tadonki, Risset (bib0165) 1999 Verdoolaege (bib0030) 2010 Han, Lu (bib0070) 2012 Karpinski, Larmore, Rytter (bib0085) 1996 Guibas, Kung, Thompson (bib0015) 1979 Barratt, Zhang (bib0135) 2019 Verdoolaege, Janssens (bib0040) 2017 Verdoolaege (bib0025) 2011 Eppstein, Galil, Giancarlo (bib0095) 1988 Bender, Demaine, Farach-Colton (bib0140) 2000 Valiant (bib0100) 1990; 33 Wang, Zhang, Wei, Zheng, Li (bib0080) 2017; 4 Dehne, Ferreira, Cáceres, Song, Roncato (bib0105) 2002; 33 Cáceres, Dehne, Ferreira, Flocchini, Rieping, Roncato, Santoro, Song (bib0110) 1997 Bondhugula, Hartono, Ramanujam, Sadayappan (bib0010) 2008 Mullapudi, Bondhugula (bib0180) 2014 Bradford (bib0120) 1995 Myoupo, Tchendji (bib0060) 2014; 6 Cheatham (10.1016/j.jocs.2020.101246_bib0115) 1996 Guibas (10.1016/j.jocs.2020.101246_bib0015) 1979 Higa (10.1016/j.jocs.2020.101246_bib0050) 2012 Frigo (10.1016/j.jocs.2020.101246_bib0130) 1999 Rajopadhye (10.1016/j.jocs.2020.101246_bib0165) 1999 Wang (10.1016/j.jocs.2020.101246_bib0080) 2017; 4 Bielecki (10.1016/j.jocs.2020.101246_bib0160) 2019; 75 Chang (10.1016/j.jocs.2020.101246_bib0170) 1994; 43 Tchendji (10.1016/j.jocs.2020.101246_bib0065) 2012; 61 Eppstein (10.1016/j.jocs.2020.101246_bib0095) 1988 Palkowski (10.1016/j.jocs.2020.101246_bib0150) 2019 Vaucher (10.1016/j.jocs.2020.101246_bib0075) 2004 Karpinski (10.1016/j.jocs.2020.101246_bib0085) 1996 Knuth (10.1016/j.jocs.2020.101246_bib0005) 1971; 1 Verdoolaege (10.1016/j.jocs.2020.101246_bib0030) 2010 Myoupo (10.1016/j.jocs.2020.101246_bib0060) 2014; 6 Bondhugula (10.1016/j.jocs.2020.101246_bib0010) 2008 Kechid (10.1016/j.jocs.2020.101246_bib0055) 2008 Valiant (10.1016/j.jocs.2020.101246_bib0100) 1990; 33 Verdoolaege (10.1016/j.jocs.2020.101246_bib0025) 2011 Barratt (10.1016/j.jocs.2020.101246_bib0135) 2019 Bender (10.1016/j.jocs.2020.101246_bib0140) 2000 Jacoby (10.1016/j.jocs.2020.101246_bib0185) 2017 Verdoolaege (10.1016/j.jocs.2020.101246_bib0020) 2012 Palkowski (10.1016/j.jocs.2020.101246_bib0155) 2020; 137 Lim (10.1016/j.jocs.2020.101246_bib0035) 1999 Verdoolaege (10.1016/j.jocs.2020.101246_bib0040) 2017 Alves (10.1016/j.jocs.2020.101246_bib0090) 2002 Tang (10.1016/j.jocs.2020.101246_bib0045) 1995; 30 Brodal (10.1016/j.jocs.2020.101246_bib0145) 2002 Cáceres (10.1016/j.jocs.2020.101246_bib0110) 1997 Dehne (10.1016/j.jocs.2020.101246_bib0105) 2002; 33 Mullapudi (10.1016/j.jocs.2020.101246_bib0180) 2014 Bradford (10.1016/j.jocs.2020.101246_bib0120) 1995 Risset (10.1016/j.jocs.2020.101246_bib0175) 1991; 1 Han (10.1016/j.jocs.2020.101246_bib0070) 2012 Tchendji (10.1016/j.jocs.2020.101246_bib0125) 2019; 4 |
| References_xml | – start-page: 61 year: 1996 end-page: 76 ident: bib0115 article-title: Bulk synchronous parallel computing-a paradigm for transportable software publication-title: Tools and Environments for Parallel and Distributed Systems – volume: 61 start-page: 463 year: 2012 end-page: 480 ident: bib0065 article-title: An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem publication-title: J. Supercomput. – volume: 33 start-page: 183 year: 2002 end-page: 200 ident: bib0105 article-title: Efficient parallel graph algorithms for coarse-grained multicomputers and bsp publication-title: Algorithmica – volume: 33 start-page: 103 year: 1990 end-page: 111 ident: bib0100 article-title: A bridging model for parallel computation publication-title: Commun. ACM – start-page: 285 year: 1999 end-page: 297 ident: bib0130 article-title: Cache-oblivious algorithms publication-title: 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039) – volume: 1 start-page: 19 year: 1991 end-page: 28 ident: bib0175 article-title: Synthesis of processor arrays for the algebraic path problem: unifying old results and deriving new architectures publication-title: Parallel Process. Lett. – volume: 75 start-page: 2665 year: 2019 end-page: 2690 ident: bib0160 article-title: Insight into tiles generated by means of a correction technique publication-title: J. Supercomput. – volume: 43 start-page: 769 year: 1994 end-page: 777 ident: bib0170 article-title: A family of efficient regular arrays for algebraic path problem publication-title: IEEE Trans. Comput. – start-page: 275 year: 2002 end-page: 281 ident: bib0090 article-title: Parallel dynamic programming for solving the string editing problem on a cgm/bsp publication-title: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures – volume: 4 start-page: 141 year: 2019 end-page: 156 ident: bib0125 article-title: An efficient cgm-based parallel algorithm for solving the optimal binary search tree problem through one-to-all shortest paths in a dynamic graph publication-title: Data Sci. Eng. – start-page: 376 year: 2004 end-page: 388 ident: bib0075 article-title: Building optimal binary search trees from sorted values in o (n) time publication-title: From Object-Orientation to Formal Methods – year: 2019 ident: bib0135 article-title: Cache-Friendly Search Trees; or, in Which Everything Beats std:: Set – start-page: 1 year: 2012 end-page: 16 ident: bib0020 article-title: Polyhedral extraction tool publication-title: Second International Workshop on Polyhedral Compilation Techniques (IMPACT’12) – volume: 30 start-page: 65 year: 1995 end-page: 74 ident: bib0045 article-title: An efficient parallel dynamic programming algorithm publication-title: Comput. Math. Appl. – start-page: 228 year: 1999 end-page: 237 ident: bib0035 article-title: An affine partitioning algorithm to maximize parallelism and minimize communication publication-title: Proceedings of the 13th International Conference on Supercomputing – year: 1995 ident: bib0120 article-title: Parallel Dynamic Programming, Ph.D. Thesis – start-page: 25 year: 2019 end-page: 34 ident: bib0150 article-title: Parallel tiled cache and energy efficient code for zuker's rna folding publication-title: International Conference on Parallel Processing and Applied Mathematics – year: 2014 ident: bib0180 article-title: Tiling for dynamic scheduling publication-title: Proceedings of the 4th International Workshop on Polyhedral Compilation Techniques – year: 2012 ident: bib0070 article-title: Research on optimization and parallelization of optimal binary search tree using dynamic programming publication-title: 2nd International Conference on Electronic & Mechanical Engineering and Information Technology – year: 2017 ident: bib0185 article-title: Comparing Implementations of Optimal Binary Search Trees – start-page: 36 year: 1996 end-page: 41 ident: bib0085 article-title: Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees publication-title: SODA – volume: 137 start-page: 252 year: 2020 end-page: 258 ident: bib0155 article-title: Parallel tiled cache and energy efficient codes for o (n4) rna folding algorithms publication-title: J. Parallel Distrib. Comput. – start-page: 509 year: 1979 end-page: 525 ident: bib0015 article-title: Direct vlsi implementation of combinatorial algorithms publication-title: Conference on Very Large Integration: Architecture, Design and Fabrication – start-page: 1 year: 2012 ident: bib0050 article-title: A coarse-grained parallel algorithm for the matrix chain order problem publication-title: Proceedings of the 2012 Symposium on High Performance Computing – year: 2011 ident: bib0025 article-title: Counting affine calculator and applications publication-title: First International Workshop on Polyhedral Compilation Techniques (IMPACT’11) – start-page: 399 year: 2000 end-page: 409 ident: bib0140 article-title: Cache-oblivious b-trees publication-title: Proceedings 41st Annual Symposium on Foundations of Computer Science – start-page: 390 year: 1997 end-page: 400 ident: bib0110 article-title: Efficient parallel graph algorithms for coarse grained multicomputers and bsp publication-title: International Colloquium on Automata, Languages, and Programming – start-page: 488 year: 1988 end-page: 496 ident: bib0095 article-title: Speeding up dynamic programming publication-title: FOCS – start-page: 299 year: 2010 end-page: 302 ident: bib0030 article-title: isl: an integer set library for the polyhedral model publication-title: International Congress on Mathematical Software – year: 2017 ident: bib0040 article-title: Scheduling for ppcg, CW Report – start-page: 1186 year: 2008 end-page: 1189 ident: bib0055 article-title: A coarse grain multicomputer algorithm solving the optimal binary search tree problem publication-title: Fifth International Conference on Information Technology: New Generations (itng 2008) – start-page: 698 year: 1999 end-page: 707 ident: bib0165 article-title: The algebraic path problem revisited publication-title: European Conference on Parallel Processing – start-page: 39 year: 2002 end-page: 48 ident: bib0145 article-title: Cache oblivious search trees via binary trees of small height publication-title: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms – volume: 6 start-page: 74 year: 2014 end-page: 100 ident: bib0060 article-title: An efficient cgm-based parallel algorithm solving the matrix chain ordering problem publication-title: Int. J. Grid High Perform. Comput. (IJGHPC) – volume: 1 start-page: 14 year: 1971 end-page: 25 ident: bib0005 article-title: Optimum binary search trees publication-title: Acta Inform. – start-page: 101 year: 2008 end-page: 113 ident: bib0010 article-title: A practical automatic polyhedral parallelizer and locality optimizer publication-title: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation – volume: 4 start-page: 1 year: 2017 end-page: 5 ident: bib0080 article-title: Pdp: parallel dynamic programming publication-title: IEEE/CAA J. Autom. Sin. – start-page: 61 year: 1996 ident: 10.1016/j.jocs.2020.101246_bib0115 article-title: Bulk synchronous parallel computing-a paradigm for transportable software publication-title: Tools and Environments for Parallel and Distributed Systems doi: 10.1007/978-1-4615-4123-3_4 – start-page: 39 year: 2002 ident: 10.1016/j.jocs.2020.101246_bib0145 article-title: Cache oblivious search trees via binary trees of small height publication-title: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms – year: 2012 ident: 10.1016/j.jocs.2020.101246_bib0070 article-title: Research on optimization and parallelization of optimal binary search tree using dynamic programming publication-title: 2nd International Conference on Electronic & Mechanical Engineering and Information Technology doi: 10.2991/emeit.2012.45 – volume: 30 start-page: 65 issue: 8 year: 1995 ident: 10.1016/j.jocs.2020.101246_bib0045 article-title: An efficient parallel dynamic programming algorithm publication-title: Comput. Math. Appl. doi: 10.1016/0898-1221(95)00138-O – volume: 6 start-page: 74 issue: 2 year: 2014 ident: 10.1016/j.jocs.2020.101246_bib0060 article-title: An efficient cgm-based parallel algorithm solving the matrix chain ordering problem publication-title: Int. J. Grid High Perform. Comput. (IJGHPC) doi: 10.4018/ijghpc.2014040105 – volume: 4 start-page: 1 issue: 1 year: 2017 ident: 10.1016/j.jocs.2020.101246_bib0080 article-title: Pdp: parallel dynamic programming publication-title: IEEE/CAA J. Autom. Sin. doi: 10.1109/JAS.2017.7510310 – start-page: 228 year: 1999 ident: 10.1016/j.jocs.2020.101246_bib0035 article-title: An affine partitioning algorithm to maximize parallelism and minimize communication publication-title: Proceedings of the 13th International Conference on Supercomputing doi: 10.1145/305138.305197 – volume: 33 start-page: 103 issue: 8 year: 1990 ident: 10.1016/j.jocs.2020.101246_bib0100 article-title: A bridging model for parallel computation publication-title: Commun. ACM doi: 10.1145/79173.79181 – start-page: 488 year: 1988 ident: 10.1016/j.jocs.2020.101246_bib0095 article-title: Speeding up dynamic programming publication-title: FOCS – year: 2011 ident: 10.1016/j.jocs.2020.101246_bib0025 article-title: Counting affine calculator and applications – start-page: 399 year: 2000 ident: 10.1016/j.jocs.2020.101246_bib0140 article-title: Cache-oblivious b-trees – start-page: 101 year: 2008 ident: 10.1016/j.jocs.2020.101246_bib0010 article-title: A practical automatic polyhedral parallelizer and locality optimizer publication-title: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation doi: 10.1145/1375581.1375595 – start-page: 509 year: 1979 ident: 10.1016/j.jocs.2020.101246_bib0015 article-title: Direct vlsi implementation of combinatorial algorithms publication-title: Conference on Very Large Integration: Architecture, Design and Fabrication – year: 2017 ident: 10.1016/j.jocs.2020.101246_bib0185 – start-page: 275 year: 2002 ident: 10.1016/j.jocs.2020.101246_bib0090 article-title: Parallel dynamic programming for solving the string editing problem on a cgm/bsp publication-title: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures doi: 10.1145/564870.564916 – year: 2019 ident: 10.1016/j.jocs.2020.101246_bib0135 – year: 2017 ident: 10.1016/j.jocs.2020.101246_bib0040 – volume: 33 start-page: 183 issue: 2 year: 2002 ident: 10.1016/j.jocs.2020.101246_bib0105 article-title: Efficient parallel graph algorithms for coarse-grained multicomputers and bsp publication-title: Algorithmica doi: 10.1007/s00453-001-0109-4 – volume: 1 start-page: 14 issue: 1 year: 1971 ident: 10.1016/j.jocs.2020.101246_bib0005 article-title: Optimum binary search trees publication-title: Acta Inform. doi: 10.1007/BF00264289 – start-page: 1 year: 2012 ident: 10.1016/j.jocs.2020.101246_bib0020 article-title: Polyhedral extraction tool – year: 1995 ident: 10.1016/j.jocs.2020.101246_bib0120 – start-page: 1 year: 2012 ident: 10.1016/j.jocs.2020.101246_bib0050 article-title: A coarse-grained parallel algorithm for the matrix chain order problem publication-title: Proceedings of the 2012 Symposium on High Performance Computing – start-page: 36 year: 1996 ident: 10.1016/j.jocs.2020.101246_bib0085 article-title: Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees publication-title: SODA – volume: 75 start-page: 2665 issue: 5 year: 2019 ident: 10.1016/j.jocs.2020.101246_bib0160 article-title: Insight into tiles generated by means of a correction technique publication-title: J. Supercomput. doi: 10.1007/s11227-018-2678-x – volume: 61 start-page: 463 issue: 3 year: 2012 ident: 10.1016/j.jocs.2020.101246_bib0065 article-title: An efficient coarse-grain multicomputer algorithm for the minimum cost parenthesizing problem publication-title: J. Supercomput. doi: 10.1007/s11227-011-0601-9 – start-page: 390 year: 1997 ident: 10.1016/j.jocs.2020.101246_bib0110 article-title: Efficient parallel graph algorithms for coarse grained multicomputers and bsp publication-title: International Colloquium on Automata, Languages, and Programming doi: 10.1007/3-540-63165-8_195 – year: 2014 ident: 10.1016/j.jocs.2020.101246_bib0180 article-title: Tiling for dynamic scheduling – start-page: 285 year: 1999 ident: 10.1016/j.jocs.2020.101246_bib0130 article-title: Cache-oblivious algorithms – volume: 4 start-page: 141 issue: 2 year: 2019 ident: 10.1016/j.jocs.2020.101246_bib0125 article-title: An efficient cgm-based parallel algorithm for solving the optimal binary search tree problem through one-to-all shortest paths in a dynamic graph publication-title: Data Sci. Eng. doi: 10.1007/s41019-019-0093-9 – start-page: 1186 year: 2008 ident: 10.1016/j.jocs.2020.101246_bib0055 article-title: A coarse grain multicomputer algorithm solving the optimal binary search tree problem – volume: 43 start-page: 769 issue: 7 year: 1994 ident: 10.1016/j.jocs.2020.101246_bib0170 article-title: A family of efficient regular arrays for algebraic path problem publication-title: IEEE Trans. Comput. doi: 10.1109/12.293256 – start-page: 299 year: 2010 ident: 10.1016/j.jocs.2020.101246_bib0030 article-title: isl: an integer set library for the polyhedral model publication-title: International Congress on Mathematical Software – volume: 1 start-page: 19 issue: 01 year: 1991 ident: 10.1016/j.jocs.2020.101246_bib0175 article-title: Synthesis of processor arrays for the algebraic path problem: unifying old results and deriving new architectures publication-title: Parallel Process. Lett. doi: 10.1142/S0129626491000173 – start-page: 25 year: 2019 ident: 10.1016/j.jocs.2020.101246_bib0150 article-title: Parallel tiled cache and energy efficient code for zuker's rna folding publication-title: International Conference on Parallel Processing and Applied Mathematics – start-page: 698 year: 1999 ident: 10.1016/j.jocs.2020.101246_bib0165 article-title: The algebraic path problem revisited publication-title: European Conference on Parallel Processing doi: 10.1007/3-540-48311-X_99 – start-page: 376 year: 2004 ident: 10.1016/j.jocs.2020.101246_bib0075 article-title: Building optimal binary search trees from sorted values in o (n) time publication-title: From Object-Orientation to Formal Methods doi: 10.1007/978-3-540-39993-3_17 – volume: 137 start-page: 252 year: 2020 ident: 10.1016/j.jocs.2020.101246_bib0155 article-title: Parallel tiled cache and energy efficient codes for o (n4) rna folding algorithms publication-title: J. Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2019.12.007 |
| SSID | ssj0000388913 |
| Score | 2.2197483 |
| Snippet | •3D tiled OBST code improves data locality.•Improved data locality of 3D tiled code allows us to increase code.•performance and scalability.•3D tiled OBST code... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 101246 |
| SubjectTerms | Code locality Dynamic programming Optimal binary search tree Parallel computing Polyhedral model Tiled code |
| Title | 3D parallel tiled code implementing a modified Knuth's optimal binary search tree algorithm |
| URI | https://dx.doi.org/10.1016/j.jocs.2020.101246 |
| Volume | 48 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1877-7511 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000388913 issn: 1877-7503 databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier Freedom Collection customDbUrl: eissn: 1877-7511 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000388913 issn: 1877-7503 databaseCode: AIKHN dateStart: 20100501 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Complete Freedom Collection [SCCMFC] customDbUrl: eissn: 1877-7511 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000388913 issn: 1877-7503 databaseCode: ACRLP dateStart: 20100501 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection customDbUrl: eissn: 1877-7511 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000388913 issn: 1877-7503 databaseCode: .~1 dateStart: 20100501 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1877-7511 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000388913 issn: 1877-7503 databaseCode: AKRWK dateStart: 20100501 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF6KgngR6wOfZQ-CisTmsZs0x1KVquhFCwUPIfuykbSRNr36251JNqIgHrwuO2yY7HwzuzvzDSEnITcpV5o5ge7BASWVyokDMDwulTZhnKaRxBfdh8dwOGJ3Yz5ukUFTC4NplRb7a0yv0NqOdK02u-9Z1n3ykMqOYwNw2LOMYaE5YxF2Mbj88L7uWZDtJK66JON8BwVs7Uyd5vVWSGTt9qsBH-Pg3_zTN59zs0k2bLBI-_X3tElLz7bIWpOrvkXa1jIX9MzSR59vk5fgiiKhd57rnJZg9Ipi3TrNpjZVHJwVTem0UJmB-JPez5bl5HRBCwCPKawmqgpdWpsAxUdrmuavxTwrJ9MdMrq5fh4MHdtCwZGB65agck8JAcdfsD3BfBZI11WuicGSmQFf3pN-hDGfFwoWiEizCAnPPCaEp3nYi4JdsjIrZnqPUDioqUjGQgIiMd6LhVFSRCZOAS4NN8E-8RrFJdLyi2ObizxpEsneElR2gspOamXvk4svmfeaXePP2bz5H8mPPZIA_P8hd_BPuUOy7mMGS3XhckRWyvlSH0MIUopOtcc6ZLV_ez98_ASebdiW |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9NAEB6FIgGXqg0g0payByRAyMSPXTs-opYo0KYXEqkSB8v7ah05cZS41_72ztjrqEioB64rj2yNd76Z2Z35BuBjLGwutOFeZEaYoORKe2mEhieUNjZO8zxRdKM7vYonc_7rWlz34KzrhaGySof9LaY3aO1Whk6bw3VRDH8HRGUnaAA47lnOxTN4zkWYUAb27T7YHbQQ3UnajEkmAY8kXPNMW-e1qBTRdofNQkiB8L8c1COnMz6AfRctsu_tBx1Cz6z68KIrVu_DoTPNLfvs-KO_vIY_0TkjRu-yNCWr0eo1o8Z1VixdrTh6K5azZaULiwEou1jd1beftqxC9Fji22TTostaG2B0a83y8qbaFPXt8g3Mxz9mZxPPzVDwVOT7Neo80FJi_ovGJ3nII-X72rcpmjK36MxHKkwo6AtiySOZGJ4Q41nApQyMiEdJ9Bb2VtXKvAOGmZpOVCoVQhIXo1RarWRi0xzx0gobDSDoFJcpRzBOcy7KrKskW2Sk7IyUnbXKHsDXncy6pdd48mnR_Y_sr02SIf4_IXf0n3If4OVkNr3MLn9eXRzDq5DKWZrTlxPYqzd35j3GI7U8bfbbA8fe2is |
| 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=3D+parallel+tiled+code+implementing+a+modified+Knuth%27s+optimal+binary+search+tree+algorithm&rft.jtitle=Journal+of+computational+science&rft.au=Bielecki%2C+Wlodzimierz&rft.au=Blaszynski%2C+Piotr&rft.au=Poliwoda%2C+Maciej&rft.date=2021-01-01&rft.pub=Elsevier+B.V&rft.issn=1877-7503&rft.eissn=1877-7511&rft.volume=48&rft_id=info:doi/10.1016%2Fj.jocs.2020.101246&rft.externalDocID=S1877750320305445 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1877-7503&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1877-7503&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1877-7503&client=summon |