{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T21:34:29Z","timestamp":1726004069445},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030052331"},{"type":"electronic","value":"9783030052348"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-05234-8_9","type":"book-chapter","created":{"date-parts":[[2018,12,29]],"date-time":"2018-12-29T17:44:09Z","timestamp":1546105449000},"page":"66-75","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Practical and Aggressive Loop Fission Technique"],"prefix":"10.1007","author":[{"given":"Bo","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingying","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongcai","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramin","family":"Yahyapour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,30]]},"reference":[{"key":"9_CR1","volume-title":"Parallel Computer Architecture: A Hardware\/software Approach","author":"DE Culler","year":"1999","unstructured":"Culler, D.E., Singh, J.P., Gupta, A.: Parallel Computer Architecture: A Hardware\/software Approach. Gulf Professional Publishing, Houston (1999)"},{"key":"9_CR2","volume-title":"Programming Massively Parallel Processors: A Hands-on Approach","author":"DB Kirk","year":"2016","unstructured":"Kirk, D.B., Wen-Mei, W.H.: Programming Massively Parallel Processors: A Hands-on Approach. Morgan Kaufmann, Burlington (2016)"},{"key":"9_CR3","volume-title":"Introduction to Parallel Computing: Design and Analysis of Algorithms","author":"V Kumar","year":"1994","unstructured":"Kumar, V., et al.: Introduction to Parallel Computing: Design and Analysis of Algorithms, vol. 400. Benjamin\/Cummings, Redwood City (1994)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Pugh, W.: The Omega test: a fast and practical integer programming algorithm for dependence analysis. In: Proceedings of the 1991 ACM\/IEEE Conference on Supercomputing. ACM (1991)","DOI":"10.1145\/125826.125848"},{"issue":"4","key":"9_CR5","first-page":"57","volume":"11","author":"F Luporini","year":"2015","unstructured":"Luporini, F., et al.: Cross-loop optimization of arithmetic intensity for finite element local assembly. ACM Trans. Archit. Code Optim. (TACO) 11(4), 57 (2015)","journal-title":"ACM Trans. Archit. Code Optim. (TACO)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Kennedy, K., McKinley, K.S.: Optimizing for parallelism and data locality. In: ACM International Conference on Supercomputing 25th Anniversary Volume. ACM (2014)","DOI":"10.1145\/2591635.2667164"},{"issue":"6","key":"9_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/502949.502897","volume":"19","author":"JR Allen","year":"1984","unstructured":"Allen, J.R., Kennedy, K.: Automatic loop interchange. ACM Sigplan Notices 19(6), 233\u2013246 (1984)","journal-title":"ACM Sigplan Notices"},{"key":"9_CR8","volume-title":"Loop Parallelization","author":"U Banerjee","year":"2013","unstructured":"Banerjee, U.: Loop Parallelization. Springer, Heidelberg (2013)"},{"key":"9_CR9","unstructured":"open64-5.0 compiler source code. \nhttp:\/\/sourceforge.net\/projects\/open64\/files\/open64\/Open64-5.0"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/68182.68200","volume":"17","author":"S McFarling","year":"1989","unstructured":"McFarling, S.: Program optimization for instruction caches. ACM SIGARCH Comput. Archit. News 17(2), 183\u2013191 (1989)","journal-title":"ACM SIGARCH Comput. Archit. News"},{"key":"9_CR11","volume-title":"Optimizing Compilers for Modern Architectures: a Dependence-Based Approach","author":"R Allen","year":"2002","unstructured":"Allen, R., Kennedy, K.: Optimizing Compilers for Modern Architectures: a Dependence-Based Approach, vol. 1. Morgan Kaufmann, San Francisco (2002)"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/1925844.1926449","volume":"46","author":"L-N Pouchet","year":"2011","unstructured":"Pouchet, L.-N., et al.: Loop transformations: convexity, pruning and optimization. ACM SIGPLAN Notices 46(1), 549\u2013562 (2011)","journal-title":"ACM SIGPLAN Notices"},{"issue":"6","key":"9_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1145\/2499370.2462187","volume":"48","author":"M Kong","year":"2013","unstructured":"Kong, M., et al.: When polyhedral transformations meet SIMD code generation. ACM Sigplan Notices. 48(6), 127\u2013138 (2013)","journal-title":"ACM Sigplan Notices."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Maleki, S., et al.: An evaluation of vectorizing compilers. In: 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE (2011)","DOI":"10.1109\/PACT.2011.68"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-24644-2_14","volume-title":"Languages and Compilers for Parallel Computing","author":"C Bastoul","year":"2004","unstructured":"Bastoul, C., Cohen, A., Girbal, S., Sharma, S., Temam, O.: Putting polyhedral loop transformations to work. In: Rauchwerger, L. (ed.) LCPC 2003. LNCS, vol. 2958, pp. 209\u2013225. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24644-2_14"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-03770-2_30","volume-title":"Recent Advances in Parallel Virtual Machine and Message Passing Interface","author":"T Hoefler","year":"2009","unstructured":"Hoefler, T., Lumsdaine, A., Dongarra, J.: Towards efficient mapreduce using MPI. In: Ropo, M., Westerholm, J., Dongarra, J. (eds.) EuroPVM\/MPI 2009. LNCS, vol. 5759, pp. 240\u2013249. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03770-2_30"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05234-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,29]],"date-time":"2018-12-29T17:46:06Z","timestamp":1546105566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05234-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030052331","9783030052348"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05234-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"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":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"15 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2018\/authors.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"407","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"141","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - 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"}},{"value":"2.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}