{"id":"https://openalex.org/W2184722600","doi":"https://doi.org/10.1109/memcod.2015.7340486","title":"Symbolic loop parallelization for balancing I/O and memory accesses on processor arrays","display_name":"Symbolic loop parallelization for balancing I/O and memory accesses on processor arrays","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2184722600","doi":"https://doi.org/10.1109/memcod.2015.7340486","mag":"2184722600"},"language":"en","primary_location":{"id":"doi:10.1109/memcod.2015.7340486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2015.7340486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058525738","display_name":"Alexandru Tanase","orcid":null},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexandru Tanase","raw_affiliation_strings":["Department of computer Science, Friedrich-Alexander-Universitat Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of computer Science, Friedrich-Alexander-Universitat Erlangen-N\u00fcrnberg (FAU), Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044199643","display_name":"Michael Witterauf","orcid":null},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Witterauf","raw_affiliation_strings":["Department of computer Science, Friedrich-Alexander-Universitat Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of computer Science, Friedrich-Alexander-Universitat Erlangen-N\u00fcrnberg (FAU), Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076672029","display_name":"J\u00fcrgen Teich","orcid":"https://orcid.org/0000-0001-6285-5862"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jurgen Teich","raw_affiliation_strings":["Department of computer Science, Friedrich-Alexander-Universitat Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of computer Science, Friedrich-Alexander-Universitat Erlangen-N\u00fcrnberg (FAU), Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072039340","display_name":"Frank Hannig","orcid":"https://orcid.org/0000-0003-3663-6484"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frank Hannig","raw_affiliation_strings":["Department of computer Science, Friedrich-Alexander-Universitat Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of computer Science, Friedrich-Alexander-Universitat Erlangen-N\u00fcrnberg (FAU), Germany","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I181369854"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"188","last_page":"197"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.8514916896820068},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8512905836105347},{"id":"https://openalex.org/keywords/loop-tiling","display_name":"Loop tiling","score":0.7520742416381836},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.6864371299743652},{"id":"https://openalex.org/keywords/cas-latency","display_name":"CAS latency","score":0.6172754168510437},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5850986242294312},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5409446954727173},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.500560998916626},{"id":"https://openalex.org/keywords/polytope-model","display_name":"Polytope model","score":0.47275692224502563},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.41575825214385986},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1811048984527588},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.15685689449310303},{"id":"https://openalex.org/keywords/memory-controller","display_name":"Memory controller","score":0.10364490747451782},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08757531642913818}],"concepts":[{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.8514916896820068},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8512905836105347},{"id":"https://openalex.org/C11799548","wikidata":"https://www.wikidata.org/wiki/Q6675847","display_name":"Loop tiling","level":3,"score":0.7520742416381836},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.6864371299743652},{"id":"https://openalex.org/C189930140","wikidata":"https://www.wikidata.org/wiki/Q1112878","display_name":"CAS latency","level":4,"score":0.6172754168510437},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5850986242294312},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5409446954727173},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.500560998916626},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.47275692224502563},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.41575825214385986},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1811048984527588},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.15685689449310303},{"id":"https://openalex.org/C100800780","wikidata":"https://www.wikidata.org/wiki/Q1175867","display_name":"Memory controller","level":3,"score":0.10364490747451782},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08757531642913818},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.0},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C98986596","wikidata":"https://www.wikidata.org/wiki/Q1143031","display_name":"Semiconductor memory","level":2,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/memcod.2015.7340486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2015.7340486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1664541497","https://openalex.org/W1667077121","https://openalex.org/W1836544786","https://openalex.org/W1967414258","https://openalex.org/W1970340536","https://openalex.org/W2043355033","https://openalex.org/W2087847273","https://openalex.org/W2097033573","https://openalex.org/W2107166246","https://openalex.org/W2112391112","https://openalex.org/W2122509350","https://openalex.org/W2123286830","https://openalex.org/W2126464777","https://openalex.org/W2149668662","https://openalex.org/W2153331583","https://openalex.org/W2157413058","https://openalex.org/W2158958889","https://openalex.org/W2162962390","https://openalex.org/W4245874061","https://openalex.org/W4297960249","https://openalex.org/W6638581962","https://openalex.org/W6683358811"],"related_works":["https://openalex.org/W2371266106","https://openalex.org/W2117382851","https://openalex.org/W3006505070","https://openalex.org/W2382449560","https://openalex.org/W2767298477","https://openalex.org/W2110432562","https://openalex.org/W2117864619","https://openalex.org/W2184722600","https://openalex.org/W2623604894","https://openalex.org/W4231661959"],"abstract_inverted_index":{"Loop":[0],"parallelization":[1],"techniques":[2],"for":[3,162],"massively":[4],"parallel":[5],"processor":[6],"arrays":[7],"using":[8],"one-level":[9],"tiling":[10,76],"are":[11,71,111],"often":[12],"either":[13],"I/O-":[14],"or":[15],"memory-bounded,":[16],"exceeding":[17],"the":[18,24,85,88,96,116,121,141,163],"target":[19],"architecture's":[20],"capabilities.":[21],"Furthermore,":[22],"if":[23],"number":[25,117,122,142],"of":[26,87,118,123],"available":[27],"processing":[28,124],"elements":[29,125],"is":[30,101,143,160],"only":[31],"known":[32,134],"at":[33,135],"runtime":[34],"-":[35,40],"as":[36],"in":[37],"adaptive":[38],"systems":[39],"static":[41],"approaches":[42],"fail.":[43],"To":[44],"solve":[45],"these":[46],"problems,":[47],"we":[48],"present":[49],"a":[50,93,145,149],"hybrid":[51],"compile/runtime":[52],"technique":[53],"to":[54,115,126,132,154],"symbolically":[55],"parallelize":[56],"loop":[57],"nests":[58],"with":[59,113,152],"uniform":[60],"dependences":[61],"on":[62,90],"multiple":[63,91],"levels.":[64],"At":[65,138],"compile":[66,136],"time,":[67],"two":[68],"novel":[69],"transformations":[70],"performed:":[72],"(a)":[73],"symbolic":[74,80,112],"hierarchical":[75],"followed":[77],"by":[78],"(b)":[79],"multi-level":[81],"scheduling.":[82],"By":[83],"tuning":[84],"size":[86],"tiles":[89],"levels,":[92],"trade-off":[94],"between":[95],"necessary":[97],"I/O-bandwidth":[98],"and":[99,156,175],"memory":[100,157],"possible,":[102],"which":[103],"facilitates":[104],"obeying":[105],"resource":[106],"constraints.":[107],"The":[108],"resulting":[109],"schedules":[110,177],"respect":[114,153],"tiles;":[119],"thus,":[120],"map":[127],"onto":[128],"does":[129],"not":[130],"need":[131],"be":[133],"time.":[137],"runtime,":[139],"when":[140],"known,":[144],"simple":[146],"prolog":[147],"chooses":[148,173],"feasible":[150,176],"schedule":[151],"I/O":[155],"constraints":[158],"that":[159],"latency-optimal":[161,174],"chosen":[164],"tile":[165],"size.":[166],"In":[167],"this":[168],"way,":[169],"our":[170],"approach":[171],"dynamically":[172],"while":[178],"avoiding":[179],"expensive":[180],"re-compilations.":[181]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}