{"id":"https://openalex.org/W2002973181","doi":"https://doi.org/10.1145/2000417.2000421","title":"Efficiently exploring compiler optimization sequences with pairwise pruning","display_name":"Efficiently exploring compiler optimization sequences with pairwise pruning","publication_year":2011,"publication_date":"2011-06-05","ids":{"openalex":"https://openalex.org/W2002973181","doi":"https://doi.org/10.1145/2000417.2000421","mag":"2002973181"},"language":"en","primary_location":{"id":"doi:10.1145/2000417.2000421","doi":"https://doi.org/10.1145/2000417.2000421","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2000417.2000421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st International Workshop on Adaptive Self-Tuning Computing Systems for the Exaflop Era","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":"https://openalex.org/A5055733971","display_name":"Milind Chabbi","orcid":"https://orcid.org/0000-0003-1021-7644","observed_orcids":["https://orcid.org/0000-0003-1021-7644"]},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Milind M. Chabbi","raw_affiliation_strings":["Rice University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rice University","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089709469","display_name":"John Mellor\u2010Crummey","orcid":"https://orcid.org/0000-0002-9026-5453","observed_orcids":["https://orcid.org/0000-0002-9026-5453"]},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John M. Mellor-Crummey","raw_affiliation_strings":["Rice University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rice University","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073381111","display_name":"Keith D. Cooper","orcid":"https://orcid.org/0000-0003-4288-4847","observed_orcids":["https://orcid.org/0000-0003-4288-4847"]},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Keith D. Cooper","raw_affiliation_strings":["Rice University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rice University","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":null,"apc_paid":null,"fwci":0.3729,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.47062054,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"34","last_page":"45"},"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.9047999978065491,"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.9047999978065491,"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.05350000038743019,"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"}},{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.008299999870359898,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/search-space-exploration","display_name":"search space exploration","score":0.5580000281333923}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8648975491523743},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.8497668504714966},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.8088935613632202},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6534802913665771},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6407126784324646},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6246442198753357},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6180420517921448},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6126946806907654},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.45447808504104614},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40795978903770447},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40794801712036133},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1816568672657013},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2000417.2000421","doi":"https://doi.org/10.1145/2000417.2000421","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2000417.2000421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st International Workshop on Adaptive Self-Tuning Computing Systems for the Exaflop Era","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G4060576100","display_name":null,"funder_award_id":"AFRL Contract FA8650-09-C-7915","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"}],"funders":[{"id":"https://openalex.org/F4320310133","display_name":"Rice University","ror":"https://ror.org/008zs3103"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320338294","display_name":"Air Force Research Laboratory","ror":"https://ror.org/02e2egq70"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1503172919","https://openalex.org/W1509875415","https://openalex.org/W1511231312","https://openalex.org/W1894930292","https://openalex.org/W1913147546","https://openalex.org/W1964262399","https://openalex.org/W2005985523","https://openalex.org/W2014244478","https://openalex.org/W2025232768","https://openalex.org/W2043724035","https://openalex.org/W2052934867","https://openalex.org/W2056823637","https://openalex.org/W2060108326","https://openalex.org/W2061289507","https://openalex.org/W2072500816","https://openalex.org/W2076346710","https://openalex.org/W2086665685","https://openalex.org/W2087027284","https://openalex.org/W2106296728","https://openalex.org/W2122796178","https://openalex.org/W2139980321","https://openalex.org/W2142079700","https://openalex.org/W2152710595","https://openalex.org/W2157310776","https://openalex.org/W2162737890","https://openalex.org/W2164617852","https://openalex.org/W2167975570","https://openalex.org/W3011457960","https://openalex.org/W3146578712","https://openalex.org/W4249972313","https://openalex.org/W6813405667"],"related_works":["https://openalex.org/W1984845936","https://openalex.org/W2147623728","https://openalex.org/W3204408846","https://openalex.org/W2794836528","https://openalex.org/W3004918411","https://openalex.org/W7100398206","https://openalex.org/W350392096","https://openalex.org/W2052934867","https://openalex.org/W2249134499","https://openalex.org/W7097079798"],"abstract_inverted_index":{"Most":[0],"compilers":[1],"apply":[2,63],"optimizations":[3,18,61,101],"in":[4],"a":[5,65,75,95,98,113],"fixed":[6],"order":[7],"regardless":[8],"of":[9,30,54,59,94,100,109,116,130],"input":[10,45,117],"programs.":[11,46],"However,":[12],"it":[13],"is":[14,40,102],"well":[15],"known":[16],"that":[17,72,123],"can":[19],"have":[20],"enabling,":[21],"and":[22,35,68,121],"disabling":[23],"interactions":[24],"or":[25],"equivalent":[26],"effects.":[27],"The":[28,106],"effects":[29],"interference":[31],"are":[32,119,128],"program":[33,67,96],"specific":[34],"hence":[36],"no":[37],"single":[38],"sequence":[39,99],"universally":[41],"appropriate":[42],"for":[43,56,64,88],"all":[44],"In":[47],"this":[48,80],"paper":[49],"we":[50,126],"explore":[51],"the":[52,91,110,124],"problem":[53,81],"searching":[55,79],"optimal":[57],"sequences":[58],"compiler":[60],"to":[62,78,104],"given":[66],"describe":[69,127],"novel":[70],"strategies":[71],"bring":[73],"us":[74],"step":[76],"closer":[77],"space":[82],"efficiently.":[83],"We":[84],"also":[85],"construct":[86],"models":[87,111],"accurately":[89],"predicting":[90],"runtime":[92],"performance":[93],"when":[97],"applied":[103],"it.":[105],"early":[107],"results":[108],"on":[112],"small":[114],"set":[115],"programs":[118],"encouraging":[120],"suggest":[122],"approaches":[125],"worthy":[129],"further":[131],"consideration.":[132]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}