{"id":"https://openalex.org/W2136440628","doi":"https://doi.org/10.1109/clustr.2008.4663803","title":"A comparison of search heuristics for empirical code optimization","display_name":"A comparison of search heuristics for empirical code optimization","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2136440628","doi":"https://doi.org/10.1109/clustr.2008.4663803","mag":"2136440628"},"language":"en","primary_location":{"id":"doi:10.1109/clustr.2008.4663803","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clustr.2008.4663803","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Cluster Computing","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/A5069239197","display_name":"Keith Seymour","orcid":"https://orcid.org/0000-0003-0850-2745"},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Keith Seymour","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, University of Tennessee, Knoxville, TN, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Tennessee, Knoxville, TN, USA","institution_ids":["https://openalex.org/I75027704"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017918038","display_name":"Haihang You","orcid":"https://orcid.org/0009-0005-9031-9430"},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haihang You","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, University of Tennessee, Knoxville, TN, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Tennessee, Knoxville, TN, USA","institution_ids":["https://openalex.org/I75027704"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112121243","display_name":"Jack Dongarra","orcid":null},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]},{"id":"https://openalex.org/I1289243028","display_name":"Oak Ridge National Laboratory","ror":"https://ror.org/01qz5mb56","country_code":"US","type":"facility","lineage":["https://openalex.org/I1289243028","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I4210159294"]},{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Jack Dongarra","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, University of Tennessee, Knoxville, TN, USA","Oak Ridge National Laboratory, Oak Ridge, TN, USA","University of Manchester, Institute of Science and Technology, Manchester, UK"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Tennessee, Knoxville, TN, USA","institution_ids":["https://openalex.org/I75027704"]},{"raw_affiliation_string":"Oak Ridge National Laboratory, Oak Ridge, TN, USA","institution_ids":["https://openalex.org/I1289243028"]},{"raw_affiliation_string":"University of Manchester, Institute of Science and Technology, Manchester, UK","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069239197"],"corresponding_institution_ids":["https://openalex.org/I75027704"],"apc_list":null,"apc_paid":null,"fwci":6.4525,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.96299382,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"421","last_page":"429"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9965000152587891,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9965000152587891,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.996399998664856,"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.993399977684021,"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/simulated-annealing","display_name":"Simulated annealing","score":0.6944823861122131},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6651533842086792},{"id":"https://openalex.org/keywords/random-search","display_name":"Random search","score":0.6338611841201782},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6314258575439453},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6007674336433411},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5670965313911438},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5590612888336182},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.475935697555542},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.47578608989715576},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4735133945941925},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4626207649707794},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4446884095668793},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.4292861521244049},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3902094066143036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20898762345314026}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6944823861122131},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6651533842086792},{"id":"https://openalex.org/C126661757","wikidata":"https://www.wikidata.org/wiki/Q4925641","display_name":"Random search","level":2,"score":0.6338611841201782},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6314258575439453},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6007674336433411},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5670965313911438},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5590612888336182},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.475935697555542},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.47578608989715576},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4735133945941925},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4626207649707794},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4446884095668793},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.4292861521244049},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3902094066143036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20898762345314026},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/clustr.2008.4663803","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clustr.2008.4663803","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Cluster Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.214.4397","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.4397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.netlib.org/netlib/utk/people/JackDongarra/PAPERS/gco_search.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/5642af18-ba68-4465-8a3b-fd7f576d1f26","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/5642af18-ba68-4465-8a3b-fd7f576d1f26","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Seymour, K, You, H & Dongarra, J 2008, A comparison of search heuristics for empirical code optimization. in Proceedings - IEEE International Conference on Cluster Computing, ICCC|Proc. IEEE Int. Conf. Cluster Comput. ICCC. IEEE, pp. 421-429, 2008 IEEE International Conference on Cluster Computing, CCGRID 2008, Tsukuba, 1/07/08. https://doi.org/10.1109/CLUSTR.2008.4663803","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.atira.dk:publications/5642af18-ba68-4465-8a3b-fd7f576d1f26","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/rec/bibtex/conf/cluster/SeymourYD08.xml","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Seymour, K, You, H & Dongarra, J 2008, A comparison of search heuristics for empirical code optimization. in Proceedings - IEEE International Conference on Cluster Computing, ICCC|Proc. IEEE Int. Conf. Cluster Comput. ICCC. IEEE, pp. 421-429, 2008 IEEE International Conference on Cluster Computing, CCGRID 2008, Tsukuba, 1/07/08. https://doi.org/10.1109/CLUSTR.2008.4663803","raw_type":"info:eu-repo/semantics/conferenceObject"}],"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/W1489943243","https://openalex.org/W1500117749","https://openalex.org/W1509875415","https://openalex.org/W1511231312","https://openalex.org/W1565751843","https://openalex.org/W1888974726","https://openalex.org/W1964031104","https://openalex.org/W1965351873","https://openalex.org/W1972209410","https://openalex.org/W1998492046","https://openalex.org/W2024060531","https://openalex.org/W2024991751","https://openalex.org/W2096070062","https://openalex.org/W2098688018","https://openalex.org/W2108315152","https://openalex.org/W2112502633","https://openalex.org/W2136952590","https://openalex.org/W2140691217","https://openalex.org/W2148542244","https://openalex.org/W2152195021","https://openalex.org/W2153637321","https://openalex.org/W2169600442","https://openalex.org/W2917423752","https://openalex.org/W4238255529","https://openalex.org/W4243796884","https://openalex.org/W4245206864","https://openalex.org/W6629303505","https://openalex.org/W6639586494","https://openalex.org/W6759736827"],"related_works":["https://openalex.org/W4386269615","https://openalex.org/W2794473043","https://openalex.org/W2056379908","https://openalex.org/W1521720388","https://openalex.org/W2008047931","https://openalex.org/W2088347110","https://openalex.org/W4312928368","https://openalex.org/W286460591","https://openalex.org/W2100400127","https://openalex.org/W3101608607"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"the":[3,10,28,32,36,40,48,57,77,80],"application":[4],"of":[5,12,24,31,38,59,76,79],"various":[6],"search":[7,18,33,73],"techniques":[8],"to":[9,46],"problem":[11],"automatic":[13],"empirical":[14],"code":[15],"optimization.":[16],"The":[17],"process":[19],"is":[20],"a":[21],"critical":[22],"aspect":[23],"auto-tuning":[25],"systems":[26],"because":[27],"large":[29],"size":[30],"space":[34],"and":[35,71],"cost":[37],"evaluating":[39],"candidate":[41,82],"implementations":[42],"makes":[43],"it":[44],"infeasible":[45],"find":[47],"true":[49],"optimum":[50],"point":[51],"by":[52],"brute":[53],"force.":[54],"We":[55],"evaluate":[56],"effectiveness":[58],"Nelder-Mead":[60],"Simplex,":[61],"Genetic":[62],"Algorithms,":[63],"Simulated":[64],"Annealing,":[65],"Particle":[66],"Swarm":[67],"Optimization,":[68],"Orthogonal":[69],"search,":[70],"Random":[72],"in":[74],"terms":[75],"performance":[78],"best":[81],"found":[83],"under":[84],"varying":[85],"time":[86],"limits.":[87]},"counts_by_year":[{"year":2024,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}