{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:26:50Z","timestamp":1743146810648,"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_9","type":"book-chapter","created":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T18:03:23Z","timestamp":1648058603000},"page":"134-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Techniques for\u00a0Managing Polyhedral Dataflow Graphs"],"prefix":"10.1007","author":[{"given":"Ravi","family":"Shankar","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Orenstein","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Rift","sequence":"additional","affiliation":[]},{"given":"Tobi","family":"Popoola","sequence":"additional","affiliation":[]},{"given":"MacDonald","family":"Lowe","sequence":"additional","affiliation":[]},{"given":"Shuai","family":"Yang","sequence":"additional","affiliation":[]},{"given":"T. Dylan","family":"Mikesell","sequence":"additional","affiliation":[]},{"given":"Catherine","family":"Olschanowsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,24]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Barik, R., et al.: The habanero multicore software research project. In: Proceedings of the 24th ACM SIGPLAN Conference Companion on Object Oriented Programming Systems Languages and Applications, OOPSLA 2009, pp. 735\u2013736. Association for Computing Machinery, New York (2009). https:\/\/doi.org\/10.1145\/1639950.1639989","key":"9_CR1","DOI":"10.1145\/1639950.1639989"},{"doi-asserted-by":"publisher","unstructured":"Ben-Nun, T., de Fine Licht, J., Ziogas, A.N., Schneider, T., Hoefler, T.: Stateful dataflow multigraphs: a data-centric model for performance portability on heterogeneous architectures. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2019. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3295500.3356173","key":"9_CR2","DOI":"10.1145\/3295500.3356173"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-11970-5_16","volume-title":"Compiler Construction","author":"M-W Benabderrahmane","year":"2010","unstructured":"Benabderrahmane, M.-W., Pouchet, L.-N., Cohen, A., Bastoul, C.: The polyhedral model is more widely applicable than you think. In: Gupta, R. (ed.) CC 2010. LNCS, vol. 6011, pp. 283\u2013303. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11970-5_16"},{"unstructured":"Blom, P.: GeoAc: numerical tools to model acoustic propagation in the geometric limit (2014). https:\/\/github.com\/LANL-Seismoacoustics\/GeoAc","key":"9_CR4"},{"issue":"3\u20134","key":"9_CR5","first-page":"203","volume":"18","author":"Z Budimli\u0107","year":"2010","unstructured":"Budimli\u0107, Z., et al.: Concurrent collections. Sci. Program. 18(3\u20134), 203\u2013217 (2010)","journal-title":"Sci. Program."},{"doi-asserted-by":"publisher","unstructured":"Chen, C.: Polyhedra scanning revisited. In: Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2012, pp. 499\u2013508. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2254064.2254123","key":"9_CR6","DOI":"10.1145\/2254064.2254123"},{"unstructured":"Chen, C., Chame, J., Hall, M.: CHiLL: a framework for composing high-level loop transformations. Technical report (2008)","key":"9_CR7"},{"doi-asserted-by":"publisher","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: An efficient method of computing static single assignment form. In: Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1989, pp. 25\u201335. Association for Computing Machinery, New York (1989). https:\/\/doi.org\/10.1145\/75277.75280","key":"9_CR8","DOI":"10.1145\/75277.75280"},{"doi-asserted-by":"crossref","unstructured":"Davis, E.C., Strout, M.M., Olschanowsky, C.: Transforming loop chains via macro dataflow graphs. In: Proceedings of the 2018 International Symposium on Code Generation and Optimization, pp. 265\u2013277. ACM (2018)","key":"9_CR9","DOI":"10.1145\/3168832"},{"unstructured":"Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman, T., Wonnacott, D.: The Omega Library interface guide (1995)","key":"9_CR10"},{"unstructured":"LaMielle, A., Strout, M.M.: Enabling code generation within the sparse polyhedral framework. Technical report, Technical Report CS-10-102 (2010)","key":"9_CR11"},{"issue":"8","key":"9_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.3390\/atmos10080443","volume":"10","author":"T Mikesell","year":"2019","unstructured":"Mikesell, T., Rolland, L., Lee, R., Zedek, F., Co\u00efsson, P., Dessa, J.X.: IonoSeis: a package to model coseismic ionospheric disturbances. Atmosphere 10(8), 443 (2019)","journal-title":"Atmosphere"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/2897824.2925952","volume":"35","author":"RT Mullapudi","year":"2016","unstructured":"Mullapudi, R.T., Adams, A., Sharlet, D., Ragan-Kelley, J., Fatahalian, K.: Automatically scheduling Halide image processing pipelines. ACM Trans. Graph. (TOG) 35(4), 83 (2016)","journal-title":"ACM Trans. Graph. (TOG)"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1145\/2786763.2694364","volume":"43","author":"RT Mullapudi","year":"2015","unstructured":"Mullapudi, R.T., Vasista, V., Bondhugula, U.: PolyMage: automatic optimization for image processing pipelines. ACM SIGARCH Comput. Archit. News 43, 429\u2013443 (2015)","journal-title":"ACM SIGARCH Comput. Archit. News"},{"doi-asserted-by":"crossref","unstructured":"Olschanowsky, C., Strout, M.M., Guzik, S., Loffeld, J., Hittinger, J.: A study on balancing parallelism, data locality, and recomputation in existing PDE solvers. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 793\u2013804. IEEE Press, New York (2014)","key":"9_CR15","DOI":"10.1109\/SC.2014.70"},{"doi-asserted-by":"publisher","unstructured":"Popoola, T., et al.: An object-oriented interface to the sparse polyhedral library. In: 2021 IEEE 45th Annual Computers, Software, and Applications Conference (COMPSAC), pp. 1825\u20131831 (2021). https:\/\/doi.org\/10.1109\/COMPSAC51774.2021.00275","key":"9_CR16","DOI":"10.1109\/COMPSAC51774.2021.00275"},{"doi-asserted-by":"publisher","unstructured":"Pugh, W., Wonnacott, D.: Eliminating false data dependences using the omega test. In: Proceedings of the ACM SIGPLAN 1992 Conference on Programming Language Design and Implementation, PLDI 1992, pp. 140\u2013151. Association for Computing Machinery, New York (1992). https:\/\/doi.org\/10.1145\/143095.143129","key":"9_CR17","DOI":"10.1145\/143095.143129"},{"doi-asserted-by":"crossref","unstructured":"Ragan-Kelley, J., Adams, A., Paris, S., Levoy, M., Amarasinghe, S., Durand, F.: Decoupling algorithms from schedules for easy optimization of image processing pipelines (2012)","key":"9_CR18","DOI":"10.1145\/2185520.2185528"},{"issue":"6","key":"9_CR19","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/2499370.2462176","volume":"48","author":"J Ragan-Kelley","year":"2013","unstructured":"Ragan-Kelley, J., Barnes, C., Adams, A., Paris, S., Durand, F., Amarasinghe, S.: Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines. ACM SIGPLAN Not. 48(6), 519\u2013530 (2013)","journal-title":"ACM SIGPLAN Not."},{"doi-asserted-by":"publisher","unstructured":"Sbirlea, A., Pouchet, L.N., Sarkar, V.: DFGR an intermediate graph representation for macro-dataflow programs. In: 2014 4th Workshop on Data-Flow Execution Models for Extreme Scale Computing, pp. 38\u201345 (2014). https:\/\/doi.org\/10.1109\/DFM.2014.9","key":"9_CR20","DOI":"10.1109\/DFM.2014.9"},{"issue":"5","key":"9_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/780822.781142","volume":"38","author":"MM Strout","year":"2003","unstructured":"Strout, M.M., Carter, L., Ferrante, J.: Compile-time composition of run-time data and iteration reorderings. SIGPLAN Not. 38(5), 91\u2013102 (2003). https:\/\/doi.org\/10.1145\/780822.781142","journal-title":"SIGPLAN Not."},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-37658-0_5","volume-title":"Languages and Compilers for Parallel Computing","author":"MM Strout","year":"2013","unstructured":"Strout, M.M., Georg, G., Olschanowsky, C.: Set and relation manipulation for the sparse polyhedral framework. In: Kasahara, H., Kimura, K. (eds.) LCPC 2012. LNCS, vol. 7760, pp. 61\u201375. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37658-0_5"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.parco.2016.02.004","volume":"53","author":"MM Strout","year":"2016","unstructured":"Strout, M.M., LaMielle, A., Carter, L., Ferrante, J., Kreaseck, B., Olschanowsky, C.: An approach for code generation in the sparse polyhedral framework. Parallel Comput. 53, 32\u201357 (2016)","journal-title":"Parallel Comput."},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-37658-0_2","volume-title":"Languages and Compilers for Parallel Computing","author":"T Yuki","year":"2013","unstructured":"Yuki, T., Gupta, G., Kim, D.G., Pathan, T., Rajopadhye, S.: AlphaZ: a system for design space exploration in the polyhedral model. In: Kasahara, H., Kimura, K. (eds.) LCPC 2012. LNCS, vol. 7760, pp. 17\u201331. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37658-0_2"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T18:03:50Z","timestamp":1648058630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-99372-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030993719","9783030993726"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-99372-6_9","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)"}}]}}