{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T22:40:09Z","timestamp":1756334409193,"version":"3.44.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030856649"},{"type":"electronic","value":"9783030856656"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-85665-6_1","type":"book-chapter","created":{"date-parts":[[2021,8,28]],"date-time":"2021-08-28T03:06:52Z","timestamp":1630120012000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["ALONA: Automatic Loop Nest Approximation with Reconstruction and\u00a0Space Pruning"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Maier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Biagio","family":"Cosenza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben","family":"Juurlink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,25]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Bao, W., Krishnamoorthy, S., Pouchet, L.N., Sadayappan, P.: Analytical Modeling of Cache Behavior for Affine Programs. Lang, ACM Program (2017)","DOI":"10.1145\/3158120"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Barvinok, A.I.: A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Mathematics of Operations Research (1994)","DOI":"10.1287\/moor.19.4.769"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Baskaran, M.M., Ramanujam, J., Sadayappan, P.: Automatic C-to-CUDA code generation for affine programs. In: Proceedings of CC (2010)","DOI":"10.1007\/978-3-642-11970-5_14"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Benabderrahmane, M., Pouchet, L., Cohen, A., Bastoul, C.: The polyhedral model is more widely applicable than you think. In: Proceedings of CC (2010)","DOI":"10.1007\/978-3-642-11970-5_16"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Bondhugula, U., Acharya, A., Cohen, A.: The pluto+ algorithm: a practical approach for parallelization and locality optimization of affine loop nests. ACM TOPLAS (2016)","DOI":"10.1145\/2896389"},{"key":"1_CR6","unstructured":"Bondhugula, U., Baskaran, M.M., Krishnamoorthy, S., Ramanujam, J., Rountev, A., Sadayappan, P.: Automatic transformations for communication-minimized parallelization and locality optimization in the polyhedral model. In: Proceedings of CC (2008)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Campanoni, S., Holloway, G.H., Wei, G., Brooks, D.M.: HELIX-UP: relaxing program semantics to unleash parallelization. In: Proceedings of CGO (2015)","DOI":"10.1109\/CGO.2015.7054203"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Cherubin, S., Cattaneo, D., Chiari, M., Agosta, G.: Dynamic Precision Autotuning with TAFFO. TACO (2020)","DOI":"10.1145\/3388785"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Cosenza, B., Durillo, J.J., Ermon, S., Juurlink, B.: Autotuning stencil computations with structural ordinal regression learning. In: Proceedings of IPDPS (2017)","DOI":"10.1109\/IPDPS.2017.102"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Deiana, E.A., St-Amour, V., Dinda, P.A., Hardavellas, N., Campanoni, S.: Unconventional Parallelization of Nondeterministic Applications. SIGPLAN Not. (2018)","DOI":"10.1145\/3173162.3173181"},{"key":"1_CR11","unstructured":"Esmaeilzadeh, H., Sampson, A., Ceze, L., Burger, D.: Architecture support for disciplined approximate programming. In: Proceedings of ASPLOS (2017)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Fernando, V., Franques, A., Abadal, S., Misailovic, S., Torrellas, J.: Replica: a wireless manycore for communication-intensive and approximate data. In: Proceedings of ASPLOS (2019)","DOI":"10.1145\/3297858.3304033"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Ganser, S., Gr\u00f6\u00dflinger, A., Siegmund, N., Apel, S., Lengauer, C.: Speeding up iterative polyhedral schedule optimization with surrogate performance models. TACO (2018)","DOI":"10.1145\/3291773"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Grosser, T., Gr\u00f6\u00dflinger, A., Lengauer, C.: Polly - Performing Polyhedral Optimizations on a Low-Level Intermediate Representation. Parallel Proc, Letters (2012)","DOI":"10.1142\/S0129626412500107"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Gysi, T., Grosser, T., Brandner, L., Hoefler, T.: A fast analytical model of fully associative caches. In: Proceedings of PLDI (2019)","DOI":"10.1145\/3314221.3314606"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Imani, M., Garcia, R., Huang, A., Rosing, T.: CADE: configurable approximate divider for energy efficiency. In: Proceedings of DATE (2019)","DOI":"10.23919\/DATE.2019.8715112"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Jimborean, A., Clauss, P., Pradelle, B., Mastrangelo, L., Loechner, V.: Adapting the polyhedral model as a framework for efficient speculative parallelization. In: Proceedings of PPoPP (2012)","DOI":"10.1145\/2145816.2145861"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Khatamifard, S.K., Akturk, I., Karpuzcu, U.R.: On approximate speculative lock elision. IEEE Trans. Multi-Scale Comput. Syst. 4(2) (2018)","DOI":"10.1109\/TMSCS.2017.2773488"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Lashgar, A., Atoofian, E., Baniasadi, A.: Loop perforation in OpenACC. In: Proceedings of ISPA (2018)","DOI":"10.1109\/BDCloud.2018.00036"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Li, S., Park, S., Mahlke, S.: Sculptor: Flexible approximation with selective dynamic loop perforation. In: Proceedings of ICS (2018)","DOI":"10.1145\/3205289.3205317"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Maier, D., Cosenza, B., Juurlink, B.: Local memory-aware kernel perforation. In: Proceedings of CGO (2018)","DOI":"10.1145\/3168814"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Mitra, S., Gupta, M.K., Misailovic, S., Bagchi, S.: Phase-aware optimization in approximate computing. In: Proceedings of CGO (2017)","DOI":"10.1109\/CGO.2017.7863739"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Mittal, S.: A Survey of Techniques for Approximate Computing. ACM Comput. Surv. (2016)","DOI":"10.1145\/2893356"},{"key":"1_CR24","unstructured":"Pouchet, L.N.: Polybench\/c 3.2. http:\/\/www.cse.ohio-state.edu\/~pouchet\/software\/polybench\/"},{"key":"1_CR25","volume-title":"Iterative Optimization in the Polyhedral Model: Part II","author":"LN Pouchet","year":"2008","unstructured":"Pouchet, L.N., Bastoul, C., Cohen, A., Cavazos, J.: Iterative Optimization in the Polyhedral Model: Part II. Multidimensional Time, SIGPLAN Not (2008)"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Pouchet, L.N., Bastoul, C., Cohen, A., Vasilache, N.: Iterative optimization in the polyhedral model: Part i, one-dimensional time. In: Proceedings of CGO (2007)","DOI":"10.1109\/CGO.2007.21"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Pouchet, L., Bondhugula, U., Bastoul, C., Cohen, A., Ramanujam, J., Sadayappan, P., Vasilache, N.: Loop transformations: convexity, pruning and optimization. In: Proceedings of POPL (2011)","DOI":"10.1145\/1926385.1926449"},{"key":"1_CR28","unstructured":"Pouchet, L.N., Bondhugula, U., Bastoul, C., Cohen, A., Ramanujam, R., Sadayappan, P.: Hybrid iterative and model-driven optimization in the polyhedral model (2009)"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Rinard, M.: Probabilistic accuracy bounds for fault-tolerant computations that discard tasks. In: Proceedings of ICS (2006)","DOI":"10.1145\/1183401.1183447"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Samadi, M., Jamshidi, D.A., Lee, J., Mahlke, S.: Paraprox: pattern-based approximation for data parallel applications. In: Proceedings of ASPLOS (2014)","DOI":"10.1145\/2541940.2541948"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Sampson, A., Dietl, W., Fortuna, E., Gnanapragasam, D., Ceze, L., Grossman, D.: Enerj: approximate data types for safe and general low-power computation. In: Proceedings of PLDI (2011)","DOI":"10.1145\/1993498.1993518"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Schmitt, M., Helluy, P., Bastoul, C.: Automatic adaptive approximation for stencil computations. In: Proceedings of CC (2019)","DOI":"10.1145\/3302516.3307348"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Sidiroglou-Douskos, S., Misailovic, S., Hoffmann, H., Rinard, M.: Managing performance vs. accuracy trade-offs with loop perforation. In: Proceedings of ESEC (2011)","DOI":"10.1145\/2025113.2025133"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Udupa, A., Rajan, K., Thies, W.: ALTER: exploiting breakable dependences for parallelization. In: Proceedings of PLDI (2011)","DOI":"10.1145\/1993498.1993555"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Venkatagiri, R., Mahmoud, A., Hari, S.K.S., Adve, S.V.: Approxilyzer: Towards a systematic framework for instruction-level approximate computing and its application to hardware resiliency. In: Proceedings of MICRO (2016)","DOI":"10.1109\/MICRO.2016.7783745"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Verdoolaege, S., Carlos Juega, J., Cohen, A., Ignacio G\u00f3mez, J., Tenllado, C., Catthoor, F.: Polyhedral parallel code generation for CUDA. ACM TACO (2013)","DOI":"10.1145\/2400682.2400713"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2021: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85665-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T22:02:36Z","timestamp":1756332156000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85665-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030856649","9783030856656"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85665-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"1 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2021.euro-par.org\/","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 (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":"136","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":"38","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":"28% - 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":"4","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":"6","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}