{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:16:20Z","timestamp":1760141780739,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304446"},{"type":"electronic","value":"9783031304453"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30445-3_5","type":"book-chapter","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T09:02:52Z","timestamp":1682499772000},"page":"51-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["NPDP Benchmark Suite for\u00a0Loop Tiling Effectiveness Evaluation"],"prefix":"10.1007","author":[{"given":"Marek","family":"Palkowski","sequence":"first","affiliation":[]},{"given":"Wlodzimierz","family":"Bielecki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,27]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1515\/amcs-2016-0065","volume":"26","author":"W Bielecki","year":"2016","unstructured":"Bielecki, W., Palkowski, M.: Tiling of arbitrarily nested loops by means of the transitive closure of dependence graphs. Int. J. Appl. Math. Comput. Sci. (AMCS) 26(4), 919\u2013939 (2016)","journal-title":"Int. J. Appl. Math. Comput. Sci. (AMCS)"},{"issue":"6","key":"5_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/1379022.1375595","volume":"43","author":"U Bondhugula","year":"2008","unstructured":"Bondhugula, U., et al.: A practical automatic polyhedral parallelizer and locality optimizer. SIGPLAN Not. 43(6), 101\u2013113 (2008). https:\/\/doi.org\/10.1145\/1379022.1375595","journal-title":"SIGPLAN Not."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Chen, Z., et. al.: Lore: a loop repository for the evaluation of compilers. In: 2017 IEEE International Symposium on Workload Characterization (IISWC), pp. 219\u2013228. IEEE (2017)","DOI":"10.1109\/IISWC.2017.8167779"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Chowdhury, R., et. al.: Autogen. ACM Trans. Parallel Comput. 4(1), 1\u201330 (2017). https:\/\/doi.org\/10.1145\/3125632","DOI":"10.1145\/3125632"},{"key":"5_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., et al.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"5_CR6","unstructured":"Freiburg bioinformatics group: freiburg RNA Tools, Teaching RNA algorithms. https:\/\/rna.informatik.uni-freiburg.de\/teaching (2022)"},{"key":"5_CR7","unstructured":"Griebl, M.: Automatic parallelization of loop programs for distributed memory architectures (2004)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Irigoin, F., Triolet, R.: Supernode partitioning. In: Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 319\u2013329. POPL 1988, ACM, New York (1988)","DOI":"10.1145\/73560.73588"},{"issue":"6","key":"5_CR9","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF03356760","volume":"24","author":"W Kelly","year":"1996","unstructured":"Kelly, W., et al.: Transitive closure of infinite graphs and its applications. Int. J. Parallel Program. 24(6), 579\u2013598 (1996)","journal-title":"Int. J. Parallel Program."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"DE Knuth","year":"1971","unstructured":"Knuth, D.E.: Optimum binary search trees. Acta Informatica 1(1), 14\u201325 (1971)","journal-title":"Acta Informatica"},{"issue":"10","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1261\/rna.1643609","volume":"15","author":"ZJ Lu","year":"2009","unstructured":"Lu, Z.J., Gloor, J.W., Mathews, D.H.: Improved RNA secondary structure prediction by maximizing expected pair accuracy. RNA 15(10), 1805\u20131813 (2009). https:\/\/doi.org\/10.1261\/rna.1643609","journal-title":"RNA"},{"issue":"6\u20137","key":"5_CR12","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1002\/bip.360290621","volume":"29","author":"JS McCaskill","year":"1990","unstructured":"McCaskill, J.S.: The equilibrium partition function and base pair binding probabilities for RNA secondary structure. Biopolymers 29(6\u20137), 1105\u20131119 (1990)","journal-title":"Biopolymers"},{"key":"5_CR13","unstructured":"McMahon, F.H.: The livermore fortran kernels: A computer test of the numerical performance range. Technical Report, UCRL-53745, Lawrence Livermore National Laboratory, Livermore, California (1986)"},{"key":"5_CR14","unstructured":"Mullapudi, R.T., Bondhugula, U.: Tiling for dynamic scheduling. In: Rajopadhye, S., Verdoolaege, S. (eds.) Proceedings of the 4th International Workshop on Polyhedral Compilation Techniques, Vienna, Austria (2014)"},{"key":"5_CR15","unstructured":"NAS benchmarks suite. http:\/\/www.nas.nasa.gov (2013)"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. In: Molecular Biology, pp. 453\u2013463. Elsevier (1989). https:\/\/doi.org\/10.1016\/b978-0-12-131200-8.50031-9","DOI":"10.1016\/b978-0-12-131200-8.50031-9"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0135006","volume":"35","author":"R Nussinov","year":"1978","unstructured":"Nussinov, R., et al.: Algorithms for loop matchings. SIAM J. Appl. Math. 35(1), 68\u201382 (1978)","journal-title":"SIAM J. Appl. Math."},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Palkowski, M., Bielecki, W.: Tiling nussinov\u2019s RNA folding loop nest with a space-time approach. BMC Bioinf. 20(1) (2019). https:\/\/doi.org\/10.1186\/s12859-019-2785-6","DOI":"10.1186\/s12859-019-2785-6"},{"key":"5_CR19","unstructured":"The Polyhedral Benchmark suite (2012). http:\/\/www.cse.ohio-state.edu\/pouchet\/software\/polybench\/"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/3-540-57659-2_31","volume-title":"Languages and Compilers for Parallel Computing","author":"W Pugh","year":"1994","unstructured":"Pugh, W., Wonnacott, D.: An exact method for analysis of value-based array data dependences. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds.) LCPC 1993. LNCS, vol. 768, pp. 546\u2013566. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-57659-2_31"},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T Smith","year":"1981","unstructured":"Smith, T., Waterman, M.: Identification of common molecular subsequences. J. Mol. Biol. 147(1), 195\u2013197 (1981)","journal-title":"J. Mol. Biol."},{"issue":"3\u20134","key":"5_CR22","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0025-5564(78)90099-8","volume":"42","author":"M Waterman","year":"1978","unstructured":"Waterman, M., Smith, T.: RNA secondary structure: a complete mathematical analysis. Math. Biosci. 42(3\u20134), 257\u2013266 (1978)","journal-title":"Math. Biosci."},{"key":"5_CR23","unstructured":"Wonnacott, D., Jin, T., Lake, A.: Automatic tiling of \u201cmostly-tileable\u201d loop nests. In: IMPACT 2015: 5th International Workshop on Polyhedral Compilation Techniques, At Amsterdam, The Netherlands (2015)"},{"issue":"15","key":"5_CR24","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1186\/s12859-017-1917-0","volume":"18","author":"C Zhao","year":"2017","unstructured":"Zhao, C., Sahni, S.: Cache and energy efficient algorithms for Nussinov\u2019s RNA folding. BMC Bioinf. 18(15), 518 (2017)","journal-title":"BMC Bioinf."},{"issue":"1","key":"5_CR25","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/nar\/9.1.133","volume":"9","author":"M Zuker","year":"1981","unstructured":"Zuker, M., Stiegler, P.: Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Res. 9(1), 133\u2013148 (1981)","journal-title":"Nucleic Acids Res."},{"key":"5_CR26","unstructured":"UTDSP benchmark suite. http:\/\/www.eecg.toronto.edu\/corinna\/DSP\/infrastructure\/UTDSP.html (2012)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30445-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T04:44:45Z","timestamp":1760071485000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30445-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304446","9783031304453"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30445-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gdansk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppam.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}