{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:32:57Z","timestamp":1742952777588,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030993719"},{"type":"electronic","value":"9783030993726"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-99372-6_1","type":"book-chapter","created":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T18:03:23Z","timestamp":1648058603000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Locality-Based Optimizations in\u00a0the\u00a0Chapel Compiler"],"prefix":"10.1007","author":[{"given":"Engin","family":"Kayraklioglu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elliot","family":"Ronaghan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael P.","family":"Ferguson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bradford L.","family":"Chamberlain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,24]]},"reference":[{"key":"1_CR1","unstructured":"Arkouda: NumPy-like arrays at massive scale backed by Chapel. https:\/\/github.com\/Bears-R-Us\/arkouda. Accessed 26 Jul 2021"},{"key":"1_CR2","unstructured":"Bale. https:\/\/github.com\/jdevinney\/bale. Accessed 26 Jul 2021"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Bertolacci, I.J., et al.: Parameterized diamond tiling for stencil computations with chapel parallel iterators. In: Proceedings of the 29th ACM on International Conference on Supercomputing, ICS 2015, pp. 197\u2013206. ACM (2015). ISBN 978-1-4503-3559-1. https:\/\/doi.org\/10.1145\/2751205.2751226","DOI":"10.1145\/2751205.2751226"},{"key":"1_CR4","unstructured":"Carneiro, T., et al.: Towards Chapel-based Exascale Tree Search Algorithms: dealing with multiple GPU accelerators. In: HPCS 2020, p. 9 (2021)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Chamberlain, B.L.: Chapel, chap. 6. In: Balaji, P. (ed.) Programming Models for Parallel Computing, pp. 129\u2013159. MIT Press (2015)","DOI":"10.7551\/mitpress\/9486.003.0008"},{"key":"1_CR6","unstructured":"Chamberlain, B.L.: The design and implementation of a region based parallel programming language. University of Washington (2001)"},{"key":"1_CR7","unstructured":"Chamberlain, B.L., et al.: User-defined distributions and layouts in Chapel: philosophy and framework. In: Proceedings of the 2nd USENIX Conference on Hot Topics in Parallelism, HotPar 2010, p. 12. USENIX Association (2010)"},{"key":"1_CR8","unstructured":"Chapel 1.20 Release Notes: Benchmarks and Performance Optimizations. https:\/\/chapellang.org\/releaseNotes\/1.20\/06-perf-opt.pdf. Accessed 26 Jul 2021"},{"key":"1_CR9","unstructured":"Chapel 1.23 Release Notes: Ongoing Efforts. https:\/\/chapel-lang.org\/releaseNotes\/1.23\/05-ongoing.pdf. Accessed 26 Jul 2021"},{"key":"1_CR10","unstructured":"Chapel: Performance Highlights: STREAM Triad. https:\/\/chapel-lang.org\/perf-stream.html. Accessed 26 Jul 2021"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Chen, W.-Y., Iancu, C., Yelick, K.: Communication optimizations for fine-grained UPC applications. In: 14th International Conference on Parallel Architectures and Compilation Techniques, PACT 2005, pp. 267\u2013278. IEEE (2005)","DOI":"10.1109\/PACT.2005.13"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Choi, S.-E., Snyder, L.: Quantifying the effects of communication optimizations. In: Proceedings of the 1997 International Conference on Parallel Processing (Cat. No. 97TB100162), August 1997, pp. 218\u2013222 (1997). https:\/\/doi.org\/10.1109\/ICPP.1997.622647","DOI":"10.1109\/ICPP.1997.622647"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Ferguson, M.P., Buettner, D.: Caching puts and gets in a PGAS language runtime. In: 2015 9th International Conference on Partitioned Global Address Space Programming Models, September 2015, pp. 13\u201324 (2015). https:\/\/doi.org\/10.1109\/PGAS.2015.10","DOI":"10.1109\/PGAS.2015.10"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Hayashi, A., et al.: LLVM-based communication optimizations for PGAS programs. In: LLVM 2015, pp. 1\u201311. ACM Press (2015). ISBN 978-1-4503-4005-2. https:\/\/doi.org\/10.1145\/2833157.2833164","DOI":"10.1145\/2833157.2833164"},{"issue":"6","key":"1_CR15","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1109\/TPDS.2021.3051348","volume":"32","author":"E Kayraklioglu","year":"2021","unstructured":"Kayraklioglu, E., Favry, E., El-Ghazawi, T.: A machine-learning-based framework for productive locality exploitation. IEEE Trans. Parallel Distrib. Syst. 32(6), 1409\u20131424 (2021). https:\/\/doi.org\/10.1109\/TPDS.2021.3051348","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/3233299","volume":"15","author":"E Kayraklioglu","year":"2018","unstructured":"Kayraklioglu, E., Ferguson, M.P., El-Ghazawi, T.: LAPPS: locality-aware productive prefetching support for PGAS. ACM Trans. Archit. Code Optim. 15(3), 28:1-28:26 (2018). https:\/\/doi.org\/10.1145\/3233299","journal-title":"ACM Trans. Archit. Code Optim."},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Padmanabhan, N., et al.: Simulating ultralight dark matter in Chapel. In: 2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), May 2020, pp. 678\u2013678 (2020). https:\/\/doi.org\/10.1109\/IPDPSW50202.2020.00120","DOI":"10.1109\/IPDPSW50202.2020.00120"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Parenteau, M., et al.: Development of parallel CFD applications with the Chapel programming language. In: AIAA Scitech 2021 Forum. American Institute of Aeronautics and Astronautics (2021). https:\/\/doi.org\/10.2514\/6.2021-0749","DOI":"10.2514\/6.2021-0749"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Patwardhan, A.A., Upadrasta, R.: PolyhedralModel guided automatic GPU cache exploitation framework. In: 2019 International Conference on High Performance Computing Simulation (HPCS), pp. 496\u2013503 (2019). https:\/\/doi.org\/10.1109\/HPCS48598.2019.9188095","DOI":"10.1109\/HPCS48598.2019.9188095"},{"key":"1_CR20","unstructured":"Rolinger, T.B., Krieger, C.D., Sussman, A.: Runtime optimizations for irregular applications in Chapel. https:\/\/chapel-lang.org\/CHIUW\/2021\/Rolinger.pdf. Accessed 26 Jul 2021"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Sanz, A., et al.: Global data re-allocation via communication aggregation in Chapel. In: 2012 IEEE 24th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), October 2012, pp. 235\u2013242 (2012). https:\/\/doi.org\/10.1109\/SBAC-PAD.2012.18","DOI":"10.1109\/SBAC-PAD.2012.18"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Slaughter, E., et al.: Task bench: a parameterized benchmark for evaluating parallel runtime performance. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE Press (2020). ISBN 9781728199986","DOI":"10.1109\/SC41405.2020.00066"},{"key":"1_CR23","unstructured":"STREAM Benchmark Reference Information. http:\/\/www.cs.virginia.edu\/stream\/ref.html. Accessed 26 Jul 2021"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Trifunovic, K., et al.: Polyhedral-model guided loop-nest auto-vectorization. In: 2009 18th International Conference on Parallel Architectures and Compilation Techniques, pp. 327\u2013337 (2009). https:\/\/doi.org\/10.1109\/PACT.2009.18","DOI":"10.1109\/PACT.2009.18"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-99372-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T22:02:14Z","timestamp":1726869734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-99372-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030993719","9783030993726"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-99372-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LCPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Languages and Compilers for Parallel Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Newark, DE","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lcpc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lcpc2021.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"11","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":"9","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":"0","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":"82% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}