{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:40:36Z","timestamp":1726058436047},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030346263"},{"type":"electronic","value":"9783030346270"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34627-0_1","type":"book-chapter","created":{"date-parts":[[2019,11,12]],"date-time":"2019-11-12T09:02:55Z","timestamp":1573549375000},"page":"1-20","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Unified Approach to Variable Renaming for Enhanced Vectorization"],"prefix":"10.1007","author":[{"given":"Prasanth","family":"Chatarasi","sequence":"first","affiliation":[]},{"given":"Jun","family":"Shirako","sequence":"additional","affiliation":[]},{"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"Vivek","family":"Sarkar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,13]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Baghdadi, R., et al.: PENCIL: a platform-neutral compute intermediate language for accelerator programming. In: Proceedings of the 2015 International Conference on Parallel Architecture and Compilation (PACT), PACT 2015, pp. 138\u2013149. IEEE Computer Society, Washington, DC (2015). \nhttps:\/\/doi.org\/10.1109\/PACT.2015.17","DOI":"10.1109\/PACT.2015.17"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Bhaskaracharya, S.G., Bondhugula, U., Cohen, A.: SMO: an integrated approach to intra-array and inter-array storage optimization. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, pp. 526\u2013538. ACM, New York (2016). \nhttps:\/\/doi.org\/10.1145\/2837614.2837636","DOI":"10.1145\/2837614.2837636"},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/2896389","volume":"38","author":"U Bondhugula","year":"2016","unstructured":"Bondhugula, U., Acharya, A., Cohen, A.: The Pluto+ algorithm: a practical approach for parallelization and locality optimization of affine loop nests. ACM Trans. Program. Lang. Syst. 38(3), 12:1\u201312:32 (2016). \nhttps:\/\/doi.org\/10.1145\/2896389","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR4","unstructured":"Callahan, D., Dongarra, J., Levine, D.: Vectorizing compilers: a test suite and results. In: Proceedings of the 1988 ACM\/IEEE Conference on Supercomputing, Supercomputing 1988, pp. 98\u2013105. IEEE Computer Society Press, Los Alamitos (1988). \nhttp:\/\/dl.acm.org\/citation.cfm?id=62972.62987"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1018790129478","volume":"26","author":"P Calland","year":"1998","unstructured":"Calland, P., Darte, A., Robert, Y., Vivien, F.: On the removal of anti- and output-dependences. Int. J. Parallel Program. 26(2), 285\u2013312 (1998). \nhttps:\/\/doi.org\/10.1023\/A:1018790129478","journal-title":"Int. J. Parallel Program."},{"issue":"12","key":"1_CR6","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.sysarc.2004.06.001","volume":"50","author":"Weng-Long Chang","year":"2004","unstructured":"Chang, W.L., Chu, C.P., Ho, M.S.H.: Exploitation of parallelism to nested loops with dependence cycles. J. Syst. Arch. 50(12), 729\u2013742 (2004). \nhttps:\/\/doi.org\/10.1016\/j.sysarc.2004.06.001\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S1383762104000670","journal-title":"Journal of Systems Architecture"},{"key":"1_CR7","unstructured":"Chu, C.P.: A theoretical approach involving recurrence resolution, dependence cycle statement ordering and subroutine transformation for the exploitation of parallelism in sequential code. Ph.D. thesis, Louisiana State University, Baton Rouge, LA, USA (1992). uMI Order No. GAX92-07498"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Chu, C.P., Carver, D.L.: An analysis of recurrence relations in Fortran Do-loops for vector processing. In: Proceedings. The Fifth International Parallel Processing Symposium, pp. 619\u2013625, April 1991. \nhttps:\/\/doi.org\/10.1109\/IPPS.1991.153845","DOI":"10.1109\/IPPS.1991.153845"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Evans, G.C., Abraham, S., Kuhn, B., Padua, D.A.: Vector seeker: a tool for finding vector potential. In: Proceedings of the 2014 Workshop on Programming Models for SIMD\/Vector Processing, WPMVP 2014, pp. 41\u201348. ACM, New York (2014). \nhttps:\/\/doi.org\/10.1145\/2568058.2568069","DOI":"10.1145\/2568058.2568069"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Feautrier, P.: Array expansion. In: Proceedings of the 2nd International Conference on Supercomputing, ICS 1988, pp. 429\u2013441. ACM, New York (1988). \nhttps:\/\/doi.org\/10.1145\/55364.55406","DOI":"10.1145\/55364.55406"},{"issue":"6","key":"1_CR11","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973). \nhttps:\/\/doi.org\/10.1145\/362248.362272","journal-title":"Commun. ACM"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4(1), 77\u201384 (1975). \nhttps:\/\/doi.org\/10.1137\/0204007","journal-title":"SIAM J. Comput."},{"key":"1_CR13","volume-title":"Optimizing Compilers for Modern Architectures: A Dependence-Based Approach","author":"K Kennedy","year":"2002","unstructured":"Kennedy, K., Allen, J.R.: Optimizing Compilers for Modern Architectures: A Dependence-Based Approach. Morgan Kaufmann Publishers Inc., San Francisco (2002)"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Knobe, K., Sarkar, V.: Array SSA form and its use in parallelization. In: Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1998, pp. 107\u2013120. ACM, New York (1998). \nhttps:\/\/doi.org\/10.1145\/268946.268956","DOI":"10.1145\/268946.268956"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Kuck, D.J., Kuhn, R.H., Padua, D.A., Leasure, B., Wolfe, M.: Dependence graphs and compiler optimizations. In: Proceedings of the 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981, pp. 207\u2013218. ACM, New York (1981). \nhttps:\/\/doi.org\/10.1145\/567532.567555","DOI":"10.1145\/567532.567555"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Maleki, S., Gao, Y., Garzar\u00e1n, M.J., Wong, T., Padua, D.A.: An evaluation of vectorizing compilers. In: Proceedings of the 2011 International Conference on Parallel Architectures and Compilation Techniques, PACT 2011, pp. 372\u2013382. IEEE Computer Society, Washington, DC (2011). \nhttps:\/\/doi.org\/10.1109\/PACT.2011.68","DOI":"10.1109\/PACT.2011.68"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Rus, S., He, G., Alias, C., Rauchwerger, L.: Region array SSA. In: Proceedings of the 15th International Conference on Parallel Architectures and Compilation Techniques, PACT 2006, pp. 43\u201352. ACM, New York (2006). \nhttps:\/\/doi.org\/10.1145\/1152154.1152165","DOI":"10.1145\/1152154.1152165"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MM.2017.35","volume":"37","author":"N Stephens","year":"2017","unstructured":"Stephens, N., et al.: The ARM scalable vector extension. IEEE Micro 37(2), 26\u201339 (2017). \nhttps:\/\/doi.org\/10.1109\/MM.2017.35","journal-title":"IEEE Micro"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-15582-6_49","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"S Verdoolaege","year":"2010","unstructured":"Verdoolaege, S.: isl: an integer set library for the polyhedral model. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 299\u2013302. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15582-6_49"},{"issue":"4","key":"1_CR20","doi-asserted-by":"publisher","first-page":"54:1","DOI":"10.1145\/2400682.2400713","volume":"9","author":"S Verdoolaege","year":"2013","unstructured":"Verdoolaege, S., Carlos Juega, J., Cohen, A., Ignacio G\u00f3mez, J., Tenllado, C., Catthoor, F.: Polyhedral parallel code generation for CUDA. ACM Trans. Archit. Code Optim. 9(4), 54:1\u201354:23 (2013). \nhttps:\/\/doi.org\/10.1145\/2400682.2400713","journal-title":"ACM Trans. Archit. Code Optim."},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Weiss, M.: Strip mining on SIMD architectures. In: Proceedings of the 5th International Conference on Supercomputing, ICS 1991, pp. 234\u2013243. ACM, New York (1991). \nhttps:\/\/doi.org\/10.1145\/109025.109083","DOI":"10.1145\/109025.109083"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34627-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,12]],"date-time":"2019-11-12T09:03:21Z","timestamp":1573549401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34627-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030346263","9783030346270"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34627-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 November 2019","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":"Salt Lake City, UT","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lcpc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lcpcworkshop.org\/","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":"Confy","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","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":"14","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":"54% - 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":"2","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":"2","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)"}}]}}