{"id":"https://openalex.org/W4240643561","doi":"https://doi.org/10.1109/isca.2002.1003560","title":"Efficient dynamic scheduling through tag elimination","display_name":"Efficient dynamic scheduling through tag elimination","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W4240643561","doi":"https://doi.org/10.1109/isca.2002.1003560"},"language":"en","primary_location":{"id":"doi:10.1109/isca.2002.1003560","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isca.2002.1003560","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 29th Annual International Symposium on Computer Architecture","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/A5013417901","display_name":"Daniel Ernst","orcid":"https://orcid.org/0000-0002-1642-9210"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D. Ernst","raw_affiliation_strings":["Advanced Computer Architecture Laboratory, University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Advanced Computer Architecture Laboratory, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112774619","display_name":"T. Austin","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. Austin","raw_affiliation_strings":["Advanced Computer Architecture Laboratory, University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Advanced Computer Architecture Laboratory, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013417901"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":7.7979,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.97788602,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"37","last_page":"46"},"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.9995999932289124,"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.9995999932289124,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9991999864578247,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/operand","display_name":"Operand","score":0.906640887260437},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8386646509170532},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5640459656715393},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5429738163948059},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.49717047810554504},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49224916100502014},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.47054535150527954},{"id":"https://openalex.org/keywords/comparator","display_name":"Comparator","score":0.42112818360328674},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.29873886704444885},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.24130147695541382},{"id":"https://openalex.org/keywords/voltage","display_name":"Voltage","score":0.143635094165802}],"concepts":[{"id":"https://openalex.org/C55526617","wikidata":"https://www.wikidata.org/wiki/Q719375","display_name":"Operand","level":2,"score":0.906640887260437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8386646509170532},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5640459656715393},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5429738163948059},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.49717047810554504},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49224916100502014},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.47054535150527954},{"id":"https://openalex.org/C155745195","wikidata":"https://www.wikidata.org/wiki/Q1164179","display_name":"Comparator","level":3,"score":0.42112818360328674},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.29873886704444885},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.24130147695541382},{"id":"https://openalex.org/C165801399","wikidata":"https://www.wikidata.org/wiki/Q25428","display_name":"Voltage","level":2,"score":0.143635094165802},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isca.2002.1003560","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isca.2002.1003560","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 29th Annual International Symposium on Computer Architecture","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.106.7152","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.7152","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/~taustin/papers/ISCA02-tagelim.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.7122","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.7122","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://systems.cs.colorado.edu/ISCA2002/FinalPapers/ernstd_tag_elimination.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W10594741","https://openalex.org/W1500214070","https://openalex.org/W1503092462","https://openalex.org/W1555915743","https://openalex.org/W1584321010","https://openalex.org/W1868432933","https://openalex.org/W2032094184","https://openalex.org/W2118532220","https://openalex.org/W2121539621","https://openalex.org/W2122939826","https://openalex.org/W2155470578","https://openalex.org/W2161864047","https://openalex.org/W2164376452","https://openalex.org/W2173229352","https://openalex.org/W3140903683","https://openalex.org/W4206262716","https://openalex.org/W4236258190","https://openalex.org/W4236892585","https://openalex.org/W4244330651","https://openalex.org/W4245804582","https://openalex.org/W4252201686","https://openalex.org/W6600441586","https://openalex.org/W6630061753","https://openalex.org/W6630219513","https://openalex.org/W6792941224","https://openalex.org/W6817363484"],"related_works":["https://openalex.org/W2556282987","https://openalex.org/W1533508804","https://openalex.org/W1999872368","https://openalex.org/W2363460986","https://openalex.org/W609318495","https://openalex.org/W2376229137","https://openalex.org/W1501193936","https://openalex.org/W2262854793","https://openalex.org/W2379237800","https://openalex.org/W2386584920"],"abstract_inverted_index":{"An":[0],"increasingly":[1],"large":[2],"portion":[3],"of":[4,22,32,55,133],"scheduler":[5,24,76],"latency":[6],"is":[7],"derived":[8],"from":[9],"the":[10,23,30,49,75,111,134,147],"monolithic":[11],"content":[12],"addressable":[13],"memory":[14],"arrays":[15],"accessed":[16],"during":[17],"instruction":[18,160],"wake-up.":[19],"The":[20],"performance":[21],"can":[25,79],"be":[26,80],"improved":[27],"by":[28],"decreasing":[29],"number":[31],"tag":[33,70,106,135],"comparisons":[34],"necessary":[35],"to":[36,125],"schedule":[37],"instructions.":[38],"Using":[39],"detailed":[40],"simulation-based":[41],"analyses,":[42],"we":[43,96,122],"find":[44],"that":[45,102,146],"most":[46],"instructions":[47,64,91],"enter":[48],"window":[50,161],"with":[51,68,82,92,129],"at":[52],"least":[53],"one":[54,131],"their":[56],"input":[57,114],"operands":[58],"already":[59],"available.":[60],"By":[61,116],"putting":[62],"these":[63,118],"into":[65],"specialized":[66],"windows":[67],"fewer":[69],"comparators,":[71],"load":[72],"capacitance":[73],"on":[74,87,159],"critical":[77],"path":[78],"reduced,":[81],"only":[83],"very":[84],"small":[85],"effects":[86],"program":[88],"throughput.":[89],"For":[90],"multiple":[93],"unavailable":[94],"operands,":[95],"introduce":[97],"a":[98],"last-tag":[99],"speculation":[100],"mechanism":[101],"eliminates":[103],"all":[104],"remaining":[105],"comparators":[107,136],"except":[108],"those":[109],"for":[110],"last":[112],"arriving":[113],"operand.":[115],"combining":[117],"two":[119],"tag-reduction":[120],"schemes,":[121],"are":[123,150],"able":[124],"construct":[126],"dynamic":[127],"schedulers":[128],"approximately":[130],"quarter":[132],"found":[137],"in":[138],"conventional":[139],"designs.":[140],"Conservative":[141],"circuit-level":[142],"timing":[143],"analyses":[144],"indicate":[145],"optimized":[148],"designs":[149],"20-45%":[151],"faster":[152],"and":[153],"require":[154],"10-20%":[155],"less":[156],"power":[157],"depending":[158],"size.":[162]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}