{"id":"https://openalex.org/W2080852813","doi":"https://doi.org/10.1145/2536747.2536750","title":"Automated generation of polyhedral process networks from affine nested-loop programs with dynamic loop bounds","display_name":"Automated generation of polyhedral process networks from affine nested-loop programs with dynamic loop bounds","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W2080852813","doi":"https://doi.org/10.1145/2536747.2536750","mag":"2080852813"},"language":"en","primary_location":{"id":"doi:10.1145/2536747.2536750","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2536747.2536750","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/A5076687616","display_name":"Dmitry Nadezhkin","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dmitry Nadezhkin","raw_affiliation_strings":["Leiden Institute of Advanced Computer Science, Leiden, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Leiden Institute of Advanced Computer Science, Leiden, The Netherlands","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084996361","display_name":"Hristo N. Nikolov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hristo Nikolov","raw_affiliation_strings":["Leiden Institute of Advanced Computer Science, Leiden, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Leiden Institute of Advanced Computer Science, Leiden, The Netherlands","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024603788","display_name":"Todor Stefanov","orcid":"https://orcid.org/0000-0001-6006-9366"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Todor Stefanov","raw_affiliation_strings":["Leiden Institute of Advanced Computer Science, Leiden, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Leiden Institute of Advanced Computer Science, Leiden, The Netherlands","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076687616"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.14005168,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"13","issue":"1s","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9997000098228455,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9997000098228455,"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/T10933","display_name":"Real-Time Systems Scheduling","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"}},{"id":"https://openalex.org/T11005","display_name":"Radiation Effects in Electronics","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9174096584320068},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.8528069853782654},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.6828757524490356},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6357415914535522},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5724844932556152},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5385220646858215},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.5089437961578369},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45587652921676636},{"id":"https://openalex.org/keywords/polytope-model","display_name":"Polytope model","score":0.43489134311676025},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3605939447879791},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.3262251317501068},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19226208329200745}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9174096584320068},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.8528069853782654},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.6828757524490356},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6357415914535522},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5724844932556152},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5385220646858215},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5089437961578369},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45587652921676636},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.43489134311676025},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3605939447879791},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3262251317501068},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19226208329200745},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"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/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2536747.2536750","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2536747.2536750","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":23,"referenced_works":["https://openalex.org/W136360891","https://openalex.org/W1486623318","https://openalex.org/W1597755753","https://openalex.org/W1598202309","https://openalex.org/W1965822686","https://openalex.org/W1974386461","https://openalex.org/W1976397984","https://openalex.org/W2078738604","https://openalex.org/W2090347009","https://openalex.org/W2101105147","https://openalex.org/W2101631461","https://openalex.org/W2108662993","https://openalex.org/W2114758860","https://openalex.org/W2120235301","https://openalex.org/W2130219663","https://openalex.org/W2155632873","https://openalex.org/W2160337655","https://openalex.org/W2160737725","https://openalex.org/W2161242733","https://openalex.org/W2340604309","https://openalex.org/W2575267709","https://openalex.org/W3003763846","https://openalex.org/W6635964534"],"related_works":["https://openalex.org/W4295539146","https://openalex.org/W2034761517","https://openalex.org/W2080027614","https://openalex.org/W3151489216","https://openalex.org/W2019530905","https://openalex.org/W2166906890","https://openalex.org/W2091452063","https://openalex.org/W2727330431","https://openalex.org/W1558370006","https://openalex.org/W2482108951"],"abstract_inverted_index":{"The":[0,157,207],"Process":[1,62,183],"Networks":[2,63],"(PNs)":[3],"is":[4,39,163],"a":[5,19,36,40,164,189,217,222],"suitable":[6],"parallel":[7,20,28,37,65,219,258],"model":[8],"of":[9,122,125,147,160,170,260,286],"computation":[10],"(MoC)":[11],"used":[12,231],"to":[13,104,132,137],"specify":[14],"embedded":[15,27],"streaming":[16],"applications":[17,83,148],"in":[18,102,109,153,197,232,253,278,289],"form":[21],"facilitating":[22],"the":[23,49,55,114,123,126,130,145,193,198,233,239,249,274,284],"efficient":[24,257,291],"mapping":[25],"onto":[26],"execution":[29,194],"platforms.":[30],"Unfortunately,":[31],"specifying":[32],"an":[33,154,290],"application":[34,224],"using":[35],"MoC":[38],"very":[41],"difficult":[42],"and":[43,92,136],"highly":[44],"error-prone":[45],"task.":[46],"To":[47],"overcome":[48],"associated":[50],"difficulties,":[51],"we":[52,112,118,187,242,251],"have":[53,90,243],"developed":[54],"pn":[56],"compiler,":[57],"which":[58,95,246,281],"derives":[59],"specific":[60],"Polyhedral":[61,182],"(PPN)":[64],"specifications":[66],"from":[67,201,221],"sequential":[68,261],"static":[69],"affine":[70,171],"nested":[71,172,262],"loop":[72,173,177,205,263,267],"programs":[73,174,202,264],"(SANLPs).":[74],"However,":[75],"there":[76],"are":[77],"many":[78],"applications,":[79,108,280],"for":[80,167,191,283],"example,":[81],"multimedia":[82,107],"(MPEG":[84],"coders/decoders,":[85],"smart":[86,234],"cameras,":[87],"etc.)":[88],"that":[89,149,248],"adaptive":[91],"dynamic":[93,106,176,204,266],"behavior":[94],"cannot":[96],"be":[97,151],"expressed":[98],"as":[99],"SANLPs.":[100],"Therefore,":[101],"order":[103],"handle":[105],"this":[110,141,161,254],"article":[111,162,255],"address":[113],"important":[115],"question":[116],"whether":[117],"can":[119,150],"relax":[120],"some":[121],"restrictions":[124],"SANLPs":[127],"while":[128],"keeping":[129],"ability":[131],"perform":[133],"compile-time":[134],"analysis":[135],"derive":[138],"PPNs.":[139],"Achieving":[140],"would":[142],"significantly":[143],"extend":[144],"range":[146],"parallelized":[152],"automated":[155,168,209],"way.":[156,292],"main":[158],"contribution":[159],"first":[165],"approach":[166,211,250,272],"translation":[169,210],"with":[175,203,265],"bounds":[178],"into":[179],"input-output":[180],"equivalent":[181],"Networks.":[184],"In":[185],"addition,":[186],"present":[188,252],"method":[190],"analyzing":[192],"overhead":[195],"introduced":[196],"PPNs":[199],"derived":[200,240],"bounds.":[206,268],"presented":[208],"has":[212],"been":[213],"evaluated":[214],"by":[215],"deriving":[216],"PPN":[218],"specification":[220],"real-life":[223],"called":[225],"Low":[226],"Speed":[227],"Obstacle":[228],"Detection":[229],"(LSOD)":[230],"cameras":[235],"domain.":[236],"By":[237],"executing":[238],"PPN,":[241],"obtained":[244],"results":[245],"indicate":[247],"facilitates":[256],"implementations":[259],"That":[269],"is,":[270],"our":[271],"reveals":[273],"possible":[275],"parallelism":[276],"available":[277],"such":[279],"allows":[282],"utilization":[285],"multiple":[287],"cores":[288]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}