{"id":"https://openalex.org/W4378895316","doi":"https://doi.org/10.1145/3558481.3591076","title":"Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting","display_name":"Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting","publication_year":2023,"publication_date":"2023-05-31","ids":{"openalex":"https://openalex.org/W4378895316","doi":"https://doi.org/10.1145/3558481.3591076"},"language":"en","primary_location":{"id":"doi:10.1145/3558481.3591076","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3558481.3591076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","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/A5100706287","display_name":"Wentao Yang","orcid":"https://orcid.org/0009-0001-2252-0651"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wentao Yang","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, Urbana, IL, USA"],"raw_orcid":"https://orcid.org/0009-0001-2252-0651","affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023523783","display_name":"Vipul Harsh","orcid":"https://orcid.org/0009-0004-4767-945X"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vipul Harsh","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, Urbana, IL, USA"],"raw_orcid":"https://orcid.org/0009-0004-4767-945X","affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022838370","display_name":"Edgar Solomonik","orcid":"https://orcid.org/0000-0002-6480-9066"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edgar Solomonik","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, Urbana, IL, USA"],"raw_orcid":"https://orcid.org/0000-0002-6480-9066","affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"467","last_page":"478"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9980000257492065,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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/sorting","display_name":"Sorting","score":0.7534880638122559},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7364322543144226},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.709624171257019},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.6848921179771423},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.6282980442047119},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.578327476978302},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5229195356369019},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5089094638824463},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47990286350250244},{"id":"https://openalex.org/keywords/quicksort","display_name":"Quicksort","score":0.45053762197494507},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43652117252349854},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.4278016984462738},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4162610173225403},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41014474630355835},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40000367164611816},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.08766180276870728}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7534880638122559},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7364322543144226},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.709624171257019},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.6848921179771423},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.6282980442047119},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.578327476978302},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5229195356369019},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5089094638824463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47990286350250244},{"id":"https://openalex.org/C2778937211","wikidata":"https://www.wikidata.org/wiki/Q486598","display_name":"Quicksort","level":4,"score":0.45053762197494507},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43652117252349854},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4278016984462738},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4162610173225403},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41014474630355835},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40000367164611816},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.08766180276870728},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3558481.3591076","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3558481.3591076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","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":22,"referenced_works":["https://openalex.org/W1531368347","https://openalex.org/W1964424852","https://openalex.org/W1975755183","https://openalex.org/W1978583881","https://openalex.org/W2012255008","https://openalex.org/W2041097097","https://openalex.org/W2045271686","https://openalex.org/W2051586153","https://openalex.org/W2065457989","https://openalex.org/W2086440998","https://openalex.org/W2089064856","https://openalex.org/W2092720654","https://openalex.org/W2137239103","https://openalex.org/W2140042409","https://openalex.org/W2141389982","https://openalex.org/W2147418091","https://openalex.org/W2479613957","https://openalex.org/W2962896124","https://openalex.org/W3007485872","https://openalex.org/W6721735239","https://openalex.org/W6739075542","https://openalex.org/W6747067108"],"related_works":["https://openalex.org/W2389598404","https://openalex.org/W1493296159","https://openalex.org/W4320925713","https://openalex.org/W76067348","https://openalex.org/W2065192940","https://openalex.org/W2908348257","https://openalex.org/W2037221665","https://openalex.org/W2144222125","https://openalex.org/W2607162667","https://openalex.org/W2522913298"],"abstract_inverted_index":{"State-of-the-art":[0],"parallel":[1],"sorting":[2],"algorithms":[3,30],"for":[4,128],"distributed-memory":[5],"architectures":[6],"are":[7],"based":[8],"on":[9,61,75],"computing":[10],"a":[11,46,70,99,158],"balanced":[12,71],"partitioning":[13],"via":[14],"sampling":[15],"and":[16,58,143,163],"histogramming.":[17],"By":[18],"finding":[19],"samples":[20,53,91,109,125],"that":[21,80,97,102,104,133],"partition":[22],"the":[23,32,49,62,121,153,168],"sorted":[24],"keys":[25],"into":[26],"evenly-sized":[27],"chunks,":[28],"these":[29],"minimize":[31],"number":[33,51,63],"of":[34,41,52,64,171],"communication":[35],"rounds":[36,66,87],"required.":[37],"Histogramming":[38],"(computing":[39],"positions":[40],"samples)":[42],"guides":[43],"sampling,":[44],"enabling":[45],"decrease":[47],"in":[48],"overall":[50],"collected.":[54],"We":[55,73,95],"derive":[56,152],"lower":[57,100,126,154],"upper":[59],"bounds":[60],"sampling/histogramming":[65],"required":[67],"to":[68,78],"compute":[69],"partitioning.":[72],"improve":[74],"prior":[76],"results":[77,166],"demonstrate":[79],"when":[81],"using":[82],"p":[83],"processors,":[84],"O(log*":[85],"p)":[86,90,116,124],"with":[88,98,107],"O(p/log*":[89],"per":[92,110],"round":[93,111,136],"suffice.":[94],"match":[96],"bound":[101,127],"shows":[103],"any":[105],"algorithm":[106],"O(p)":[108],"requires":[112],"at":[113],"least":[114],"\u03a9(log*":[115],"rounds.":[117],"Additionally,":[118],"we":[119,156],"prove":[120],"\u03a9(p":[122],"log":[123],"one":[129,135],"round,":[130],"thus":[131],"proving":[132],"existing":[134],"algorithms:":[137],"sample":[138,148],"sort,":[139],"AMS":[140],"sort":[141],"[2]":[142],"HSS":[144],"[16]":[145],"have":[146],"optimal":[147],"size":[149],"complexity.":[150],"To":[151],"bound,":[155],"propose":[157],"hard":[159],"randomized":[160],"input":[161],"distribution":[162,169],"apply":[164],"classical":[165],"from":[167],"theory":[170],"runs.":[172]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}