{"id":"https://openalex.org/W1995214251","doi":"https://doi.org/10.1109/asap.2013.6567543","title":"Symbolic parallelization of loop programs for massively parallel processor arrays","display_name":"Symbolic parallelization of loop programs for massively parallel processor arrays","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W1995214251","doi":"https://doi.org/10.1109/asap.2013.6567543","mag":"1995214251"},"language":"en","primary_location":{"id":"doi:10.1109/asap.2013.6567543","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asap.2013.6567543","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 24th International Conference on Application-Specific Systems, Architectures and Processors","raw_type":"proceedings-article"},"type":"article","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/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":true,"raw_author_name":"Jurgen Teich","raw_affiliation_strings":["Hardware, Software Co-Design, Department of Computer Science, University of Erlangen-Nuremberg, Germany","Department of Computer Science, University of Erlangen-Nuremberg, Erlangen, Germany"],"affiliations":[{"raw_affiliation_string":"Hardware, Software Co-Design, Department of Computer Science, University of Erlangen-Nuremberg, Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"Department of Computer Science, University of Erlangen-Nuremberg, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"middle","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":["Hardware, Software Co-Design, Department of Computer Science, University of Erlangen-Nuremberg, Germany","Department of Computer Science, University of Erlangen-Nuremberg, Erlangen, Germany"],"affiliations":[{"raw_affiliation_string":"Hardware, Software Co-Design, Department of Computer Science, University of Erlangen-Nuremberg, Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"Department of Computer Science, University of Erlangen-Nuremberg, Erlangen, 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":["Hardware, Software Co-Design, Department of Computer Science, University of Erlangen-Nuremberg, Germany","Department of Computer Science, University of Erlangen-Nuremberg, Erlangen, Germany"],"affiliations":[{"raw_affiliation_string":"Hardware, Software Co-Design, Department of Computer Science, University of Erlangen-Nuremberg, Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"Department of Computer Science, University of Erlangen-Nuremberg, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076672029"],"corresponding_institution_ids":["https://openalex.org/I181369854"],"apc_list":null,"apc_paid":null,"fwci":4.0978,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.93911258,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"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.9994999766349792,"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.9994000196456909,"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/computer-science","display_name":"Computer science","score":0.8353145122528076},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.781825065612793},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6194863319396973},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5520583987236023},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.5491330027580261},{"id":"https://openalex.org/keywords/loop-tiling","display_name":"Loop tiling","score":0.5436290502548218},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5367829203605652},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.4925864338874817},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4735502302646637},{"id":"https://openalex.org/keywords/loop-optimization","display_name":"Loop optimization","score":0.4509994387626648},{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.43953096866607666},{"id":"https://openalex.org/keywords/cas-latency","display_name":"CAS latency","score":0.428294837474823},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.4276786744594574},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.41777896881103516},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.3171864151954651},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2581655979156494},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24498993158340454},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16025575995445251},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13190364837646484},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11006256937980652},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0985795259475708}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8353145122528076},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.781825065612793},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6194863319396973},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5520583987236023},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.5491330027580261},{"id":"https://openalex.org/C11799548","wikidata":"https://www.wikidata.org/wiki/Q6675847","display_name":"Loop tiling","level":3,"score":0.5436290502548218},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5367829203605652},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.4925864338874817},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4735502302646637},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.4509994387626648},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.43953096866607666},{"id":"https://openalex.org/C189930140","wikidata":"https://www.wikidata.org/wiki/Q1112878","display_name":"CAS latency","level":4,"score":0.428294837474823},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.4276786744594574},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.41777896881103516},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.3171864151954651},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2581655979156494},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24498993158340454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16025575995445251},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13190364837646484},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11006256937980652},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0985795259475708},{"id":"https://openalex.org/C100800780","wikidata":"https://www.wikidata.org/wiki/Q1175867","display_name":"Memory controller","level":3,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/asap.2013.6567543","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asap.2013.6567543","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 24th International Conference on Application-Specific Systems, Architectures and Processors","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1503700136","https://openalex.org/W1530279678","https://openalex.org/W1667077121","https://openalex.org/W1716676420","https://openalex.org/W1967414258","https://openalex.org/W2025516544","https://openalex.org/W2034761517","https://openalex.org/W2091074029","https://openalex.org/W2109795715","https://openalex.org/W2112391112","https://openalex.org/W2114067856","https://openalex.org/W2122509350","https://openalex.org/W2123286830","https://openalex.org/W2146762876","https://openalex.org/W2157413058","https://openalex.org/W2158958889","https://openalex.org/W2162962390","https://openalex.org/W2164890169","https://openalex.org/W2170388723","https://openalex.org/W2296218291","https://openalex.org/W2402854315","https://openalex.org/W2407590628","https://openalex.org/W3151489216","https://openalex.org/W3203992401","https://openalex.org/W4255890223","https://openalex.org/W4297960249"],"related_works":["https://openalex.org/W2014071052","https://openalex.org/W1549990549","https://openalex.org/W3169195854","https://openalex.org/W2184722600","https://openalex.org/W2244841219","https://openalex.org/W2187123740","https://openalex.org/W2010414531","https://openalex.org/W1498734356","https://openalex.org/W4256622436","https://openalex.org/W1601646354"],"abstract_inverted_index":{"In":[0,68],"this":[1],"paper,":[2],"we":[3,50,92],"present":[4],"a":[5,17,41],"first":[6,70],"solution":[7],"to":[8,56,171],"the":[9,34,69,72,95,114,117,121,136,139,160,166],"unsolved":[10],"problem":[11,27],"of":[12,44,80,98,116,124,138,146,152],"joint":[13],"tiling":[14],"and":[15,159],"scheduling":[16],"given":[18],"loop":[19,30,118],"nest":[20],"with":[21],"uniform":[22],"data":[23],"dependencies":[24],"symbolically.":[25,90],"This":[26],"arises":[28],"for":[29,32],"programs":[31],"which":[33,151],"iterations":[35],"shall":[36],"be":[37,156],"optimally":[38],"scheduled":[39,89],"on":[40,165],"processor":[42,140,168],"array":[43,141,169],"unknown":[45],"size":[46,137],"at":[47],"compile-time.":[48],"Still,":[49],"show":[51,93],"that":[52,94],"it":[53],"is":[54,75,87,102,113],"possible":[55],"derive":[57],"parameterized":[58],"latencyoptimal":[59],"schedules":[60,101,154],"statically":[61],"by":[62,105],"proposing":[63],"two":[64],"new":[65],"program":[66,86,162],"transformations:":[67],"step,":[71],"iteration":[73],"space":[74],"tiled":[76,85],"symbolically":[77],"into":[78],"orthotopes":[79],"parametrized":[81],"extensions.":[82],"The":[83],"resulting":[84,167],"subsequently":[88],"Here,":[91],"maximal":[96],"number":[97,123],"potential":[99],"optimal":[100,125],"upper":[103],"bounded":[104],"2":[106],"<sup":[107],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[108],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[109],"n!":[110],"where":[111],"n":[112],"dimension":[115],"nest.":[119],"However,":[120],"real":[122],"schedule":[126],"candidates":[127],"being":[128],"much":[129],"less":[130],"than":[131],"this.":[132],"At":[133],"run-time,":[134],"once":[135],"becomes":[142],"known,":[143],"simple":[144],"comparisons":[145],"latency-determining":[147],"expressions":[148],"finally":[149],"steer":[150],"these":[153],"will":[155],"dynamically":[157],"activated":[158],"corresponding":[161],"configuration":[163],"executed":[164],"so":[170],"avoid":[172],"any":[173],"further":[174],"run-time":[175],"optimization":[176],"or":[177],"expensive":[178],"recompilations.":[179]},"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":7},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}