{"id":"https://openalex.org/W2610467942","doi":"https://doi.org/10.1145/2464996.2465018","title":"Automatically adapting programs for mixed-precision floating-point computation","display_name":"Automatically adapting programs for mixed-precision floating-point computation","publication_year":2013,"publication_date":"2013-05-28","ids":{"openalex":"https://openalex.org/W2610467942","doi":"https://doi.org/10.1145/2464996.2465018","mag":"2610467942"},"language":"en","primary_location":{"id":"doi:10.1145/2464996.2465018","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2464996.2465018","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th international ACM conference on International conference on supercomputing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5083230952","display_name":"Michael O. Lam","orcid":"https://orcid.org/0000-0002-9415-5534"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael O. Lam","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113657683","display_name":"Jeffrey K. Hollingsworth","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey K. Hollingsworth","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058719424","display_name":"Bronis R. de Supinski","orcid":"https://orcid.org/0000-0002-0339-1006"},"institutions":[{"id":"https://openalex.org/I1282311441","display_name":"Lawrence Livermore National Laboratory","ror":"https://ror.org/041nk4h53","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282311441","https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210138311"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bronis R. de Supinski","raw_affiliation_strings":["Lawrence Livermore National Laboratory, Livermore, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lawrence Livermore National Laboratory, Livermore, CA, USA","institution_ids":["https://openalex.org/I1282311441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109361411","display_name":"Matthew LeGendre","orcid":null},"institutions":[{"id":"https://openalex.org/I1282311441","display_name":"Lawrence Livermore National Laboratory","ror":"https://ror.org/041nk4h53","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282311441","https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210138311"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew P. Legendre","raw_affiliation_strings":["Lawrence Livermore National Laboratory, Livermore, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lawrence Livermore National Laboratory, Livermore, CA, USA","institution_ids":["https://openalex.org/I1282311441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":114,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"369","last_page":"378"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9991000294685364,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9790999889373779,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8472621440887451},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6775729656219482},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6405117511749268},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5846100449562073},{"id":"https://openalex.org/keywords/replicate","display_name":"Replicate","score":0.5788053274154663},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5693964958190918},{"id":"https://openalex.org/keywords/double-precision-floating-point-format","display_name":"Double-precision floating-point format","score":0.5565208196640015},{"id":"https://openalex.org/keywords/floating-point","display_name":"Floating point","score":0.553402304649353},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5497730374336243},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.5001242160797119},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48737484216690063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48085886240005493},{"id":"https://openalex.org/keywords/instrumentation","display_name":"Instrumentation (computer programming)","score":0.47847458720207214},{"id":"https://openalex.org/keywords/instruction-set","display_name":"Instruction set","score":0.44114089012145996},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4279695749282837},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4143734276294708},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.113009512424469}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8472621440887451},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6775729656219482},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6405117511749268},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5846100449562073},{"id":"https://openalex.org/C2781162219","wikidata":"https://www.wikidata.org/wiki/Q26250693","display_name":"Replicate","level":2,"score":0.5788053274154663},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5693964958190918},{"id":"https://openalex.org/C35912277","wikidata":"https://www.wikidata.org/wiki/Q1243369","display_name":"Double-precision floating-point format","level":3,"score":0.5565208196640015},{"id":"https://openalex.org/C84211073","wikidata":"https://www.wikidata.org/wiki/Q117879","display_name":"Floating point","level":2,"score":0.553402304649353},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5497730374336243},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.5001242160797119},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48737484216690063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48085886240005493},{"id":"https://openalex.org/C118530786","wikidata":"https://www.wikidata.org/wiki/Q1134732","display_name":"Instrumentation (computer programming)","level":2,"score":0.47847458720207214},{"id":"https://openalex.org/C202491316","wikidata":"https://www.wikidata.org/wiki/Q272683","display_name":"Instruction set","level":2,"score":0.44114089012145996},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4279695749282837},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4143734276294708},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.113009512424469},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2464996.2465018","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2464996.2465018","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th international ACM conference on International conference on supercomputing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.5400000214576721,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W14594738","https://openalex.org/W122373347","https://openalex.org/W307918303","https://openalex.org/W1526045365","https://openalex.org/W1531068736","https://openalex.org/W1534398032","https://openalex.org/W1548182513","https://openalex.org/W1572171512","https://openalex.org/W1768849904","https://openalex.org/W1822341686","https://openalex.org/W1966287322","https://openalex.org/W1969895121","https://openalex.org/W1974312429","https://openalex.org/W1977074555","https://openalex.org/W1977146902","https://openalex.org/W1986969990","https://openalex.org/W1993882873","https://openalex.org/W1995574761","https://openalex.org/W2009259487","https://openalex.org/W2015624751","https://openalex.org/W2018136118","https://openalex.org/W2020804487","https://openalex.org/W2021344963","https://openalex.org/W2037724609","https://openalex.org/W2038205735","https://openalex.org/W2064221402","https://openalex.org/W2076463646","https://openalex.org/W2080794684","https://openalex.org/W2104281151","https://openalex.org/W2105524676","https://openalex.org/W2109955300","https://openalex.org/W2111593426","https://openalex.org/W2117752372","https://openalex.org/W2129891179","https://openalex.org/W2134633067","https://openalex.org/W2139611370","https://openalex.org/W2155967869","https://openalex.org/W2159937165","https://openalex.org/W2160468841","https://openalex.org/W2169004268","https://openalex.org/W2485405443","https://openalex.org/W2564554657","https://openalex.org/W3022909171","https://openalex.org/W4239813889","https://openalex.org/W6631615826","https://openalex.org/W6641625552"],"related_works":["https://openalex.org/W2045177269","https://openalex.org/W3215589575","https://openalex.org/W2336476964","https://openalex.org/W3150959508","https://openalex.org/W1571090276","https://openalex.org/W2773283032","https://openalex.org/W2012407419","https://openalex.org/W4297795876","https://openalex.org/W2565957982","https://openalex.org/W2159645853"],"abstract_inverted_index":{"As":[0],"scientific":[1],"computation":[2],"continues":[3],"to":[4,19,50,66,77,85,107],"scale,":[5],"efficient":[6],"use":[7,78,115],"of":[8,70,98,110,161],"floating-point":[9,99],"arithmetic":[10],"processors":[11],"is":[12,39,127],"critical.":[13],"Lower":[14],"precision":[15,37],"allows":[16,83],"streaming":[17],"architectures":[18],"perform":[20],"more":[21],"operations":[22],"per":[23],"second":[24],"and":[25,46,64,94,129,150],"can":[26,114,146],"reduce":[27],"memory":[28],"bandwidth":[29],"pressure":[30],"on":[31],"all":[32],"architectures.":[33],"However,":[34],"using":[35],"a":[36,43,58,103,159],"that":[38,60,73,113,124,143],"too":[40],"low":[41,131],"for":[42,120],"given":[44],"algorithm":[45,106],"data":[47],"set":[48],"leads":[49],"inaccurate":[51],"results.":[52],"In":[53,139],"this":[54],"paper,":[55],"we":[56,141,157],"present":[57],"framework":[59,82,126],"uses":[61],"binary":[62],"instrumentation":[63],"modification":[65],"build":[67],"mixed-precision":[68,87],"configurations":[69,88],"existing":[71],"binaries":[72],"were":[74],"originally":[75],"developed":[76],"only":[79],"double-precision.":[80],"This":[81],"developers":[84],"explore":[86],"without":[89],"modifying":[90],"their":[91],"source":[92],"code,":[93],"it":[95],"permits":[96],"autotuning":[97],"precision.":[100,117],"We":[101],"include":[102],"simple":[104],"search":[105],"automate":[108],"identification":[109],"code":[111],"regions":[112],"lower":[116],"Our":[118],"results":[119],"several":[121],"benchmarks":[122],"show":[123],"our":[125,144],"effective":[128],"incurs":[130],"overhead":[132],"(less":[133],"than":[134],"10X":[135],"in":[136,154],"most":[137],"cases).":[138],"addition,":[140],"demonstrate":[142],"tool":[145],"replicate":[147],"manual":[148],"conversions":[149],"suggest":[151],"further":[152],"optimization;":[153],"one":[155],"case,":[156],"achieve":[158],"speedup":[160],"2X.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
