{"id":"https://openalex.org/W2775543260","doi":"https://doi.org/10.1145/3092952","title":"Symbolic Multi-Level Loop Mapping of Loop Programs for Massively Parallel Processor Arrays","display_name":"Symbolic Multi-Level Loop Mapping of Loop Programs for Massively Parallel Processor Arrays","publication_year":2017,"publication_date":"2017-12-07","ids":{"openalex":"https://openalex.org/W2775543260","doi":"https://doi.org/10.1145/3092952","mag":"2775543260"},"language":"en","primary_location":{"id":"doi:10.1145/3092952","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3092952","pdf_url":null,"source":{"id":"https://openalex.org/S136160450","display_name":"ACM Transactions on Embedded Computing Systems","issn_l":"1539-9087","issn":["1539-9087","1558-3465"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Embedded Computing Systems","raw_type":"journal-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/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, Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hardware/Software Co-Design, Department of Computer Science, Friedrich-Alexander-Universit\u00e4t 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":["Hardware/Software Co-Design, Department of Computer Science, Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hardware/Software Co-Design, Department of Computer Science, Friedrich-Alexander-Universit\u00e4t 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":"J\u00fcrgen Teich","raw_affiliation_strings":["Hardware/Software Co-Design, Department of Computer Science, Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hardware/Software Co-Design, Department of Computer Science, Friedrich-Alexander-Universit\u00e4t 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":["Hardware/Software Co-Design, Department of Computer Science, Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hardware/Software Co-Design, Department of Computer Science, Friedrich-Alexander-Universit\u00e4t 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":1.1185,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.80231019,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"17","issue":"2","first_page":"1","last_page":"27"},"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.9998999834060669,"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.9995999932289124,"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.8874849081039429},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.8369743824005127},{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.6998136639595032},{"id":"https://openalex.org/keywords/loop-tiling","display_name":"Loop tiling","score":0.5913082361221313},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.5521051287651062},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5484316349029541},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.5362752079963684},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5146806836128235},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.4502262473106384},{"id":"https://openalex.org/keywords/loop-fusion","display_name":"Loop fusion","score":0.4482552707195282},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4382965564727783},{"id":"https://openalex.org/keywords/loop-fission","display_name":"Loop fission","score":0.4171029031276703},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.33464616537094116},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08697870373725891}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8874849081039429},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.8369743824005127},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.6998136639595032},{"id":"https://openalex.org/C11799548","wikidata":"https://www.wikidata.org/wiki/Q6675847","display_name":"Loop tiling","level":3,"score":0.5913082361221313},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.5521051287651062},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5484316349029541},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.5362752079963684},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5146806836128235},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.4502262473106384},{"id":"https://openalex.org/C82653869","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fusion","level":3,"score":0.4482552707195282},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4382965564727783},{"id":"https://openalex.org/C134718785","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fission","level":3,"score":0.4171029031276703},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.33464616537094116},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08697870373725891},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3092952","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3092952","pdf_url":null,"source":{"id":"https://openalex.org/S136160450","display_name":"ACM Transactions on Embedded Computing Systems","issn_l":"1539-9087","issn":["1539-9087","1558-3465"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Embedded Computing Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W68686056","https://openalex.org/W568798901","https://openalex.org/W1664541497","https://openalex.org/W1667077121","https://openalex.org/W1716676420","https://openalex.org/W1836544786","https://openalex.org/W1967414258","https://openalex.org/W1970340536","https://openalex.org/W1974420955","https://openalex.org/W1989761046","https://openalex.org/W1995214251","https://openalex.org/W2043340768","https://openalex.org/W2043355033","https://openalex.org/W2087847273","https://openalex.org/W2097033573","https://openalex.org/W2100402679","https://openalex.org/W2107166246","https://openalex.org/W2108059043","https://openalex.org/W2112391112","https://openalex.org/W2122509350","https://openalex.org/W2123286830","https://openalex.org/W2126464777","https://openalex.org/W2146762876","https://openalex.org/W2149380059","https://openalex.org/W2158958889","https://openalex.org/W2162962390","https://openalex.org/W2170388723","https://openalex.org/W4297960249"],"related_works":["https://openalex.org/W2342605656","https://openalex.org/W2040522199","https://openalex.org/W2058764256","https://openalex.org/W154155438","https://openalex.org/W1596526459","https://openalex.org/W1508919682","https://openalex.org/W2109246102","https://openalex.org/W1532159642","https://openalex.org/W2340721088","https://openalex.org/W2062111218"],"abstract_inverted_index":{"Today\u2019s":[0],"MPSoCs":[1],"(multiprocessor":[2],"systems-on-chip)":[3],"have":[4],"brought":[5],"up":[6],"massively":[7,49],"parallel":[8,30,50,176],"processor":[9,31],"array":[10],"accelerators":[11],"that":[12,109,272,342],"may":[13,343],"achieve":[14],"a":[15,102,201,258,262,348],"high":[16],"computational":[17],"efficiency":[18],"by":[19,100,166,190],"exploiting":[20],"multiple":[21,62,115,308],"levels":[22,63,116,173,179,309],"of":[23,40,64,77,97,117,135,144,157,180,194,233,253,287,310,314,318],"parallelism":[24,65,118],"and":[25,48,66,126,207,227,269,322,337],"different":[26,123,178,186],"memory":[27,71,124,133,187,208,270],"hierarchies.":[28,188],"Such":[29],"arrays":[32],"are":[33,57,67,219],"perfect":[34],"targets,":[35],"particularly":[36,332],"for":[37,139,275,334],"the":[38,75,130,136,142,183,192,195,198,204,224,231,251,276,285,315,319],"acceleration":[39],"nested":[41],"loop":[42,54,291,320],"programs":[43],"due":[44],"to":[45,60,128,223,236,242,267,346],"their":[46],"regular":[47],"nature.":[51],"However,":[52],"existing":[53],"parallelization":[55,107],"techniques":[56],"often":[58],"unable":[59],"exploit":[61,114,177],"either":[68],"I/O":[69,131,268],"or":[70,132],"bounded.":[72],"Furthermore,":[73,189],"if":[74],"number":[76,143,232,252],"available":[78,145,254],"processing":[79,146,234],"elements":[80,147,235],"becomes":[81,256],"only":[82,149],"known":[83,150,244],"at":[84,151,245,294,303,328],"runtime\u2014as":[85],"in":[86,175],"adaptive":[87],"systems\u2014static":[88],"approaches":[89],"fail.":[90],"In":[91,280],"this":[92],"article,":[93],"we":[94],"solve":[95],"some":[96],"these":[98],"problems":[99],"proposing":[101],"hybrid":[103],"compile/runtime":[104],"multi-level":[105,169],"symbolic":[106,162,168,220,290],"technique":[108,155],"is":[110,148,209,273,300,312,331],"able":[111],"to:":[112],"(a)":[113,161],"as":[119,121],"well":[120],"(b)":[122,167],"hierarchies,":[125],"(c)":[127],"match":[129],"capabilities":[134],"target":[137],"architecture":[138],"scenarios":[140],"where":[141],"runtime.":[152,304,329],"Our":[153],"proposed":[154],"consists":[156],"two":[158],"compile-time":[159],"transformations:":[160],"hierarchical":[163],"tiling":[164,172],"followed":[165],"scheduling.":[170],"The":[171,216],"scheduled":[174],"parallelism,":[181,311],"whereas":[182],"sequential":[184],"one,":[185],"tuning":[191],"size":[193,226,317],"tiles":[196],"on":[197],"individual":[199],"levels,":[200],"tradeoff":[202],"between":[203],"necessary":[205],"I/O-bandwidth":[206],"possible,":[210],"which":[211,298],"facilitates":[212],"obeying":[213],"resource":[214],"constraints.":[215],"resulting":[217],"schedules":[218],"with":[221,265],"respect":[222,266],"problem":[225,316],"tile":[228,278],"sizes.":[229],"Thus,":[230],"map":[237],"onto":[238],"does":[239],"not":[240,344],"need":[241],"be":[243],"compile":[246,295],"time.":[247],"At":[248],"runtime,":[249],"when":[250],"processors":[255],"known,":[257],"simple":[259],"prologue":[260],"chooses":[261],"feasible":[263],"schedule":[264,292],"constraints":[271],"latency-optimal":[274,289],"chosen":[277],"size.":[279],"summary,":[281],"our":[282],"approach":[283,306],"determines":[284],"set":[286],"feasible,":[288],"candidates":[293],"time,":[296],"from":[297],"one":[299],"dynamically":[301],"selected":[302],"This":[305,330],"exploits":[307],"independent":[313],"nest,":[321],"thereby":[323],"avoids":[324],"any":[325],"expensive":[326],"re-compilation":[327],"important":[333],"low":[335],"cost":[336],"memory-scarce":[338],"embedded":[339],"MPSoC":[340],"platforms":[341],"afford":[345],"host":[347],"just-in-time":[349],"compiler.":[350]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}