{"id":"https://openalex.org/W2739589328","doi":"https://doi.org/10.1109/asap.2017.7995282","title":"Efficiency in ILP processing by using orthogonality","display_name":"Efficiency in ILP processing by using orthogonality","publication_year":2017,"publication_date":"2017-07-01","ids":{"openalex":"https://openalex.org/W2739589328","doi":"https://doi.org/10.1109/asap.2017.7995282","mag":"2739589328"},"language":"en","primary_location":{"id":"doi:10.1109/asap.2017.7995282","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asap.2017.7995282","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 28th International Conference on Application-specific Systems, Architectures and Processors (ASAP)","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/A5064717414","display_name":"Marcel Brand","orcid":"https://orcid.org/0000-0002-4121-1651"},"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":"Marcel Brand","raw_affiliation_strings":["Department of Computer Science Friedrich-Alexander, University Erlangen-N\u00fcrnberg (FAU)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science Friedrich-Alexander, University Erlangen-N\u00fcrnberg (FAU)","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"middle","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 Friedrich-Alexander, University Erlangen-N\u00fcrnberg (FAU)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science Friedrich-Alexander, University Erlangen-N\u00fcrnberg (FAU)","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":["Department of Computer Science Friedrich-Alexander, University Erlangen-N\u00fcrnberg (FAU)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science Friedrich-Alexander, University Erlangen-N\u00fcrnberg (FAU)","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","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 Friedrich-Alexander, University Erlangen-N\u00fcrnberg (FAU)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science Friedrich-Alexander, University Erlangen-N\u00fcrnberg (FAU)","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":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"207","last_page":"207"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design 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/T10904","display_name":"Embedded Systems Design 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/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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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/very-long-instruction-word","display_name":"Very long instruction word","score":0.9283803701400757},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8736221790313721},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6906882524490356},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.630983829498291},{"id":"https://openalex.org/keywords/software-pipelining","display_name":"Software pipelining","score":0.6024335026741028},{"id":"https://openalex.org/keywords/register-allocation","display_name":"Register allocation","score":0.5585494637489319},{"id":"https://openalex.org/keywords/instruction-scheduling","display_name":"Instruction scheduling","score":0.5050626397132874},{"id":"https://openalex.org/keywords/register-file","display_name":"Register file","score":0.4923661947250366},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.4733338952064514},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4333607852458954},{"id":"https://openalex.org/keywords/instructions-per-cycle","display_name":"Instructions per cycle","score":0.4330945312976837},{"id":"https://openalex.org/keywords/instruction-set","display_name":"Instruction set","score":0.4318595826625824},{"id":"https://openalex.org/keywords/computer-architecture","display_name":"Computer architecture","score":0.41242778301239014},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.30621761083602905},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2699292302131653},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.21749621629714966},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.20769596099853516},{"id":"https://openalex.org/keywords/central-processing-unit","display_name":"Central processing unit","score":0.1818111538887024},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.10572749376296997}],"concepts":[{"id":"https://openalex.org/C170595534","wikidata":"https://www.wikidata.org/wiki/Q249743","display_name":"Very long instruction word","level":2,"score":0.9283803701400757},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8736221790313721},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6906882524490356},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.630983829498291},{"id":"https://openalex.org/C188854837","wikidata":"https://www.wikidata.org/wiki/Q268469","display_name":"Software pipelining","level":3,"score":0.6024335026741028},{"id":"https://openalex.org/C128916667","wikidata":"https://www.wikidata.org/wiki/Q1343660","display_name":"Register allocation","level":3,"score":0.5585494637489319},{"id":"https://openalex.org/C73564150","wikidata":"https://www.wikidata.org/wiki/Q11417093","display_name":"Instruction scheduling","level":5,"score":0.5050626397132874},{"id":"https://openalex.org/C117280010","wikidata":"https://www.wikidata.org/wiki/Q180944","display_name":"Register file","level":3,"score":0.4923661947250366},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.4733338952064514},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4333607852458954},{"id":"https://openalex.org/C156972235","wikidata":"https://www.wikidata.org/wiki/Q1443434","display_name":"Instructions per cycle","level":3,"score":0.4330945312976837},{"id":"https://openalex.org/C202491316","wikidata":"https://www.wikidata.org/wiki/Q272683","display_name":"Instruction set","level":2,"score":0.4318595826625824},{"id":"https://openalex.org/C118524514","wikidata":"https://www.wikidata.org/wiki/Q173212","display_name":"Computer architecture","level":1,"score":0.41242778301239014},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.30621761083602905},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2699292302131653},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.21749621629714966},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.20769596099853516},{"id":"https://openalex.org/C49154492","wikidata":"https://www.wikidata.org/wiki/Q5300","display_name":"Central processing unit","level":2,"score":0.1818111538887024},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.10572749376296997},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.0},{"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/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/asap.2017.7995282","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asap.2017.7995282","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 28th International Conference on Application-specific Systems, Architectures and Processors (ASAP)","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":7,"referenced_works":["https://openalex.org/W1970340536","https://openalex.org/W1976693023","https://openalex.org/W2065618988","https://openalex.org/W2402854315","https://openalex.org/W3147835733","https://openalex.org/W4250672401","https://openalex.org/W4251850930"],"related_works":["https://openalex.org/W18945967","https://openalex.org/W2045503187","https://openalex.org/W2136520452","https://openalex.org/W1513982523","https://openalex.org/W2165125411","https://openalex.org/W3022691489","https://openalex.org/W2145456033","https://openalex.org/W3013660549","https://openalex.org/W2085645834","https://openalex.org/W2104554143"],"abstract_inverted_index":{"For":[0,290],"the":[1,26,40,48,63,103,106,110,118,147,189,192,223,249,254,267],"next":[2],"generations":[3],"of":[4,18,42,74,105,112,121,150,271],"Processor-Arrays-on-Chip":[5],"(e.":[6],"g.,":[7,279],"coarse-grained":[8],"reconfigurable":[9],"or":[10,85,125],"programmable":[11],"arrays)-including":[12],"more":[13],"than":[14],"100s":[15],"to":[16,24,80,101,117,158,172,206,234,242,274,280],"1000s":[17],"processing":[19],"elements-it":[20],"is":[21,77,251,257],"very":[22],"important":[23],"keep":[25],"on-chip":[27],"configuration/instruction":[28],"memories":[29],"as":[30,32,50,52,195,197],"small":[31],"possible.":[33],"Hence,":[34],"compilers":[35,67],"must":[36],"take":[37],"into":[38,283],"account":[39],"scarceness":[41],"available":[43],"instruction":[44,92,179,231,244,250],"memory":[45],"and":[46,183,199,229],"create":[47],"code":[49,76,113,148],"compact":[51],"possible":[53],"[1].":[54],"However,":[55],"Very":[56],"Long":[57],"Instruction":[58,136],"Word":[59],"(VLIW)":[60],"processors":[61,161,272],"have":[62,233,273],"well-known":[64],"problem":[65],"that":[66,245],"typically":[68],"produce":[69],"lengthy":[70],"codes.":[71],"A":[72],"lot":[73],"unnecessary":[75],"produced":[78],"due":[79,116],"unused":[81],"Functional":[82],"Units":[83],"(FUs)":[84],"repeating":[86,261,264],"operations":[87],"for":[88],"single":[89],"FUs":[90,190],"in":[91,145,163,266],"sequences.":[93],"Techniques":[94],"like":[95,165],"software":[96],"pipelining":[97],"can":[98,214],"be":[99,235,275],"used":[100,162],"improve":[102],"utilization":[104],"FUs,":[107],"yet":[108],"with":[109,176],"risk":[111],"explosion":[114],"[2]":[115],"overlapped":[119],"scheduling":[120,295],"multiple":[122],"loop":[123,152,210],"iterations":[124],"other":[126],"control":[127],"flow":[128],"statements.":[129],"This":[130,202,259],"is,":[131,156],"where":[132],"our":[133],"proposed":[134],"Orthogonal":[135],"Processing":[137],"(OIP)":[138],"architecture":[139],"(see":[140],"Fig.":[141],"1)":[142],"shows":[143],"benefits":[144],"reducing":[146],"size":[149],"compute-intensive":[151],"programs.":[153],"The":[154,226],"idea":[155],"contrary":[157],"lightweight":[159],"VLIW":[160],"arrays":[164],"Tightly":[166],"Coupled":[167],"Processor":[168],"Arrays":[169],"(TCPAs)":[170],"[4],":[171],"equip":[173],"each":[174,243],"FU":[175,213],"its":[177,216,230],"own":[178,217],"memory,":[180],"branch":[181,227,256],"unit,":[182],"program":[184],"counter,":[185],"but":[186],"still":[187],"let":[188],"share":[191],"register":[193,224],"files":[194],"well":[196],"input":[198],"output":[200],"signals.":[201],"enables":[203,260],"a":[204,209,240],"processor":[205],"orthogonally":[207],"execute":[208,215],"program.":[211],"Each":[212],"sub-program":[218],"while":[219,287],"exchanging":[220],"data":[221,284],"over":[222],"files.":[225],"unit":[228],"format":[232],"slightly":[236],"changed":[237],"by":[238],"introducing":[239],"counter":[241],"determines":[246],"how":[247],"often":[248],"repeated":[252],"until":[253],"specified":[255],"executed.":[258],"instructions":[262],"without":[263],"them":[265],"code.":[268],"Those":[269],"kind":[270],"carefully":[276],"programmed,":[277],"e.":[278],"not":[281],"run":[282],"dependency":[285],"problems":[286],"optimizing":[288],"throughput.":[289],"solving":[291],"this":[292],"resource-constrained":[293],"modulo":[294],"problem,":[296],"we":[297],"use":[298],"techniques":[299],"based":[300],"on":[301],"mixed":[302],"integer":[303],"linear":[304],"programming":[305],"[5],":[306],"[3].":[307]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}