{"id":"https://openalex.org/W4213200025","doi":"https://doi.org/10.1145/781139.781141","title":"Meta optimization: improving compiler heuristics with machine learning","display_name":"Meta optimization: improving compiler heuristics with machine learning","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W4213200025","doi":"https://doi.org/10.1145/781139.781141"},"language":"en","primary_location":{"id":"doi:10.1145/781139.781141","doi":"https://doi.org/10.1145/781139.781141","is_oa":false,"landing_page_url":"https://doi.org/10.1145/781139.781141","pdf_url":null,"source":{"id":"https://openalex.org/S4393917474","display_name":"ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","issn_l":"1531-7102","issn":["1531-7102"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation - PLDI '03","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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":null,"display_name":"Mark Stephenson","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mark Stephenson","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046791216","display_name":"Saman P. Amarasinghe","orcid":"https://orcid.org/0000-0002-7231-7643","observed_orcids":["https://orcid.org/0000-0002-7231-7643"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saman Amarasinghe","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074814072","display_name":"Mart\u00edn Mart\u00edn","orcid":"https://orcid.org/0000-0002-0050-2954","observed_orcids":["https://orcid.org/0000-0002-0050-2954"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Martin","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000646181","display_name":"Una-May O\u2019Reilly","orcid":"https://orcid.org/0000-0001-6923-8445","observed_orcids":["https://orcid.org/0000-0001-6923-8445"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Una-May O'Reilly","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.2293,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.39087794,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9775000214576721,"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.9775000214576721,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.004399999976158142,"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/T10126","display_name":"Logic, programming, and type systems","score":0.0038999998942017555,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/meta-optimization","display_name":"meta-optimization","score":0.8209999799728394},{"id":"https://openalex.org/keywords/evolutionary-algorithms","display_name":"evolutionary algorithms","score":0.9539999961853027},{"id":"https://openalex.org/keywords/np-hard-optimization-problems","display_name":"NP-hard optimization","score":0.6600000262260437},{"id":"https://openalex.org/keywords/register-allocation","display_name":"register allocation","score":0.9909999966621399},{"id":"https://openalex.org/keywords/data-prefetching","display_name":"data prefetching","score":0.9990000128746033}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8834640979766846},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.8522053956985474},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.84870445728302},{"id":"https://openalex.org/C111564260","wikidata":"https://www.wikidata.org/wiki/Q4288856","display_name":"Interprocedural optimization","level":5,"score":0.7768886685371399},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.6525669097900391},{"id":"https://openalex.org/C68366613","wikidata":"https://www.wikidata.org/wiki/Q5156378","display_name":"Compiler correctness","level":3,"score":0.5947367548942566},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.527679979801178},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5178468823432922},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5111661553382874},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.506904661655426},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.49839282035827637},{"id":"https://openalex.org/C128916667","wikidata":"https://www.wikidata.org/wiki/Q1343660","display_name":"Register allocation","level":3,"score":0.4532316029071808},{"id":"https://openalex.org/C9957790","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler construction","level":3,"score":0.4149717688560486},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.33052563667297363},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20140445232391357},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0761183500289917}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/781139.781141","doi":"https://doi.org/10.1145/781139.781141","is_oa":false,"landing_page_url":"https://doi.org/10.1145/781139.781141","pdf_url":null,"source":{"id":"https://openalex.org/S4393917474","display_name":"ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","issn_l":"1531-7102","issn":["1531-7102"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation - PLDI '03","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7100765155","https://openalex.org/W7096925638","https://openalex.org/W7097580313","https://openalex.org/W4392265924","https://openalex.org/W7126246459","https://openalex.org/W7208806947","https://openalex.org/W2143124065","https://openalex.org/W1876208066","https://openalex.org/W4312444743","https://openalex.org/W2554487717"],"abstract_inverted_index":{"Compiler":[0],"writers":[1,67],"have":[2],"crafted":[3],"many":[4],"heuristics":[5,101],"over":[6,140],"the":[7,53,69,129,180],"years":[8],"to":[9,50,81,126],"approximately":[10],"solve":[11],"NP-hard":[12],"problems":[13],"efficiently.":[14],"Finding":[15],"a":[16,22,28,38,137,173],"heuristic":[17,72,139,152],"that":[18],"performs":[19],"well":[20],"on":[21,166,172,185],"broad":[23],"range":[24],"of":[25,55,68,71,95,123,164,182],"applications":[26,130],"is":[27],"tedious":[29],"and":[30,170,196],"difficult":[31],"process.":[32],"This":[33],"paper":[34],"introduces":[35],"Meta":[36,45,97],"Optimization,":[37],"methodology":[39],"for":[40,128,156],"automatically":[41,51,82],"fine-tuning":[42],"compiler":[43,56,61,66,85],"heuristics.":[44,57,86,148],"Optimization":[46,98],"uses":[47,77],"machine-learning":[48,75],"techniques":[49,59,184],"search":[52],"space":[54],"Our":[58,74],"reduce":[60],"design":[62],"complexity":[63],"by":[64,135,161],"relieving":[65],"tedium":[70],"tuning.":[73],"system":[76,154],"an":[78,120,162],"evolutionary":[79],"algorithm":[80],"find":[83],"effective":[84],"We":[87,178],"present":[88,114],"promising":[89],"experimental":[90],"results.":[91],"In":[92],"one":[93,111],"mode":[94],"operation":[96],"creates":[99],"application-specific":[100],"which":[102],"often":[103],"result":[104],"in":[105,115,131,189],"impressive":[106],"speedups.":[107],"For":[108],"hyperblock":[109,157,192],"formation,":[110,193],"optimization":[112],"we":[113,118,143],"this":[116,190],"paper,":[117],"obtain":[119],"average":[121,163],"speedup":[122],"23%":[124],"(up":[125],"73%)":[127],"our":[132,153,167,183],"suite.":[133],"Furthermore,":[134],"evolving":[136],"compiler's":[138],"several":[141],"benchmarks,":[142],"can":[144],"create":[145],"effective,":[146],"general-purpose":[147,151],"The":[149],"best":[150],"found":[155],"formation":[158],"improved":[159],"performance":[160],"25%":[165],"training":[168],"set,":[169],"9%":[171],"completely":[174],"unrelated":[175],"test":[176],"set.":[177],"demonstrate":[179],"efficacy":[181],"three":[186],"different":[187],"optimizations":[188],"paper:":[191],"register":[194],"allocation,":[195],"data":[197],"prefetching.":[198]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2022-02-24T00:00:00"}