{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:37:03Z","timestamp":1742913423448,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030959524"},{"type":"electronic","value":"9783030959531"}],"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-95953-1_3","type":"book-chapter","created":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T19:49:53Z","timestamp":1644954593000},"page":"29-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Expanding Opportunities for Array Privatization in Sparse Computations"],"prefix":"10.1007","author":[{"given":"Mahdi Soltan","family":"Mohammadi","sequence":"first","affiliation":[]},{"given":"Mary","family":"Hall","sequence":"additional","affiliation":[]},{"given":"Michelle Mills","family":"Strout","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,16]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Bell, N., Garland, M.: Implementing sparse matrix-vector multiplication on throughput-oriented processors. In: SC 2009: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, pp. 1\u201311. ACM, New York (2009)","DOI":"10.1145\/1654059.1654078"},{"key":"3_CR2","unstructured":"Byun, J.H., Lin, R., Yelick, K.A., Demmel, J.: Autotuning sparse matrix-vector multiplication for multicore. Technical report, UCB\/EECS-2012-215, November 2012"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Cheshmi, K., Kamil, S., Strout, M.M., Dehnavi, M.M.: Sympiler: Transforming sparse matrix codes by decoupling symbolic analysis. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2017, pp. 13:1\u201313:13. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3126908.3126936, http:\/\/doi.acm.org\/10.1145\/3126908.3126936","DOI":"10.1145\/3126908.3126936"},{"key":"3_CR4","unstructured":"Davis, T., Hager, W., Duff, I.: Suitesparse (2014). http:\/\/faculty.cse.tamu.edu\/davis\/suitesparse.html"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Lin, Y., Padua, D.: Compiler analysis of irregular memory accesses. In: Proceedings of the 21st Conference on Programming Language Design and Implementation, PLDI 2000, pp. 157\u2013168 (2000). https:\/\/doi.org\/10.1145\/349299.349322","DOI":"10.1145\/349299.349322"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Lin, Y., Padua, D.: Compiler analysis of irregular memory accesses. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, vol. 35, pp. 157\u2013168. ACM, New York, May 2000","DOI":"10.1145\/358438.349322"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"McAuley, J., Leskovec, J.: Hidden factors and hidden topics: understanding rating dimensions with review text. In: Proceedings of the 7th ACM Conference on Recommender Systems, RecSys 2013, pp. 165\u2013172. ACM, New York (2013). https:\/\/doi.org\/10.1145\/2507157.2507163, http:\/\/doi.acm.org\/10.1145\/2507157.2507163","DOI":"10.1145\/2507157.2507163"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-030-34627-0_7","volume-title":"Languages and Compilers for Parallel Computing","author":"MS Mohammadi","year":"2019","unstructured":"Mohammadi, M.S., Cheshmi, K., Dehnavi, M.M., Venkat, A., Yuki, T., Strout, M.M.: Extending Index-array properties for data dependence analysis. In: Hall, M., Sundar, H. (eds.) LCPC 2018. LNCS, vol. 11882, pp. 78\u201393. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34627-0_7"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Mohammadi, M.S., et al.: Sparse computation data dependence simplification for efficient compiler-generated inspectors. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, pp. 594\u2013609. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3314221.3314646","DOI":"10.1145\/3314221.3314646"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Oancea, C.E., Rauchwerger, L.: Logical inference techniques for loop parallelization. In: Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2012, pp. 509\u2013520. ACM, New York (2012)","DOI":"10.1145\/2254064.2254124"},{"issue":"12","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1145\/7902.7904","volume":"29","author":"DA Padua","year":"1986","unstructured":"Padua, D.A., Wolfe, M.J.: Advanced compiler optimizations for supercomputers. Commun. ACM 29(12), 1184\u20131201 (1986)","journal-title":"Commun. ACM"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/509705.509708","volume":"24","author":"Y Paek","year":"2002","unstructured":"Paek, Y., Hoeflinger, J., Padua, D.: Efficient and precise array access analysis. ACM Trans. Program. Lang. Syst. 24(1), 65\u2013109 (2002)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-319-07518-1_8","volume-title":"Supercomputing","author":"J Park","year":"2014","unstructured":"Park, J., Smelyanskiy, M., Sundaram, N., Dubey, P.: Sparsifying synchronization for high-performance shared-memory sparse triangular solver. In: Kunkel, J.M., Ludwig, T., Meuer, H.W. (eds.) ISC 2014. LNCS, vol. 8488, pp. 124\u2013140. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07518-1_8"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Park, J., et al.: Efficient shared-memory implementation of high-performance conjugate gradient benchmark and its application to unstructured matrices. In: Proceedings of International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2014, pp. 945\u2013955. IEEE Press, Piscataway (2014)","DOI":"10.1109\/SC.2014.82"},{"key":"3_CR15","unstructured":"Pugh, B., Wonnacott, D.: Nonlinear array dependence analysis. Technical report CS-TR-3372, Department of Computer Science, University of Maryland, November 1994"},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1145\/291889.291900","volume":"20","author":"W Pugh","year":"1998","unstructured":"Pugh, W., Wonnacott, D.: Constraint-based array dependence analysis. ACM Trans. Program. Lang. Syst. 20(3), 635\u2013678 (1998)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Rauchwerger, L., Padua, D.: The privatizing DOALL test: a run-time technique for DOALL loop identification and array privatization. In: Proceedings of the 8th International Conference on Supercomputing. ICS 1994, pp. 33\u201343. Association for Computing Machinery, New York (1994). https:\/\/doi.org\/10.1145\/181181.181254","DOI":"10.1145\/181181.181254"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/71.752782","volume":"10","author":"L Rauchwerger","year":"1999","unstructured":"Rauchwerger, L., Padua, D.A.: The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization. IEEE Trans. Parallel Distrib. Syst. 10(2), 160\u2013180 (1999). https:\/\/doi.org\/10.1109\/71.752782","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.parco.2016.06.004","volume":"59","author":"SC Rennich","year":"2016","unstructured":"Rennich, S.C., Stosic, D., Davis, T.A.: Accelerating sparse Cholesky factorization on GPUs. Parallel Comput. 59, 140\u2013150 (2016)","journal-title":"Parallel Comput."},{"issue":"4","key":"3_CR20","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1024597010150","volume":"31","author":"S Rus","year":"2003","unstructured":"Rus, S., Hoeflinger, J., Rauchwerger, L.: Hybrid analysis: static & dynamic memory reference analysis. Int. J. Parallel Program. 31(4), 251\u2013283 (2003)","journal-title":"Int. J. Parallel Program."},{"key":"3_CR21","unstructured":"Rus, S.V.: Hybrid analysis of memory references and its application to automatic parallelization. Ph.D. thesis, Texas A&M (2006)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/3-540-57659-2_29","volume-title":"Languages and Compilers for Parallel Computing","author":"P Tu","year":"1994","unstructured":"Tu, P., Padua, D.: Automatic array privatization. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds.) LCPC 1993. LNCS, vol. 768, pp. 500\u2013521. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-57659-2_29"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-06486-4_7","volume-title":"High-Performance Computing on the Intel\u00ae Xeon Phi\u2122","author":"E Wang","year":"2014","unstructured":"Wang, E., et al.: Intel math kernel library. In: Wang, E., et al. (eds.) High-Performance Computing on the Intel\u00ae Xeon Phi\u2122, pp. 167\u2013188. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06486-4_7"}],"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-95953-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T19:54:41Z","timestamp":1644954881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95953-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030959524","9783030959531"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95953-1_3","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":"16 February 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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lcpc2020","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":"19","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":"15","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":"79% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}