{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T23:10:31Z","timestamp":1774998631349,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031226762","type":"print"},{"value":"9783031226779","type":"electronic"}],"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-22677-9_27","type":"book-chapter","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T09:04:32Z","timestamp":1673341472000},"page":"507-528","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Astute Approach to\u00a0Handling Memory Layouts of\u00a0Regular Data Structures"],"prefix":"10.1007","author":[{"given":"Adam","family":"\u0160melko","sequence":"first","affiliation":[]},{"given":"Martin","family":"Kruli\u0161","sequence":"additional","affiliation":[]},{"given":"Miroslav","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Klepl","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Mayer","sequence":"additional","affiliation":[]},{"given":"Petr","family":"\u0160im\u016fnek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","unstructured":"Afanasyev, A., et al.: GridTools: a framework for portable weather and climate applications. SoftwareX 15, 100707 (2021). https:\/\/doi.org\/10.1016\/j.softx.2021.100707. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2352711021000522","DOI":"10.1016\/j.softx.2021.100707"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Bauer, M., Treichler, S., Slaughter, E., Aiken, A.: Legion: expressing locality and independence with logical regions. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC 2012, pp. 1\u201311. IEEE (2012)","DOI":"10.1109\/SC.2012.71"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Bethel, E.W., Camp, D., Donofrio, D., Howison, M.: Improving performance of structured-memory, data-intensive applications on multi-core platforms via a space-filling curve memory layout. In: 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, pp. 565\u2013574. IEEE (2015)","DOI":"10.1109\/IPDPSW.2015.71"},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1177\/1094342007078442","volume":"21","author":"BL Chamberlain","year":"2007","unstructured":"Chamberlain, B.L., Callahan, D., Zima, H.P.: Parallel programmability and the chapel language. Int. J. High Perform. Comput. Appl. 21(3), 291\u2013312 (2007)","journal-title":"Int. J. High Perform. Comput. Appl."},{"issue":"10","key":"27_CR5","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/1103845.1094852","volume":"40","author":"P Charles","year":"2005","unstructured":"Charles, P., et al.: X10: an object-oriented approach to non-uniform cluster computing. ACM SIGPLAN Not. 40(10), 519\u2013538 (2005)","journal-title":"ACM SIGPLAN Not."},{"key":"27_CR6","unstructured":"Clarke, B., et al.: Profunctor optics, a categorical update. arXiv preprint arXiv:2001.07488 (2020)"},{"issue":"1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/346023.346031","volume":"28","author":"P Clauss","year":"2000","unstructured":"Clauss, P., Meister, B.: Automatic memory layout transformations to optimize spatial locality in parameterized loop nests. ACM SIGARCH Comput. Archit. News 28(1), 11\u201319 (2000)","journal-title":"ACM SIGARCH Comput. Archit. News"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Foster, J.N., Greenwald, M.B., Moore, J.T., Pierce, B.C., Schmitt, A.: Combinators for bidirectional tree transformations: a linguistic approach to the view-update problem. ACM Trans. Program. Lang. Syst. (TOPLAS) 29(3), 17-es (2007)","DOI":"10.1145\/1232420.1232424"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Frigo, M., Johnson, S.G.: FFTW: an adaptive software architecture for the FFT. In: Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998 (Cat. No. 98CH36181), vol. 3, pp. 1381\u20131384. IEEE (1998)","DOI":"10.1109\/ICASSP.1998.681704"},{"issue":"10","key":"27_CR10","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1002\/cpe.1628","volume":"23","author":"KA Hawick","year":"2011","unstructured":"Hawick, K.A., Playne, D.P.: Hypercubic storage layout and transforms in arbitrary dimensions using GPUs and CUDA. Concurr. Comput. Practice Exp. 23(10), 1027\u20131050 (2011)","journal-title":"Concurr. Comput. Practice Exp."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Heinecke, A., Bader, M.: Parallel matrix multiplication based on space-filling curves on shared memory multicore platforms. In: Proceedings of the 2008 Workshop on Memory Access on Future Processors: A Solved Problem, pp. 385\u2013392 (2008)","DOI":"10.1145\/1366219.1366223"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Kruli\u0161, M., Kratochv\u00edl, M.: Detailed analysis and optimization of CUDA k-means algorithm. In: 49th International Conference on Parallel Processing-ICPP, pp. 1\u201311 (2020)","DOI":"10.1145\/3404397.3404426"},{"key":"27_CR13","unstructured":"NVIDIA: CUDA C best practices guide (2013)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Panda, P.R., Semeria, L., De Micheli, G.: Cache-efficient memory layout of aggregate data structures. In: Proceedings of the 14th International Symposium on Systems Synthesis, pp. 101\u2013106 (2001)","DOI":"10.1145\/500001.500026"},{"issue":"1","key":"27_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1177\/1094342004041291","volume":"18","author":"M P\u00fcschel","year":"2004","unstructured":"P\u00fcschel, M., et al.: Spiral: a generator for platform-adapted libraries of signal processing algorithms. Int. J. High Perform. Comput. Appl. 18(1), 21\u201345 (2004)","journal-title":"Int. J. High Perform. Comput. Appl."},{"issue":"4","key":"27_CR16","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TPDS.2021.3097283","volume":"33","author":"CR Trott","year":"2022","unstructured":"Trott, C.R., et al.: Kokkos 3: programming model extensions for the exascale era. IEEE Trans. Parallel Distrib. Syst. 33(4), 805\u2013817 (2022). https:\/\/doi.org\/10.1109\/TPDS.2021.3097283","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"27_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3106341","volume":"14","author":"N Weber","year":"2017","unstructured":"Weber, N., Goesele, M.: MATOG: array layout auto-tuning for CUDA. ACM Trans. Archit. Code Optim. (TACO) 14(3), 1\u201326 (2017)","journal-title":"ACM Trans. Archit. Code Optim. (TACO)"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-540-73940-1_33","volume-title":"Parallel Computing Technologies","author":"J Weidendorfer","year":"2007","unstructured":"Weidendorfer, J., Ott, M., Klug, T., Trinitis, C.: Latencies of conflicting writes on contemporary multicore architectures. In: Malyshkin, V. (ed.) PaCT 2007. LNCS, vol. 4671, pp. 318\u2013327. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73940-1_33"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Whaley, R.C., Dongarra, J.J.: Automatically tuned linear algebra software. In: Proceedings of the 1998 ACM\/IEEE Conference on Supercomputing, SC 1998, p. 38. IEEE (1998)","DOI":"10.1109\/SC.1998.10004"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22677-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T22:41:21Z","timestamp":1728686481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22677-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031226762","9783031226779"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22677-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"10 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}