{"id":"https://openalex.org/W4232288086","doi":"https://doi.org/10.1109/cases.2013.6662511","title":"Exploiting phase inter-dependencies for faster iterative compiler optimization phase order searches","display_name":"Exploiting phase inter-dependencies for faster iterative compiler optimization phase order searches","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W4232288086","doi":"https://doi.org/10.1109/cases.2013.6662511"},"language":"en","primary_location":{"id":"doi:10.1109/cases.2013.6662511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cases.2013.6662511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Compilers, Architecture and Synthesis for Embedded Systems (CASES)","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/A5046412687","display_name":"Michael R. Jantz","orcid":"https://orcid.org/0000-0003-4460-1206"},"institutions":[{"id":"https://openalex.org/I146416000","display_name":"University of Kansas","ror":"https://ror.org/001tmjg57","country_code":"US","type":"education","lineage":["https://openalex.org/I146416000"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael R. Jantz","raw_affiliation_strings":["Electrical Engineering and Computer Science, University of Kansas"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science, University of Kansas","institution_ids":["https://openalex.org/I146416000"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111980656","display_name":"Prasad A. Kulkarni","orcid":null},"institutions":[{"id":"https://openalex.org/I146416000","display_name":"University of Kansas","ror":"https://ror.org/001tmjg57","country_code":"US","type":"education","lineage":["https://openalex.org/I146416000"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasad A. Kulkarni","raw_affiliation_strings":["Electrical Engineering and Computer Science, University of Kansas"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science, University of Kansas","institution_ids":["https://openalex.org/I146416000"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046412687"],"corresponding_institution_ids":["https://openalex.org/I146416000"],"apc_list":null,"apc_paid":null,"fwci":0.6304,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.73430944,"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":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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":1.0,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9987999796867371,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7423483729362488},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6151490211486816},{"id":"https://openalex.org/keywords/phase","display_name":"Phase (matter)","score":0.5668478608131409},{"id":"https://openalex.org/keywords/loop-optimization","display_name":"Loop optimization","score":0.56102454662323},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.5198467373847961},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4524482786655426},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24010944366455078},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.09457486867904663}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7423483729362488},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6151490211486816},{"id":"https://openalex.org/C44280652","wikidata":"https://www.wikidata.org/wiki/Q104837","display_name":"Phase (matter)","level":2,"score":0.5668478608131409},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.56102454662323},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.5198467373847961},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4524482786655426},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24010944366455078},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.09457486867904663},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cases.2013.6662511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cases.2013.6662511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Compilers, Architecture and Synthesis for Embedded Systems (CASES)","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":33,"referenced_works":["https://openalex.org/W350392096","https://openalex.org/W1503794276","https://openalex.org/W1584183132","https://openalex.org/W1686420892","https://openalex.org/W1989985614","https://openalex.org/W1991495385","https://openalex.org/W1997230820","https://openalex.org/W2005985523","https://openalex.org/W2019298113","https://openalex.org/W2022933053","https://openalex.org/W2032094184","https://openalex.org/W2048936605","https://openalex.org/W2052934867","https://openalex.org/W2062868730","https://openalex.org/W2072916763","https://openalex.org/W2077115703","https://openalex.org/W2088056808","https://openalex.org/W2097571405","https://openalex.org/W2106296728","https://openalex.org/W2137311321","https://openalex.org/W2156560068","https://openalex.org/W2164617852","https://openalex.org/W2165273698","https://openalex.org/W2168519934","https://openalex.org/W3183881215","https://openalex.org/W4233328604","https://openalex.org/W4236145149","https://openalex.org/W4238321249","https://openalex.org/W6611808222","https://openalex.org/W6630168693","https://openalex.org/W6635138742","https://openalex.org/W6637151178","https://openalex.org/W6665516833"],"related_works":["https://openalex.org/W1601646354","https://openalex.org/W2479014312","https://openalex.org/W1583465708","https://openalex.org/W2069811640","https://openalex.org/W4232453487","https://openalex.org/W1506090700","https://openalex.org/W1606851719","https://openalex.org/W2045239259","https://openalex.org/W1547259518","https://openalex.org/W1523346846"],"abstract_inverted_index":{"The":[0,191],"problem":[1],"of":[2,10,102,119,122,131,202,224],"finding":[3],"the":[4,15,28,49,89,95,100,117,126,129,146,161,222],"most":[5,56],"effective":[6],"set":[7,130,201],"and":[8,92,137,177,189],"ordering":[9,210],"optimization":[11,25,51,85],"phases":[12,86,132],"to":[13,46,79,87,106,197,220],"generate":[14],"best":[16,153],"quality":[17],"code":[18,155],"is":[19,73],"a":[20,199],"fundamental":[21],"issue":[22],"in":[23,35,55],"compiler":[24],"research.":[26],"Unfortunately,":[27],"exorbitantly":[29],"large":[30],"phase":[31,52,109,163,184,204,209],"order":[32,110,164,185],"search":[33,47,68,90,96,111,141,147,165,174,193],"spaces":[34],"current":[36],"compilers":[37],"make":[38,76],"both":[39],"exhaustive":[40,162],"as":[41,43,217,219],"well":[42,218],"heuristic":[44,229],"approaches":[45],"for":[48,212],"ideal":[50],"combination":[53],"impractical":[54],"cases.":[57],"In":[58],"this":[59],"paper":[60],"we":[61],"show":[62,178],"that":[63,143,206],"one":[64],"important":[65],"reason":[66],"existing":[67],"techniques":[69,105,159],"are":[70],"so":[71],"expensive":[72],"because":[74],"they":[75],"no":[77,150],"attempt":[78],"exploit":[80],"well-known":[81],"independence":[82],"relationships":[83],"between":[84],"reduce":[88,145],"space,":[91],"correspondingly":[93],"improve":[94,221],"time.":[97],"We":[98],"explore":[99],"impact":[101],"two":[103],"complementary":[104],"prune":[107,160],"typical":[108],"spaces.":[112],"Our":[113],"first":[114],"technique":[115],"studies":[116],"effect":[118,151],"implicit":[120],"application":[121],"cleanup":[123],"phases,":[124],"while":[125],"other":[127],"partitions":[128],"into":[133],"mutually":[134],"independent":[135],"groups":[136],"develops":[138],"new":[139],"multi-stage":[140],"algorithms":[142],"substantially":[144],"time":[148],"with":[149],"on":[152,170],"delivered":[154],"performance.":[156],"Together,":[157],"our":[158,214,225],"space":[166,175,194],"size":[167],"by":[168],"89%,":[169],"average,":[171],"(96.75%":[172],"total":[173],"reduction)":[176],"immense":[179],"potential":[180],"at":[181],"making":[182],"iterative":[183],"searches":[186],"more":[187],"feasible":[188],"practical.":[190],"pruned":[192],"enables":[195],"us":[196],"find":[198],"small":[200],"distinct":[203],"sequences":[205],"reach":[207],"near-optimal":[208],"performance":[211],"all":[213],"benchmark":[215],"functions":[216],"behavior":[223],"genetic":[226],"algorithm":[227],"based":[228],"search.":[230]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}