{"id":"https://openalex.org/W2147623728","doi":"https://doi.org/10.1145/2384616.2384628","title":"Mitigating the compiler optimization phase-ordering problem using machine learning","display_name":"Mitigating the compiler optimization phase-ordering problem using machine learning","publication_year":2012,"publication_date":"2012-10-19","ids":{"openalex":"https://openalex.org/W2147623728","doi":"https://doi.org/10.1145/2384616.2384628","mag":"2147623728"},"language":"en","primary_location":{"id":"doi:10.1145/2384616.2384628","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2384616.2384628","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM international conference on Object oriented programming systems languages and applications","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/A5081037214","display_name":"Sameer G. Kulkarni","orcid":"https://orcid.org/0000-0003-4727-6875"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sameer Kulkarni","raw_affiliation_strings":["University of Delaware, Newark, DE, USA"],"affiliations":[{"raw_affiliation_string":"University of Delaware, Newark, DE, USA","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103791820","display_name":"John Cavazos","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Cavazos","raw_affiliation_strings":["University of Delaware, Newark, DE, USA"],"affiliations":[{"raw_affiliation_string":"University of Delaware, Newark, DE, USA","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081037214"],"corresponding_institution_ids":["https://openalex.org/I86501945"],"apc_list":null,"apc_paid":null,"fwci":5.8554,"has_fulltext":false,"cited_by_count":100,"citation_normalized_percentile":{"value":0.96508683,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"147","last_page":"162"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9767000079154968,"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"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9746000170707703,"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/compiler","display_name":"Compiler","score":0.9239555597305298},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8526399731636047},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.6584606170654297},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6401975154876709},{"id":"https://openalex.org/keywords/program-optimization","display_name":"Program optimization","score":0.6326918005943298},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5553629398345947},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5340372920036316},{"id":"https://openalex.org/keywords/interprocedural-optimization","display_name":"Interprocedural optimization","score":0.5131414532661438},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.467253178358078},{"id":"https://openalex.org/keywords/loop-optimization","display_name":"Loop optimization","score":0.4502304792404175},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.44275155663490295},{"id":"https://openalex.org/keywords/dead-code-elimination","display_name":"Dead code elimination","score":0.42258191108703613},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09691795706748962},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.08848118782043457},{"id":"https://openalex.org/keywords/object-code","display_name":"Object code","score":0.07651439309120178}],"concepts":[{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.9239555597305298},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8526399731636047},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.6584606170654297},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6401975154876709},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.6326918005943298},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5553629398345947},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5340372920036316},{"id":"https://openalex.org/C111564260","wikidata":"https://www.wikidata.org/wiki/Q4288856","display_name":"Interprocedural optimization","level":5,"score":0.5131414532661438},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.467253178358078},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.4502304792404175},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.44275155663490295},{"id":"https://openalex.org/C2144512","wikidata":"https://www.wikidata.org/wiki/Q1143090","display_name":"Dead code elimination","level":5,"score":0.42258191108703613},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09691795706748962},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.08848118782043457},{"id":"https://openalex.org/C154526789","wikidata":"https://www.wikidata.org/wiki/Q157965","display_name":"Object code","level":4,"score":0.07651439309120178}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2384616.2384628","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2384616.2384628","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM international conference on Object oriented programming systems languages and applications","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.369.7625","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.369.7625","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecis.udel.edu/~cavazos/oopsla-2012.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":31,"referenced_works":["https://openalex.org/W1499644348","https://openalex.org/W1509875415","https://openalex.org/W1525215176","https://openalex.org/W1964031104","https://openalex.org/W1967846636","https://openalex.org/W2005985523","https://openalex.org/W2052934867","https://openalex.org/W2056823637","https://openalex.org/W2059178831","https://openalex.org/W2062060002","https://openalex.org/W2077115703","https://openalex.org/W2091994380","https://openalex.org/W2099625934","https://openalex.org/W2102839400","https://openalex.org/W2106296728","https://openalex.org/W2118937112","https://openalex.org/W2121696621","https://openalex.org/W2125523964","https://openalex.org/W2129903625","https://openalex.org/W2136952590","https://openalex.org/W2137311321","https://openalex.org/W2143124065","https://openalex.org/W2147073440","https://openalex.org/W2153637321","https://openalex.org/W2164617852","https://openalex.org/W2168519934","https://openalex.org/W2461867464","https://openalex.org/W2600258283","https://openalex.org/W3004042307","https://openalex.org/W4206504442","https://openalex.org/W4245206864"],"related_works":["https://openalex.org/W2083681681","https://openalex.org/W2013570895","https://openalex.org/W1597127505","https://openalex.org/W2053033210","https://openalex.org/W2324321492","https://openalex.org/W4242404469","https://openalex.org/W2577630842","https://openalex.org/W2036668966","https://openalex.org/W2014855281","https://openalex.org/W2113798250"],"abstract_inverted_index":{"Today's":[0],"compilers":[1,68],"have":[2,17],"a":[3,18,42,77,84],"plethora":[4],"of":[5,14,24,50,74],"optimizations":[6,15,39,52,63],"to":[7,36,80],"choose":[8],"from,":[9],"and":[10,57],"the":[11,22,25,31,55,71,88],"correct":[12,32],"choice":[13],"can":[16],"significant":[19],"impact":[20],"on":[21],"performance":[23],"code":[26,56,89],"being":[27,90],"optimized.":[28,91],"Furthermore,":[29],"choosing":[30],"order":[33,79],"in":[34,46,58,64,76,83],"which":[35],"apply":[37,70],"those":[38],"has":[40],"been":[41],"long":[43],"standing":[44],"problem":[45],"compilation":[47],"research.":[48],"Each":[49],"these":[51],"interacts":[53],"with":[54,60],"turn":[59],"all":[61,81],"other":[62],"complicated":[65],"ways.":[66],"Traditional":[67],"typically":[69],"same":[72],"set":[73],"optimization":[75],"fixed":[78],"functions":[82],"program,":[85],"without":[86],"regard":[87]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
