{"id":"https://openalex.org/W4234535942","doi":"https://doi.org/10.1145/1993498.1993510","title":"An SSA-based algorithm for optimal speculative code motion under an execution profile","display_name":"An SSA-based algorithm for optimal speculative code motion under an execution profile","publication_year":2011,"publication_date":"2011-06-04","ids":{"openalex":"https://openalex.org/W4234535942","doi":"https://doi.org/10.1145/1993498.1993510"},"language":"en","primary_location":{"id":"doi:10.1145/1993498.1993510","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993498.1993510","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation","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/A5025481175","display_name":"Hucheng Zhou","orcid":"https://orcid.org/0000-0002-1894-3897"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hucheng Zhou","raw_affiliation_strings":["Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103141832","display_name":"Wenguang Chen","orcid":"https://orcid.org/0000-0002-4281-1018"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenguang Chen","raw_affiliation_strings":["Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003788107","display_name":"Fred Chow","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fred Chow","raw_affiliation_strings":["ICube Technology Corp., Beijing, China"],"affiliations":[{"raw_affiliation_string":"ICube Technology Corp., Beijing, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025481175"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":0.48335912,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70894677,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"98","last_page":"108"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994999766349792,"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/T10126","display_name":"Logic, programming, and type systems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8581923246383667},{"id":"https://openalex.org/keywords/dead-code-elimination","display_name":"Dead code elimination","score":0.7414647340774536},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7071312665939331},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.7013071179389954},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.6312386989593506},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6304320693016052},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6057546138763428},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6030897498130798},{"id":"https://openalex.org/keywords/control-flow","display_name":"Control flow","score":0.5987759828567505},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5266002416610718},{"id":"https://openalex.org/keywords/data-flow-analysis","display_name":"Data-flow analysis","score":0.5104762315750122},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4647158086299896},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.44845858216285706},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42706602811813354},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.32277196645736694},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31330978870391846},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.27397656440734863},{"id":"https://openalex.org/keywords/data-flow-diagram","display_name":"Data flow diagram","score":0.21195760369300842},{"id":"https://openalex.org/keywords/redundant-code","display_name":"Redundant code","score":0.18524476885795593}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8581923246383667},{"id":"https://openalex.org/C2144512","wikidata":"https://www.wikidata.org/wiki/Q1143090","display_name":"Dead code elimination","level":5,"score":0.7414647340774536},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7071312665939331},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.7013071179389954},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.6312386989593506},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6304320693016052},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6057546138763428},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6030897498130798},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.5987759828567505},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5266002416610718},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.5104762315750122},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4647158086299896},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.44845858216285706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42706602811813354},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.32277196645736694},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31330978870391846},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27397656440734863},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.21195760369300842},{"id":"https://openalex.org/C151578736","wikidata":"https://www.wikidata.org/wiki/Q1251793","display_name":"Redundant code","level":4,"score":0.18524476885795593},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1993498.1993510","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993498.1993510","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1525019394","https://openalex.org/W1971921814","https://openalex.org/W1982205631","https://openalex.org/W1983166063","https://openalex.org/W2000722076","https://openalex.org/W2002427499","https://openalex.org/W2025317174","https://openalex.org/W2032591091","https://openalex.org/W2058360616","https://openalex.org/W2072910724","https://openalex.org/W2074737297","https://openalex.org/W2086831405","https://openalex.org/W2087086761","https://openalex.org/W2118263004","https://openalex.org/W2123160336","https://openalex.org/W2134093679","https://openalex.org/W4242153477","https://openalex.org/W4243104579","https://openalex.org/W6675359928","https://openalex.org/W6781618339"],"related_works":["https://openalex.org/W2091716239","https://openalex.org/W1853049011","https://openalex.org/W2080682474","https://openalex.org/W4242404469","https://openalex.org/W1550846314","https://openalex.org/W3025501777","https://openalex.org/W2294309217","https://openalex.org/W2599014345","https://openalex.org/W4233545035","https://openalex.org/W2135488322"],"abstract_inverted_index":{"To":[0],"derive":[1],"maximum":[2],"optimization":[3],"benefits":[4],"from":[5],"partial":[6],"redundancy":[7],"elimination":[8],"(PRE),it":[9],"is":[10,56,94,101],"necessary":[11],"to":[12,34,77,83,103,124,148,189],"go":[13],"beyond":[14],"its":[15,145,150],"safety":[16],"constraint.":[17],"Algorithms":[18],"for":[19],"optimal":[20,85,127],"speculative":[21,86],"code":[22,87,128],"motion":[23,88],"have":[24,67,154],"been":[25],"developed":[26,68],"based":[27,165],"on":[28,120,166],"the":[29,40,52,69,112,126,134,158,167,190],"application":[30],"of":[31,39,51,81,108,133,141],"minimum":[32],"cut":[33],"flow":[35,42,105,122],"networks":[36,106,123],"formed":[37],"out":[38,107],"control":[41],"graph.":[43],"These":[44],"previous":[45],"techniques":[46],"did":[47],"not":[48],"take":[49,78],"advantage":[50,80],"SSA":[53,82,109],"form,":[54],"which":[55],"a":[57],"popular":[58],"program":[59,179],"representation":[60],"widely":[61],"used":[62],"in":[63,157,194],"modern-day":[64],"compilers.":[65],"We":[66,130,143,153],"MC-SSAPRE":[70,156,175],"algorithm":[71],"that":[72,99,174,185],"enables":[73],"an":[74,91],"SSA-based":[75],"compiler":[76],"full":[79,168],"perform":[84],"efficiently":[89],"when":[90],"execution":[92],"profile":[93],"available.":[95],"Our":[96,162],"work":[97],"shows":[98],"it":[100],"possible":[102],"form":[104],"graphs,":[110],"and":[111,136,138,184],"min-cut":[113],"technique":[114],"can":[115,176],"be":[116],"applied":[117],"equally":[118],"well":[119],"these":[121],"find":[125],"placement.":[129],"provide":[131],"proofs":[132],"correctness":[135],"computational":[137],"lifetime":[139],"optimality":[140],"MC-SSAPRE.":[142],"analyze":[144],"time":[146],"complexity":[147],"show":[149,173],"efficiency":[151],"advantage.":[152],"implemented":[155],"open-sourced":[159],"Path64":[160],"compiler.":[161],"experimental":[163],"data":[164],"SPEC":[169],"CPU2006":[170],"Benchmark":[171],"Suite":[172],"further":[177],"improve":[178],"performance":[180],"over":[181],"traditional":[182],"SSAPRE,":[183],"our":[186],"sparse":[187],"approach":[188],"problem":[191,196],"does":[192],"result":[193],"smaller":[195],"sizes.":[197]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}