{"id":"https://openalex.org/W2141320470","doi":"https://doi.org/10.1109/hpca.2006.1598137","title":"Efficient Instruction Schedulers for SMT Processors","display_name":"Efficient Instruction Schedulers for SMT Processors","publication_year":2006,"publication_date":"2006-03-21","ids":{"openalex":"https://openalex.org/W2141320470","doi":"https://doi.org/10.1109/hpca.2006.1598137","mag":"2141320470"},"language":"en","primary_location":{"id":"doi:10.1109/hpca.2006.1598137","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpca.2006.1598137","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Twelfth International Symposium on High-Performance Computer Architecture, 2006.","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/A5034403616","display_name":"Joseph Sharkey","orcid":null},"institutions":[{"id":"https://openalex.org/I123946342","display_name":"Binghamton University","ror":"https://ror.org/008rmbt77","country_code":"US","type":"education","lineage":["https://openalex.org/I123946342"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J.J. Sharkey","raw_affiliation_strings":["Department of Computer Science, State University of New York, Binghamton, NY, USA","Dept. of Comput. Sci., State Univ. of New York, Binghamton, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of New York, Binghamton, NY, USA","institution_ids":["https://openalex.org/I123946342"]},{"raw_affiliation_string":"Dept. of Comput. Sci., State Univ. of New York, Binghamton, NY, USA","institution_ids":["https://openalex.org/I123946342"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066100959","display_name":"Dmitry Ponomarev","orcid":"https://orcid.org/0009-0006-5656-2258"},"institutions":[{"id":"https://openalex.org/I123946342","display_name":"Binghamton University","ror":"https://ror.org/008rmbt77","country_code":"US","type":"education","lineage":["https://openalex.org/I123946342"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D.V. Ponomarev","raw_affiliation_strings":["Department of Computer Science, State University of New York, Binghamton, NY, USA","Dept. of Comput. Sci., State Univ. of New York, Binghamton, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of New York, Binghamton, NY, USA","institution_ids":["https://openalex.org/I123946342"]},{"raw_affiliation_string":"Dept. of Comput. Sci., State Univ. of New York, Binghamton, NY, USA","institution_ids":["https://openalex.org/I123946342"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034403616"],"corresponding_institution_ids":["https://openalex.org/I123946342"],"apc_list":null,"apc_paid":null,"fwci":3.4057,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.92362453,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"cs tr 5 dp1","issue":null,"first_page":"293","last_page":"304"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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"}},{"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"}}],"keywords":[{"id":"https://openalex.org/keywords/operand","display_name":"Operand","score":0.8885143995285034},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.849075198173523},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.673621654510498},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6189952492713928},{"id":"https://openalex.org/keywords/instruction-scheduling","display_name":"Instruction scheduling","score":0.6109164357185364},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6000604033470154},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5931718349456787},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5872638821601868},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.2560121417045593},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.20448443293571472},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18563008308410645},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.07492214441299438},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06842947006225586}],"concepts":[{"id":"https://openalex.org/C55526617","wikidata":"https://www.wikidata.org/wiki/Q719375","display_name":"Operand","level":2,"score":0.8885143995285034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.849075198173523},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.673621654510498},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6189952492713928},{"id":"https://openalex.org/C73564150","wikidata":"https://www.wikidata.org/wiki/Q11417093","display_name":"Instruction scheduling","level":5,"score":0.6109164357185364},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6000604033470154},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5931718349456787},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5872638821601868},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.2560121417045593},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.20448443293571472},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18563008308410645},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.07492214441299438},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06842947006225586},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/hpca.2006.1598137","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpca.2006.1598137","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Twelfth International Symposium on High-Performance Computer Architecture, 2006.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.567.4683","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.567.4683","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.hpcaconf.org/hpca12/39_Session10_Paper3.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W151825951","https://openalex.org/W1499795650","https://openalex.org/W1571008568","https://openalex.org/W1989569696","https://openalex.org/W2032094184","https://openalex.org/W2039631685","https://openalex.org/W2048455467","https://openalex.org/W2098190976","https://openalex.org/W2098477977","https://openalex.org/W2106625514","https://openalex.org/W2108039095","https://openalex.org/W2113630514","https://openalex.org/W2118532220","https://openalex.org/W2119160224","https://openalex.org/W2119874774","https://openalex.org/W2120230074","https://openalex.org/W2121539621","https://openalex.org/W2123413169","https://openalex.org/W2129548165","https://openalex.org/W2130124967","https://openalex.org/W2130261923","https://openalex.org/W2140057257","https://openalex.org/W2140782438","https://openalex.org/W2143032080","https://openalex.org/W2143322909","https://openalex.org/W2148528597","https://openalex.org/W2148570943","https://openalex.org/W2153173314","https://openalex.org/W2153456949","https://openalex.org/W2153512189","https://openalex.org/W2156174665","https://openalex.org/W2156263417","https://openalex.org/W2160401437","https://openalex.org/W2161046276","https://openalex.org/W2161864047","https://openalex.org/W2164376452","https://openalex.org/W2167799773","https://openalex.org/W2169823452","https://openalex.org/W2533807529","https://openalex.org/W2542426564","https://openalex.org/W3142147837","https://openalex.org/W4230658192","https://openalex.org/W4232217773","https://openalex.org/W4235861380","https://openalex.org/W4236892585","https://openalex.org/W4237273530","https://openalex.org/W4238346090","https://openalex.org/W4240643561","https://openalex.org/W4242771098","https://openalex.org/W4243665729","https://openalex.org/W4244330651","https://openalex.org/W4248665654","https://openalex.org/W4253011005","https://openalex.org/W4253906885","https://openalex.org/W4285719527","https://openalex.org/W6634224414","https://openalex.org/W6680931953","https://openalex.org/W6681460713"],"related_works":["https://openalex.org/W4252521920","https://openalex.org/W4254186484","https://openalex.org/W2093650773","https://openalex.org/W2114199383","https://openalex.org/W2184526337","https://openalex.org/W2897997157","https://openalex.org/W2502878968","https://openalex.org/W2039924129","https://openalex.org/W2141320470","https://openalex.org/W4237989182"],"abstract_inverted_index":{"We":[0],"propose":[1],"dynamic":[2],"scheduler":[3,8],"designs":[4],"to":[5,30,105,135,154,175],"improve":[6],"the":[7,15,25,51,56,76,79,94,98,102,107,122,125,136,150,156,163,170,173,179,184,190,194,203],"scalability":[9],"and":[10,73,192],"reduce":[11],"its":[12],"complexity":[13,96],"in":[14,149,198,202],"SMT":[16],"processors.":[17],"Our":[18,61],"first":[19],"design":[20,182],"is":[21,114],"an":[22,159],"adaptation":[23],"of":[24,53,78],"recently":[26],"proposed":[27],"instruction":[28,160],"packing":[29,33],"SMT.":[31],"Instruction":[32],"opportunistically":[34],"packs":[35],"two":[36,82,166],"instructions":[37,80,108,137],"(possibly":[38],"from":[39],"different":[40],"threads),":[41],"each":[42],"with":[43,81,109,138,158,165,172],"at":[44,50,139,193],"most":[45,140],"one":[46,70,141],"non-ready":[47,83,111,142,167],"source":[48,84,112,143],"operand":[49],"time":[52,196],"dispatch,":[54],"into":[55],"same":[57,126,195],"issue":[58,127],"queue":[59,128,164,186],"entry.":[60],"second":[62],"design,":[63],"termed":[64],"2OP/spl":[65,118,180],"I.bar/BLOCK,":[66],"takes":[67],"these":[68],"ideas":[69],"step":[71],"further":[72],"completely":[74],"avoids":[75],"dispatching":[77],"operands.":[85],"This":[86],"technique":[87],"has":[88],"several":[89],"advantages.":[90],"First,":[91],"it":[92],"reduces":[93],"scheduling":[95,205],"(and":[97],"associated":[99],"delays)":[100],"as":[101,124,152],"logic":[103],"needed":[104],"support":[106],"2":[110],"operands":[113],"eliminated.":[115],"More":[116],"surprisingly,":[117],"I.bar/BLOCK":[119,181],"simultaneously":[120],"improves":[121],"performance":[123],"entry":[129,157],"may":[130],"be":[131],"reallocated":[132],"multiple":[133],"times":[134],"(which":[144],"usually":[145],"spend":[146],"fewer":[147],"cycles":[148],"queue)":[151],"opposed":[153],"hogging":[155],"which":[161],"enters":[162],"sources.":[168],"For":[169],"schedulers":[171],"capacity":[174],"hold":[176],"64":[177],"instructions,":[178],"outperforms":[183],"traditional":[185],"by":[187],"11%,":[188],"on":[189],"average,":[191],"results":[197],"a":[199],"10%":[200],"reduction":[201],"overall":[204],"delay.":[206]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}