{"id":"https://openalex.org/W3143191405","doi":"https://doi.org/10.1109/date.2012.6176426","title":"A cycle-approximate, mixed-ISA simulator for the KAHRISMA architecture","display_name":"A cycle-approximate, mixed-ISA simulator for the KAHRISMA architecture","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W3143191405","doi":"https://doi.org/10.1109/date.2012.6176426","mag":"3143191405"},"language":"en","primary_location":{"id":"doi:10.1109/date.2012.6176426","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2012.6176426","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)","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/A5066777426","display_name":"Timo Stripf","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"T. Stripf","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009985940","display_name":"Ralf Koenig","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"R. Koenig","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024739574","display_name":"J\u00fcrgen Becker","orcid":"https://orcid.org/0000-0002-5082-5487"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J. Becker","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066777426"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":2.0807,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.87549029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"21","last_page":"26"},"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.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.8789128065109253},{"id":"https://openalex.org/keywords/very-long-instruction-word","display_name":"Very long instruction word","score":0.8444111347198486},{"id":"https://openalex.org/keywords/computer-architecture-simulator","display_name":"Computer architecture simulator","score":0.7145789861679077},{"id":"https://openalex.org/keywords/instruction-set","display_name":"Instruction set","score":0.7059354782104492},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.6533876657485962},{"id":"https://openalex.org/keywords/microarchitecture","display_name":"Microarchitecture","score":0.6453394889831543},{"id":"https://openalex.org/keywords/instruction-level-parallelism","display_name":"Instruction-level parallelism","score":0.5952639579772949},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5937342047691345},{"id":"https://openalex.org/keywords/instructions-per-cycle","display_name":"Instructions per cycle","score":0.538258969783783},{"id":"https://openalex.org/keywords/computer-architecture","display_name":"Computer architecture","score":0.49965596199035645},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.4763517677783966},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.45102447271347046},{"id":"https://openalex.org/keywords/instruction-scheduling","display_name":"Instruction scheduling","score":0.44136637449264526},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.3714320659637451},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.3347013592720032},{"id":"https://openalex.org/keywords/central-processing-unit","display_name":"Central processing unit","score":0.23216867446899414},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.19317159056663513},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.14365538954734802}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8789128065109253},{"id":"https://openalex.org/C170595534","wikidata":"https://www.wikidata.org/wiki/Q249743","display_name":"Very long instruction word","level":2,"score":0.8444111347198486},{"id":"https://openalex.org/C201203610","wikidata":"https://www.wikidata.org/wiki/Q5157524","display_name":"Computer architecture simulator","level":2,"score":0.7145789861679077},{"id":"https://openalex.org/C202491316","wikidata":"https://www.wikidata.org/wiki/Q272683","display_name":"Instruction set","level":2,"score":0.7059354782104492},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.6533876657485962},{"id":"https://openalex.org/C107598950","wikidata":"https://www.wikidata.org/wiki/Q259864","display_name":"Microarchitecture","level":2,"score":0.6453394889831543},{"id":"https://openalex.org/C140763907","wikidata":"https://www.wikidata.org/wiki/Q2714055","display_name":"Instruction-level parallelism","level":3,"score":0.5952639579772949},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5937342047691345},{"id":"https://openalex.org/C156972235","wikidata":"https://www.wikidata.org/wiki/Q1443434","display_name":"Instructions per cycle","level":3,"score":0.538258969783783},{"id":"https://openalex.org/C118524514","wikidata":"https://www.wikidata.org/wiki/Q173212","display_name":"Computer architecture","level":1,"score":0.49965596199035645},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.4763517677783966},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.45102447271347046},{"id":"https://openalex.org/C73564150","wikidata":"https://www.wikidata.org/wiki/Q11417093","display_name":"Instruction scheduling","level":5,"score":0.44136637449264526},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.3714320659637451},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.3347013592720032},{"id":"https://openalex.org/C49154492","wikidata":"https://www.wikidata.org/wiki/Q5300","display_name":"Central processing unit","level":2,"score":0.23216867446899414},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.19317159056663513},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.14365538954734802},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/date.2012.6176426","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2012.6176426","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.46000000834465027}],"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":9,"referenced_works":["https://openalex.org/W2004351586","https://openalex.org/W2014977632","https://openalex.org/W2019324657","https://openalex.org/W2019828116","https://openalex.org/W2098695100","https://openalex.org/W2115516441","https://openalex.org/W2155104856","https://openalex.org/W2161581219","https://openalex.org/W3140458327"],"related_works":["https://openalex.org/W2134136106","https://openalex.org/W2611818882","https://openalex.org/W1599272622","https://openalex.org/W4213212800","https://openalex.org/W2353958330","https://openalex.org/W4242411138","https://openalex.org/W4240285592","https://openalex.org/W4256500132","https://openalex.org/W2032570410","https://openalex.org/W2529008327"],"abstract_inverted_index":{"Processor":[0],"architectures":[1],"that":[2,79,143,162],"are":[3],"capable":[4,81],"to":[5,46,117,192],"reconfigure":[6],"their":[7],"instruction":[8,11,22,39,158],"set":[9,40],"and":[10,140,150,200],"format":[12],"dynamically":[13],"at":[14],"run":[15],"time":[16],"offer":[17],"a":[18,69,76,99,135,145],"new":[19],"flexibility":[20,58],"exploiting":[21],"level":[23,27,159],"parallelism":[24,160],"vs.":[25],"thread":[26,37],"parallelism.":[28],"Based":[29],"on":[30,91,172],"the":[31,38,84,92,118,153,185,190,197],"characteristics":[32,86],"of":[33,61,68,82,87,98,102,157,196],"an":[34,62,88,182],"application":[35,71],"or":[36,49],"architecture":[41],"(ISA)":[42],"can":[43],"be":[44,164,179],"adapted":[45],"increase":[47],"performance":[48,85,149],"reduce":[50],"resource/power":[51],"consumption.":[52],"To":[53],"benefit":[54],"from":[55],"this":[56,122,126],"run-time":[57],"automatic":[59],"selection":[60,187],"appropriate":[63],"ISA":[64,89,186],"for":[65,184],"each":[66],"function":[67],"given":[70],"is":[72,80],"envisioned.":[73],"This":[74],"demands":[75],"cycle-accurate":[77,100],"simulator":[78,101,132,154],"measuring":[83],"dependent":[90],"target":[93],"application.":[94],"However,":[95],"simulation":[96],"speed":[97],"our":[103,130,173],"reconfigurable":[104],"VLIW-like":[105],"processor":[106,169],"instances":[107,170],"featuring":[108],"dynamic":[109,137],"operation":[110,138],"execution":[111,139],"would":[112],"become":[113],"relatively":[114],"slow":[115],"due":[116],"superscalar-like":[119],"microarchitecture.":[120],"Within":[121],"paper":[123],"we":[124],"address":[125],"problem":[127],"by":[128,167],"presenting":[129],"cycle-approximate":[131],"approach":[133],"containing":[134],"heuristic":[136],"memory":[141],"model":[142],"provides":[144],"good":[146],"trade-off":[147],"between":[148],"accuracy.":[151],"Additionally,":[152],"features":[155],"measurement":[156],"(ILP)":[161],"could":[163,178],"theoretically":[165],"exploited":[166],"VLIW":[168],"running":[171],"architecture.":[174],"The":[175],"theoretical":[176],"ILP":[177],"used":[180],"as":[181],"indicator":[183],"process":[188],"without":[189],"need":[191],"simulate":[193],"any":[194],"combination":[195],"different":[198],"ISAs":[199],"applications.":[201]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2025-10-10T00:00:00"}