{"id":"https://openalex.org/W2043355033","doi":"https://doi.org/10.1109/memcod.2014.6961865","title":"Symbolic inner loop parallelisation for massively parallel processor arrays","display_name":"Symbolic inner loop parallelisation for massively parallel processor arrays","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2043355033","doi":"https://doi.org/10.1109/memcod.2014.6961865","mag":"2043355033"},"language":"en","primary_location":{"id":"doi:10.1109/memcod.2014.6961865","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2014.6961865","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Twelfth ACM/IEEE 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, University of Erlangen-N\u00fcrnberg (FAU), Germany","Hardware/Software Co-Design, Department of Computer Science, University of Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Erlangen-N\u00fcrnberg (FAU), Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"Hardware/Software Co-Design, Department of Computer Science, University of 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, University of Erlangen-N\u00fcrnberg (FAU), Germany","Hardware/Software Co-Design, Department of Computer Science, University of Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Erlangen-N\u00fcrnberg (FAU), Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"Hardware/Software Co-Design, Department of Computer Science, University of 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, University of Erlangen-N\u00fcrnberg (FAU), Germany","Hardware/Software Co-Design, Department of Computer Science, University of Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Erlangen-N\u00fcrnberg (FAU), Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"Hardware/Software Co-Design, Department of Computer Science, University of 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, University of Erlangen-N\u00fcrnberg (FAU), Germany","Hardware/Software Co-Design, Department of Computer Science, University of Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Erlangen-N\u00fcrnberg (FAU), Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"Hardware/Software Co-Design, Department of Computer Science, University of 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":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"50","issue":null,"first_page":"219","last_page":"228"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9998000264167786,"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.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8612609505653381},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7996862530708313},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.7415769696235657},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7157917618751526},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6407012939453125},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5850421190261841},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5727649927139282},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5464996695518494},{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.4995455741882324},{"id":"https://openalex.org/keywords/loop-optimization","display_name":"Loop optimization","score":0.46881532669067383},{"id":"https://openalex.org/keywords/polytope-model","display_name":"Polytope model","score":0.4677310883998871},{"id":"https://openalex.org/keywords/loop-fusion","display_name":"Loop fusion","score":0.4414806365966797},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.42175206542015076},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.41920578479766846},{"id":"https://openalex.org/keywords/spmd","display_name":"SPMD","score":0.41853073239326477},{"id":"https://openalex.org/keywords/loop-unrolling","display_name":"Loop unrolling","score":0.4177040457725525},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.26404356956481934},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2173711061477661},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18676841259002686},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.12606766819953918},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10473516583442688}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8612609505653381},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7996862530708313},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.7415769696235657},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7157917618751526},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6407012939453125},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5850421190261841},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5727649927139282},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5464996695518494},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.4995455741882324},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.46881532669067383},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.4677310883998871},{"id":"https://openalex.org/C82653869","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fusion","level":3,"score":0.4414806365966797},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.42175206542015076},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.41920578479766846},{"id":"https://openalex.org/C7042729","wikidata":"https://www.wikidata.org/wiki/Q2289219","display_name":"SPMD","level":2,"score":0.41853073239326477},{"id":"https://openalex.org/C76970557","wikidata":"https://www.wikidata.org/wiki/Q1869750","display_name":"Loop unrolling","level":3,"score":0.4177040457725525},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.26404356956481934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2173711061477661},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18676841259002686},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12606766819953918},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10473516583442688},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/memcod.2014.6961865","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2014.6961865","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1664541497","https://openalex.org/W1667077121","https://openalex.org/W1716676420","https://openalex.org/W1916137642","https://openalex.org/W1970008223","https://openalex.org/W1970340536","https://openalex.org/W1995214251","https://openalex.org/W2025516544","https://openalex.org/W2038806034","https://openalex.org/W2054388411","https://openalex.org/W2087847273","https://openalex.org/W2097033573","https://openalex.org/W2114745971","https://openalex.org/W2122509350","https://openalex.org/W2146762876","https://openalex.org/W2155259509","https://openalex.org/W2157413058","https://openalex.org/W2162962390","https://openalex.org/W2164890169","https://openalex.org/W2165965906","https://openalex.org/W2170388723","https://openalex.org/W2407590628","https://openalex.org/W3203992401","https://openalex.org/W4239738628","https://openalex.org/W4297960249","https://openalex.org/W6642793095","https://openalex.org/W6683358811"],"related_works":["https://openalex.org/W4251798485","https://openalex.org/W2122418911","https://openalex.org/W2010414531","https://openalex.org/W3169195854","https://openalex.org/W2133860611","https://openalex.org/W1498734356","https://openalex.org/W2017719803","https://openalex.org/W2128467905","https://openalex.org/W2172073571","https://openalex.org/W3054224424"],"abstract_inverted_index":{"This":[0,35],"paper":[1],"presents":[2],"a":[3,13,54,94,113,154],"first":[4,102],"solution":[5],"to":[6,85],"the":[7,27,40,48,65,71,75,104,118,130,133,146,149,158,170,186],"unsolved":[8],"problem":[9,72,202],"of":[10,42,57,70,74,106,117,132,148,199],"symbolically":[11],"scheduling":[12],"given":[14],"loop":[15,23,43,77,119],"nest":[16],"with":[17],"uniform":[18],"data":[19],"dependences":[20],"using":[21],"inner":[22],"parallelization,":[24],"in":[25,39],"particular,":[26],"locally":[28],"parallel,":[29],"globally":[30],"sequential":[31],"(LPGS)":[32],"mapping":[33],"technique.":[34],"technique":[36],"is":[37,83,163],"needed":[38],"case":[41],"program":[44],"specifications":[45],"for":[46,112,128,195],"which":[47],"iterations":[49],"shall":[50],"be":[51],"scheduled":[52],"on":[53,169],"processor":[55,150,171],"array":[56,151,200],"unknown":[58],"size":[59,73,147],"at":[60],"compile":[61,99],"time":[62],"while":[63,184],"keeping":[64],"local":[66],"memory":[67],"consumption":[68],"independent":[69],"mapped":[76],"nest.":[78,120],"We":[79],"show":[80],"that":[81,162],"it":[82],"possible":[84,197],"derive":[86],"such":[87],"parameterized":[88,126],"LPGS":[89],"schedules":[90],"statically":[91],"by":[92],"proposing":[93],"mixed":[95],"compile-/runtime":[96],"approach:":[97],"At":[98,143],"time,":[100],"we":[101,122],"determine":[103],"set":[105],"all":[107],"schedule":[108,140,161,194],"candidates,":[109],"each":[110,139,196],"latency-optimal":[111,160],"different":[114],"scanning":[115],"order":[116],"Then":[121],"devise":[123],"an":[124,191],"exact":[125],"formula":[127],"determining":[129],"latency":[131],"resulting":[134],"symbolic":[135],"schedules,":[136],"thus":[137],"making":[138],"fully":[141],"predictable.":[142],"runtime,":[144],"once":[145],"becomes":[152],"known,":[153],"simple":[155],"prolog":[156],"selects":[157],"overall":[159],"then":[164],"dynamically":[165],"activated":[166],"and":[167,181,201],"executed":[168],"array.":[172],"Hence,":[173],"our":[174],"approach":[175],"avoids":[176],"any":[177],"further":[178],"runtime":[179],"optimization":[180],"expensive":[182],"re-compilations":[183],"achieving":[185],"same":[187],"results":[188],"as":[189],"computing":[190],"optimal":[192],"static":[193],"combination":[198],"size.":[203]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}