{"id":"https://openalex.org/W3113661224","doi":"https://doi.org/10.1109/hpec43674.2020.9286240","title":"Work-Efficient Parallel Algorithms for Accurate Floating-Point Prefix Sums","display_name":"Work-Efficient Parallel Algorithms for Accurate Floating-Point Prefix Sums","publication_year":2020,"publication_date":"2020-09-22","ids":{"openalex":"https://openalex.org/W3113661224","doi":"https://doi.org/10.1109/hpec43674.2020.9286240","mag":"3113661224"},"language":"en","primary_location":{"id":"doi:10.1109/hpec43674.2020.9286240","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec43674.2020.9286240","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/1721.1/143740","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008235208","display_name":"Sean Fraser","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sean Fraser","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory MIT, Cambridge, MA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory MIT, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101649586","display_name":"Helen Xu","orcid":"https://orcid.org/0000-0003-2232-3305"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Helen Xu","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory MIT, Cambridge, MA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory MIT, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027618658","display_name":"Charles E. Leiserson","orcid":"https://orcid.org/0000-0001-6386-5552"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Charles E. Leiserson","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory MIT, Cambridge, MA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory MIT, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008235208"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.2357,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.52784435,"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":"7"},"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.9995999932289124,"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.9995999932289124,"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.9994999766349792,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7274803519248962},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6734391450881958},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5884122848510742},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5877645015716553},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5617790222167969},{"id":"https://openalex.org/keywords/floating-point","display_name":"Floating point","score":0.5408779382705688},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4611975848674774},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4347586929798126},{"id":"https://openalex.org/keywords/supercomputer","display_name":"Supercomputer","score":0.4328899085521698}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7274803519248962},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6734391450881958},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5884122848510742},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5877645015716553},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5617790222167969},{"id":"https://openalex.org/C84211073","wikidata":"https://www.wikidata.org/wiki/Q117879","display_name":"Floating point","level":2,"score":0.5408779382705688},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4611975848674774},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4347586929798126},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.4328899085521698},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/hpec43674.2020.9286240","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec43674.2020.9286240","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/143740","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/143740","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/143740","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/143740","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure"}],"awards":[{"id":"https://openalex.org/G6188232864","display_name":null,"funder_award_id":"1533644","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332550","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1595783387","https://openalex.org/W1963965124","https://openalex.org/W1967810725","https://openalex.org/W1986624837","https://openalex.org/W2016558956","https://openalex.org/W2020804487","https://openalex.org/W2053987390","https://openalex.org/W2095595785","https://openalex.org/W2098297530","https://openalex.org/W2119588908","https://openalex.org/W2153185479","https://openalex.org/W2161061943","https://openalex.org/W2581356531","https://openalex.org/W2752885492","https://openalex.org/W2945097505","https://openalex.org/W3022909171","https://openalex.org/W4237194902","https://openalex.org/W4246166885","https://openalex.org/W4246219036","https://openalex.org/W6635487903","https://openalex.org/W6655892977","https://openalex.org/W6683923952"],"related_works":["https://openalex.org/W2384867379","https://openalex.org/W3196321793","https://openalex.org/W3080705045","https://openalex.org/W3214280620","https://openalex.org/W2329539859","https://openalex.org/W3191490922","https://openalex.org/W2385527937","https://openalex.org/W2765823764","https://openalex.org/W2005880840","https://openalex.org/W4385305499"],"abstract_inverted_index":{"Existing":[0],"work-efficient":[1],"parallel":[2],"algorithms":[3,21],"for":[4,119],"floating-point":[5,93],"prefix":[6],"sums":[7],"exhibit":[8],"either":[9],"good":[10,13],"performance":[11,33,70],"or":[12,151],"numerical":[14],"accuracy,":[15,128],"but":[16,121],"not":[17],"both.":[18],"Consequently,":[19],"prefix-sum":[20,58],"cannot":[22],"easily":[23],"be":[24],"used":[25],"in":[26,132],"scientific-computing":[27],"applications":[28],"that":[29,54,100,108],"require":[30],"both":[31,129],"high":[32,127],"and":[34,39,46,103,131],"accuracy.":[35],"We":[36],"have":[37],"designed":[38,124],"implemented":[40],"two":[41,112,139],"new":[42],"algorithms,":[43],"called":[44],"CAST_BLK":[45,102],"PAIR_BLK,":[47],"whose":[48],"accuracy":[49,148],"is":[50,95],"significantly":[51],"higher":[52,98,106],"than":[53,99,107],"of":[55,81,89,101,109,147],"the":[56,61,76,82,115,153],"high-performing":[57],"algorithm":[59],"from":[60],"Problem":[62],"Based":[63],"Benchmark":[64],"Suite,":[65],"while":[66,156],"running":[67],"with":[68],"comparable":[69],"on":[71,85],"modern":[72],"multicore":[73],"machines.":[74],"Specifically,":[75],"root":[77],"mean":[78],"squared":[79],"error":[80],"PBBS":[83,116,154],"code":[84,155],"a":[86,144],"large":[87],"array":[88],"uniformly":[90],"distributed":[91],"64-bit":[92],"numbers":[94],"8":[96],"times":[97,105],"5.8":[104],"PAIR_BLK.":[110],"These":[111],"codes":[113,141],"employ":[114],"three-stage":[117],"strategy":[118],"performance,":[120],"they":[122],"are":[123],"to":[125,137,149],"achieve":[126],"theoretically":[130],"practice.":[133],"A":[134],"vectorization":[135],"enhancement":[136],"these":[138],"scalar":[140],"trades":[142],"off":[143],"small":[145],"amount":[146],"match":[150],"outperform":[152],"still":[157],"maintaining":[158],"lower":[159],"error.":[160]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}