{"id":"https://openalex.org/W2144883841","doi":"https://doi.org/10.1109/tc.2003.1183944","title":"Modeling value speculation: an optimal edge selection problem","display_name":"Modeling value speculation: an optimal edge selection problem","publication_year":2003,"publication_date":"2003-03-01","ids":{"openalex":"https://openalex.org/W2144883841","doi":"https://doi.org/10.1109/tc.2003.1183944","mag":"2144883841"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2003.1183944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2003.1183944","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-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/A5045023276","display_name":"Chao-Ying Fu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chao-ying Fu","raw_affiliation_strings":["MIPS Technologies, Inc., Mountain View, CA, USA"],"affiliations":[{"raw_affiliation_string":"MIPS Technologies, Inc., Mountain View, CA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024750976","display_name":"Jill T. Bodine","orcid":null},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.T. Bodine","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA","institution_ids":["https://openalex.org/I137902535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091080889","display_name":"Thomas M. Conte","orcid":"https://orcid.org/0000-0001-7037-2377"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T.M. Conte","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5045023276"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2515,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.57428154,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"52","issue":"3","first_page":"277","last_page":"292"},"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.9997000098228455,"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.9997000098228455,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991000294685364,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9962000250816345,"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/speculation","display_name":"Speculation","score":0.7925981283187866},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5929881930351257},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.5875625014305115},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5727470517158508},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.546732485294342},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5330658555030823},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48399901390075684},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46534761786460876},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45715802907943726},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42406001687049866},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42066097259521484},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38274306058883667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32390326261520386},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17085722088813782},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09290459752082825}],"concepts":[{"id":"https://openalex.org/C47941915","wikidata":"https://www.wikidata.org/wiki/Q107885","display_name":"Speculation","level":2,"score":0.7925981283187866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5929881930351257},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.5875625014305115},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5727470517158508},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.546732485294342},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5330658555030823},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48399901390075684},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46534761786460876},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45715802907943726},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42406001687049866},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42066097259521484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38274306058883667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32390326261520386},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17085722088813782},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09290459752082825},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.2003.1183944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2003.1183944","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W20727985","https://openalex.org/W111204614","https://openalex.org/W2032570410","https://openalex.org/W2063255488","https://openalex.org/W2095872092","https://openalex.org/W2106921346","https://openalex.org/W2112438883","https://openalex.org/W2122939826","https://openalex.org/W2125452276","https://openalex.org/W2129523505","https://openalex.org/W2142685136","https://openalex.org/W2152386591","https://openalex.org/W2154512574","https://openalex.org/W2154693467","https://openalex.org/W2159589058","https://openalex.org/W2161910890","https://openalex.org/W2169859691","https://openalex.org/W2295303622","https://openalex.org/W2357272787","https://openalex.org/W2752885492","https://openalex.org/W2916737266","https://openalex.org/W3006014073","https://openalex.org/W4239009581","https://openalex.org/W4240285592","https://openalex.org/W4247080994","https://openalex.org/W4248185003","https://openalex.org/W4250075075","https://openalex.org/W4250583839","https://openalex.org/W4251073284","https://openalex.org/W4253048710","https://openalex.org/W4253172818","https://openalex.org/W4256500132","https://openalex.org/W6600792640","https://openalex.org/W6706877894","https://openalex.org/W6991605720"],"related_works":["https://openalex.org/W4243792164","https://openalex.org/W2147782221","https://openalex.org/W2076161440","https://openalex.org/W3107943460","https://openalex.org/W2799624154","https://openalex.org/W4250172181","https://openalex.org/W3091416521","https://openalex.org/W2489870153","https://openalex.org/W2381171456","https://openalex.org/W2003989576"],"abstract_inverted_index":{"Techniques":[0],"for":[1,7,54,63,107,142],"value":[2,35,55,64,68,101,108,187],"speculation":[3,36,69],"have":[4,186],"been":[5],"proposed":[6],"dynamically":[8],"scheduled":[9,12],"and":[10,24,43,59,169],"statically":[11],"machines":[13],"to":[14,28,41,46,89,213],"increase":[15],"instruction-level":[16],"parallelism":[17],"(ILP)":[18],"by":[19,182],"breaking":[20],"flow":[21],"(true)":[22],"dependences":[23,45],"allowing":[25],"value-dependent":[26],"operations":[27,210,228],"be":[29],"executed":[30,147],"speculatively.":[31],"The":[32,76,158,207],"effectiveness":[33],"of":[34,86,135,178,195,202,219],"depends":[37],"upon":[38],"the":[39,61,105,118,132,137,143,179,183,196,200,203,216,220,225,231],"ability":[40],"select":[42],"break":[44,90],"shorten":[47],"overall":[48],"execution":[49],"time,":[50],"while":[51,103,224],"encountering":[52],"penalties":[53,106],"misprediction.":[56],"To":[57],"understand":[58],"improve":[60],"techniques":[62],"speculation,":[65,102],"we":[66],"model":[67],"as":[70],"an":[71,123,167],"optimal":[72,77,119,125,138,184],"edge":[73,78,120,126,139],"selection":[74,79,121,127,140],"problem.":[75],"problem":[80],"involves":[81],"finding":[82],"a":[83,92],"minimal":[84],"set":[85],"edges":[87,180,198],"(dependences)":[88],"in":[91,215],"data":[93,204,221],"dependence":[94,205,222],"graph":[95],"that":[96],"achieves":[97],"maximal":[98],"benefits":[99],"from":[100,117,150],"taking":[104],"misprediction":[109],"into":[110],"account.":[111],"Based":[112],"on":[113,166],"three":[114],"properties":[115],"observed":[116],"problem,":[122],"efficient":[124],"algorithm":[128,141,185],"is":[129,163],"designed.":[130],"From":[131],"experimental":[133],"results":[134],"running":[136],"20":[144],"most":[145,194],"heavily":[146],"paths":[148],"selected":[149,181,197,208,226],"each":[151],"SPECint95":[152],"benchmark,":[153],"several":[154],"insights":[155],"are":[156],"shown.":[157],"average":[159,168],"critical":[160],"path":[161],"reduction":[162],"9.61":[164],"percent":[165,171,177],"25.57":[170],"at":[172],"its":[173],"maximum.":[174],"Surprisingly,":[175],"66":[176],"prediction":[188],"accuracies":[189],"over":[190],"99":[191],"percent.":[192],"Moreover,":[193],"cross":[199],"middle":[201],"graph.":[206],"producer":[209],"thereby":[211],"tend":[212],"reside":[214],"upper":[217],"portion":[218],"graph,":[223],"consumer":[227],"appear":[229],"toward":[230],"lower":[232],"portion.":[233]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}