{"id":"https://openalex.org/W2565417786","doi":"https://doi.org/10.1109/memcod.2016.7797759","title":"Optimal compilation for exposed datapath architectures with buffered processing units by SAT solvers","display_name":"Optimal compilation for exposed datapath architectures with buffered processing units by SAT solvers","publication_year":2016,"publication_date":"2016-11-01","ids":{"openalex":"https://openalex.org/W2565417786","doi":"https://doi.org/10.1109/memcod.2016.7797759","mag":"2565417786"},"language":"en","primary_location":{"id":"doi:10.1109/memcod.2016.7797759","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2016.7797759","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","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/A5062452614","display_name":"Anoop Bhagyanath","orcid":"https://orcid.org/0000-0001-7866-5983"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Anoop Bhagyanath","raw_affiliation_strings":["Department of Computer Science, University of Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081184867","display_name":"Klaus Schneider","orcid":"https://orcid.org/0000-0002-1305-7132"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus Schneider","raw_affiliation_strings":["Department of Computer Science, University of Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062452614"],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":null,"apc_paid":null,"fwci":1.892,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.85875494,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"143","last_page":"152"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization 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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization 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/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.9997000098228455,"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.8705060482025146},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7440481781959534},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7127069234848022},{"id":"https://openalex.org/keywords/datapath","display_name":"Datapath","score":0.6846323013305664},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.6472736597061157},{"id":"https://openalex.org/keywords/instruction-level-parallelism","display_name":"Instruction-level parallelism","score":0.5864328742027283},{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.5842959880828857},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.509980320930481},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5059379935264587},{"id":"https://openalex.org/keywords/register-allocation","display_name":"Register allocation","score":0.43688714504241943},{"id":"https://openalex.org/keywords/register-file","display_name":"Register file","score":0.42743080854415894},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4100536108016968},{"id":"https://openalex.org/keywords/instruction-set","display_name":"Instruction set","score":0.3689624071121216},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.3195847272872925},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2640545070171356},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.2627171576023102},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09397232532501221}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8705060482025146},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7440481781959534},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7127069234848022},{"id":"https://openalex.org/C2781198647","wikidata":"https://www.wikidata.org/wiki/Q1633673","display_name":"Datapath","level":2,"score":0.6846323013305664},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.6472736597061157},{"id":"https://openalex.org/C140763907","wikidata":"https://www.wikidata.org/wiki/Q2714055","display_name":"Instruction-level parallelism","level":3,"score":0.5864328742027283},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.5842959880828857},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.509980320930481},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5059379935264587},{"id":"https://openalex.org/C128916667","wikidata":"https://www.wikidata.org/wiki/Q1343660","display_name":"Register allocation","level":3,"score":0.43688714504241943},{"id":"https://openalex.org/C117280010","wikidata":"https://www.wikidata.org/wiki/Q180944","display_name":"Register file","level":3,"score":0.42743080854415894},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4100536108016968},{"id":"https://openalex.org/C202491316","wikidata":"https://www.wikidata.org/wiki/Q272683","display_name":"Instruction set","level":2,"score":0.3689624071121216},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3195847272872925},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2640545070171356},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.2627171576023102},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09397232532501221},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/memcod.2016.7797759","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2016.7797759","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 ACM/IEEE International Conference on Formal Methods and Models for System Design (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":35,"referenced_works":["https://openalex.org/W90084074","https://openalex.org/W377831452","https://openalex.org/W1506585561","https://openalex.org/W1579041286","https://openalex.org/W2017503457","https://openalex.org/W2024598204","https://openalex.org/W2025301734","https://openalex.org/W2029601347","https://openalex.org/W2046793036","https://openalex.org/W2057361103","https://openalex.org/W2080859692","https://openalex.org/W2099220296","https://openalex.org/W2101431901","https://openalex.org/W2102481384","https://openalex.org/W2105555051","https://openalex.org/W2108367172","https://openalex.org/W2123412205","https://openalex.org/W2129192659","https://openalex.org/W2129962996","https://openalex.org/W2142501475","https://openalex.org/W2147345262","https://openalex.org/W2153882047","https://openalex.org/W2155649074","https://openalex.org/W2157758640","https://openalex.org/W2159742171","https://openalex.org/W2170585292","https://openalex.org/W2171732229","https://openalex.org/W2399145680","https://openalex.org/W2611258316","https://openalex.org/W3140103903","https://openalex.org/W4232919122","https://openalex.org/W4235146393","https://openalex.org/W4235875145","https://openalex.org/W4242368470","https://openalex.org/W6654834059"],"related_works":["https://openalex.org/W2111377238","https://openalex.org/W1967889241","https://openalex.org/W2115178757","https://openalex.org/W2094874787","https://openalex.org/W3022691489","https://openalex.org/W3013048777","https://openalex.org/W2142891960","https://openalex.org/W2154968082","https://openalex.org/W4241759337","https://openalex.org/W4214554355"],"abstract_inverted_index":{"Conventional":[0],"processor":[1,25],"architectures":[2,26,70],"are":[3,105],"restricted":[4],"in":[5,19,232],"exploiting":[6],"instruction":[7,21],"level":[8],"parallelism":[9],"(ILP)":[10],"due":[11],"to":[12,38,131,139,158,175,190,199,221],"the":[13,32,53,60,78,81,84,134,141,147,171,185,207,223],"limited":[14],"number":[15,209],"of":[16,45,55,83,136,143,210,225],"available":[17],"registers":[18,56],"their":[20,28,113],"sets.":[22],"Therefore,":[23],"recent":[24],"expose":[27],"datapaths":[29],"so":[30],"that":[31,204,227],"compiler":[33,62,172],"not":[34,154],"only":[35],"schedules":[36],"instructions":[37],"functional":[39,50],"units,":[40],"but":[41],"also":[42],"takes":[43],"care":[44],"directly":[46],"moving":[47],"values":[48],"between":[49],"units":[51,103],"avoiding":[52],"need":[54],"at":[57,112],"all.":[58],"However,":[59,146],"current":[61],"technology":[63],"is":[64,77,95,153],"still":[65],"based":[66],"on":[67],"classic":[68,128],"register":[69,75],"where":[71,101],"a":[72,96,191,219],"nearly":[73],"optimal":[74,155,214],"mapping":[76],"key":[79],"for":[80,119,127],"quality":[82,224],"generated":[85,150,213],"assembly":[86],"code.":[87],"The":[88,212],"Synchronous":[89],"Control":[90],"Asynchronous":[91],"Dataflow":[92],"(SCAD)":[93],"architecture":[94,100],"new":[97],"exposed":[98],"datapath":[99],"processing":[102],"(PUs)":[104],"equipped":[106],"with":[107,206],"first-in":[108],"first-out":[109],"(FIFO)":[110],"buffers":[111,168],"inputs":[114],"and":[115,138,167,194],"outputs.":[116],"Code":[117],"generation":[118,188],"SCAD":[120,148,161,186,233],"machines":[121,130,162],"can":[122,163],"be":[123,229],"done":[124],"as":[125,218],"known":[126],"queue":[129,159],"completely":[132],"eliminate":[133],"use":[135,196],"registers,":[137],"improve":[140],"degree":[142],"exploited":[144],"ILP.":[145],"code":[149,187,201,215],"this":[151,181],"way":[152],"since":[156],"compared":[157],"machines,":[160],"contain":[164],"many":[165],"PUs":[166],"which":[169],"offers":[170],"more":[173],"freedom":[174],"reduce":[176],"unnecessary":[177],"computational":[178],"overhead.":[179],"In":[180],"paper,":[182],"we":[183],"map":[184],"problem":[189],"satisfiability":[192],"problem,":[193],"then":[195],"SAT":[197],"solvers":[198],"generate":[200],"without":[202],"overhead":[203],"works":[205],"minimal":[208],"PUs.":[211],"will":[216,228],"serve":[217],"reference":[220],"judge":[222],"heuristics":[226],"finally":[230],"used":[231],"compilers.":[234]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}