{"id":"https://openalex.org/W4235274905","doi":"https://doi.org/10.1109/cgo.2004.1281676","title":"Using dynamic binary translation to fuse dependent instructions","display_name":"Using dynamic binary translation to fuse dependent instructions","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W4235274905","doi":"https://doi.org/10.1109/cgo.2004.1281676"},"language":"en","primary_location":{"id":"doi:10.1109/cgo.2004.1281676","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2004.1281676","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium on Code Generation and Optimization, 2004. CGO 2004.","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/A5109635991","display_name":"Shiliang Hu","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shiliang Hu","raw_affiliation_strings":["Department of Computer Sciences, University of Wisconsin, Madison, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Wisconsin, Madison, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027850955","display_name":"J.E. Smith","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.E. Smith","raw_affiliation_strings":["Department of Electrical & Computer Engineering, University of Wisconsin, Madison, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of Wisconsin, Madison, USA","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109635991"],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":1.8431,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.85801905,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"213","last_page":"224"},"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.9970999956130981,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9966999888420105,"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/binary-translation","display_name":"Binary translation","score":0.9387401342391968},{"id":"https://openalex.org/keywords/x86","display_name":"x86","score":0.8878458738327026},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8496449589729309},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6791167855262756},{"id":"https://openalex.org/keywords/reduced-instruction-set-computing","display_name":"Reduced instruction set computing","score":0.6627907156944275},{"id":"https://openalex.org/keywords/instruction-scheduling","display_name":"Instruction scheduling","score":0.6284392476081848},{"id":"https://openalex.org/keywords/instruction-set","display_name":"Instruction set","score":0.5757748484611511},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5215868353843689},{"id":"https://openalex.org/keywords/microarchitecture","display_name":"Microarchitecture","score":0.5159545540809631},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5040608644485474},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.35111135244369507},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.2940906286239624},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.21184149384498596},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.20778021216392517},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.08965390920639038}],"concepts":[{"id":"https://openalex.org/C2778971978","wikidata":"https://www.wikidata.org/wiki/Q2287075","display_name":"Binary translation","level":3,"score":0.9387401342391968},{"id":"https://openalex.org/C170723468","wikidata":"https://www.wikidata.org/wiki/Q182933","display_name":"x86","level":3,"score":0.8878458738327026},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8496449589729309},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6791167855262756},{"id":"https://openalex.org/C126298526","wikidata":"https://www.wikidata.org/wiki/Q189376","display_name":"Reduced instruction set computing","level":3,"score":0.6627907156944275},{"id":"https://openalex.org/C73564150","wikidata":"https://www.wikidata.org/wiki/Q11417093","display_name":"Instruction scheduling","level":5,"score":0.6284392476081848},{"id":"https://openalex.org/C202491316","wikidata":"https://www.wikidata.org/wiki/Q272683","display_name":"Instruction set","level":2,"score":0.5757748484611511},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5215868353843689},{"id":"https://openalex.org/C107598950","wikidata":"https://www.wikidata.org/wiki/Q259864","display_name":"Microarchitecture","level":2,"score":0.5159545540809631},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5040608644485474},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.35111135244369507},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.2940906286239624},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.21184149384498596},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.20778021216392517},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.08965390920639038},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cgo.2004.1281676","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2004.1281676","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium on Code Generation and Optimization, 2004. CGO 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W63944998","https://openalex.org/W1989569696","https://openalex.org/W2039631685","https://openalex.org/W2063255488","https://openalex.org/W2101536355","https://openalex.org/W2105949597","https://openalex.org/W2121539621","https://openalex.org/W2137059427","https://openalex.org/W2140370341","https://openalex.org/W2150023094","https://openalex.org/W2164376452","https://openalex.org/W2916411819","https://openalex.org/W4206262716","https://openalex.org/W4230658192","https://openalex.org/W4231002400","https://openalex.org/W4236694484","https://openalex.org/W4237273530","https://openalex.org/W4240643561","https://openalex.org/W4253767979","https://openalex.org/W6602613798","https://openalex.org/W6677836369","https://openalex.org/W6684386307"],"related_works":["https://openalex.org/W1964586167","https://openalex.org/W2369102298","https://openalex.org/W2766777357","https://openalex.org/W3005677086","https://openalex.org/W2479669872","https://openalex.org/W2911551207","https://openalex.org/W2166847391","https://openalex.org/W2383717912","https://openalex.org/W2120142281","https://openalex.org/W4235274905"],"abstract_inverted_index":{"Instruction":[0],"scheduling":[1,22,118,137],"hardware":[2,129],"can":[3],"be":[4],"simplified":[5],"and":[6,87],"easily":[7],"pipelined":[8],"if":[9],"pairs":[10,94],"of":[11,28,95,117],"dependent":[12,96],"instructions":[13,79],"are":[14],"fused":[15,52,108],"so":[16],"they":[17],"share":[18],"a":[19,67,124,166],"single":[20],"instruction":[21,43,53,136],"slot.":[23],"We":[24,58],"study":[25],"an":[26,38,135],"implementation":[27,126],"the":[29,51,56,61,107,115,157],"x86":[30,35,69,78],"ISA":[31,40,109,159],"that":[32,41,47,127],"dynamically":[33],"translates":[34],"code":[36],"to":[37,81,91],"underlying":[39],"supports":[42],"fusing.":[44],"A":[45],"microarchitecture":[46],"is":[48],"codesigned":[49,68],"with":[50,100,110],"set":[54],"completes":[55],"implementation.":[57],"focus":[59],"on":[60],"dynamic":[62,73,111],"binary":[63,74,112],"translator":[64,75],"for":[65],"such":[66],"virtual":[70],"machine.":[71],"The":[72],"first":[76],"cracks":[77],"belonging":[80],"hot":[82],"superblocks":[83],"into":[84,131],"RISC-style":[85,169],"microoperations,":[86],"then":[88],"uses":[89,128],"heuristics":[90],"fuse":[92],"together":[93],"microoperations.":[97],"Experimental":[98],"results":[99],"SPEC2000":[101],"integer":[102],"benchmarks":[103],"demonstrate":[104],"that:":[105],"(1)":[106],"translation":[113],"reduces":[114],"number":[116],"decisions":[119],"by":[120],"about":[121,161],"30%":[122,162],"versus":[123],"conventional":[125],"cracking":[130],"RISC":[132],"microoperations;":[133],"(2)":[134],"slot":[138],"needs":[139],"only":[140],"hold":[141,150],"two":[142,151],"source":[143],"register":[144],"fields":[145],"even":[146],"though":[147],"it":[148],"may":[149],"instructions;":[152],"(3)":[153],"translations":[154],"generated":[155],"in":[156],"proposed":[158],"consume":[160],"less":[163],"storage":[164],"than":[165],"corresponding":[167],"fixed-length":[168],"ISA.":[170]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-25T21:42:39.735039","created_date":"2025-10-10T00:00:00"}