{"id":"https://openalex.org/W1984845936","doi":"https://doi.org/10.1145/2400682.2400715","title":"Finding good optimization sequences covering program space","display_name":"Finding good optimization sequences covering program space","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1984845936","doi":"https://doi.org/10.1145/2400682.2400715","mag":"1984845936"},"language":"en","primary_location":{"id":"doi:10.1145/2400682.2400715","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2400682.2400715","pdf_url":null,"source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-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/A5008869877","display_name":"Suresh Purini","orcid":"https://orcid.org/0000-0001-5094-995X"},"institutions":[{"id":"https://openalex.org/I64189192","display_name":"International Institute of Information Technology, Hyderabad","ror":"https://ror.org/05f11g639","country_code":"IN","type":"education","lineage":["https://openalex.org/I64189192"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Suresh Purini","raw_affiliation_strings":["International Institute of Information Technology, Hyderabad, India","[International Institute of Information Technology Hyderabad, India]"],"affiliations":[{"raw_affiliation_string":"International Institute of Information Technology, Hyderabad, India","institution_ids":["https://openalex.org/I64189192"]},{"raw_affiliation_string":"[International Institute of Information Technology Hyderabad, India]","institution_ids":["https://openalex.org/I64189192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009135823","display_name":"Lakshya Jain","orcid":null},"institutions":[{"id":"https://openalex.org/I64189192","display_name":"International Institute of Information Technology, Hyderabad","ror":"https://ror.org/05f11g639","country_code":"IN","type":"education","lineage":["https://openalex.org/I64189192"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Lakshya Jain","raw_affiliation_strings":["International Institute of Information Technology, Hyderabad, India","[International Institute of Information Technology Hyderabad, India]"],"affiliations":[{"raw_affiliation_string":"International Institute of Information Technology, Hyderabad, India","institution_ids":["https://openalex.org/I64189192"]},{"raw_affiliation_string":"[International Institute of Information Technology Hyderabad, India]","institution_ids":["https://openalex.org/I64189192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008869877"],"corresponding_institution_ids":["https://openalex.org/I64189192"],"apc_list":null,"apc_paid":null,"fwci":6.8047,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.9667263,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"9","issue":"4","first_page":"1","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991000294685364,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9976999759674072,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.992900013923645,"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/speedup","display_name":"Speedup","score":0.9365895986557007},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8478266000747681},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7521295547485352},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6768040657043457},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6584668159484863},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5932316780090332},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.5726242661476135},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4565041661262512},{"id":"https://openalex.org/keywords/program-optimization","display_name":"Program optimization","score":0.4189961552619934},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39483335614204407},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3860304057598114},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23438766598701477},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.214313805103302}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.9365895986557007},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8478266000747681},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7521295547485352},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6768040657043457},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6584668159484863},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5932316780090332},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.5726242661476135},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4565041661262512},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.4189961552619934},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39483335614204407},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3860304057598114},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23438766598701477},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.214313805103302},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2400682.2400715","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2400682.2400715","pdf_url":null,"source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1509875415","https://openalex.org/W1623282124","https://openalex.org/W1686420892","https://openalex.org/W1843198456","https://openalex.org/W1967846636","https://openalex.org/W1988659054","https://openalex.org/W1989985614","https://openalex.org/W2005985523","https://openalex.org/W2019751792","https://openalex.org/W2084482561","https://openalex.org/W2091994380","https://openalex.org/W2093708648","https://openalex.org/W2119691711","https://openalex.org/W2137311321","https://openalex.org/W2142079700","https://openalex.org/W2143161696","https://openalex.org/W2143588523","https://openalex.org/W2153185479","https://openalex.org/W2156286566","https://openalex.org/W2156560068","https://openalex.org/W2157310776","https://openalex.org/W2164617852","https://openalex.org/W2166536280","https://openalex.org/W2168519934","https://openalex.org/W2170216784","https://openalex.org/W2998249817","https://openalex.org/W3146578712","https://openalex.org/W4231368563","https://openalex.org/W4234918759"],"related_works":["https://openalex.org/W1601646354","https://openalex.org/W1541585229","https://openalex.org/W1853049011","https://openalex.org/W1606851719","https://openalex.org/W2479014312","https://openalex.org/W1506942559","https://openalex.org/W1583465708","https://openalex.org/W2082035004","https://openalex.org/W4236710543","https://openalex.org/W2295085798"],"abstract_inverted_index":{"The":[0],"compiler":[1],"optimizations":[2],"we":[3,10,85,112,131,170],"enable":[4],"and":[5,69,181,213],"the":[6,21,37,71,107,123,127,134,143,146,154,158,195,205,220],"order":[7],"in":[8,49,106,126,145,204],"which":[9,30,53,120],"apply":[11],"them":[12,50],"on":[13,20,178,185],"a":[14,17,80,88,102,116,138,163],"program":[15,22,34,73,98,124,128,139,159],"have":[16,40],"substantial":[18],"impact":[19],"execution":[23],"time.":[24],"Compilers":[25],"provide":[26],"default":[27,38],"optimization":[28,104],"sequences":[29,39,93,109,118,144,148],"can":[31,54,86,113,132],"give":[32],"good":[33,92,108,117,147],"speedup.":[35],"As":[36],"to":[41,156,176,183],"optimize":[42,55],"programs":[43,180],"with":[44,66],"different":[45,56,192,211],"characteristics,":[46],"they":[47],"embed":[48],"multiple":[51,61],"subsequences":[52,62],"classes":[57,125],"of":[58,77,91,167],"programs.":[59,187],"These":[60],"may":[63],"falsely":[64],"interact":[65],"each":[67],"other":[68],"affect":[70],"potential":[72],"speedup":[74,174],"achievable.":[75],"Instead":[76],"searching":[78],"for":[79,96,137,216],"single":[81],"universally":[82],"optimal":[83],"sequence,":[84],"construct":[87,114],"small":[89],"set":[90,119,165],"such":[94,115],"that":[95],"every":[97],"class":[99],"there":[100],"exists":[101],"near-optimal":[103],"sequence":[105,136,164],"set.":[110,149],"If":[111],"covers":[121],"all":[122,142],"space,":[129],"then":[130],"choose":[133],"best":[135],"by":[140],"trying":[141],"This":[150],"approach":[151,189],"completely":[152],"circumvents":[153],"need":[155],"solve":[157],"classification":[160],"problem.":[161],"Using":[162],"size":[166],"around":[168],"10":[169],"got":[171],"an":[172],"average":[173],"up":[175,182],"14%":[177],"PolyBench":[179],"12%":[184],"MiBench":[186],"Our":[188],"is":[190],"quite":[191],"from":[193],"either":[194],"iterative":[196],"compilation":[197],"or":[198],"machine-learning-based":[199],"prediction":[200],"modeling":[201],"techniques":[202],"proposed":[203],"literature":[206],"so":[207],"far.":[208],"We":[209],"use":[210],"training":[212],"test":[214],"datasets":[215],"cross-validation":[217,222],"as":[218],"against":[219],"Leave-One-Out":[221],"technique.":[223]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}