{"id":"https://openalex.org/W2007519459","doi":"https://doi.org/10.1137/0218014","title":"Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines","display_name":"Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines","publication_year":1989,"publication_date":"1989-04-01","ids":{"openalex":"https://openalex.org/W2007519459","doi":"https://doi.org/10.1137/0218014","mag":"2007519459"},"language":"en","primary_location":{"id":"doi:10.1137/0218014","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218014","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5087688453","display_name":"Gianfranco Bilardi","orcid":"https://orcid.org/0000-0003-0303-8349"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gianfranco Bilardi","raw_affiliation_strings":["Cornell University (Ithaca, NY);"],"affiliations":[{"raw_affiliation_string":"Cornell University (Ithaca, NY);","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102229114","display_name":"Alexandru Nicolau","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexandru Nicolau","raw_affiliation_strings":["Cornell University (Ithaca, NY);"],"affiliations":[{"raw_affiliation_string":"Cornell University (Ithaca, NY);","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087688453"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":3.8247,"has_fulltext":false,"cited_by_count":128,"citation_normalized_percentile":{"value":0.94779376,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"18","issue":"2","first_page":"216","last_page":"228"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7880562543869019},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7763094305992126},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7545620799064636},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.5539879202842712},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5439285635948181},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5378420352935791},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5342352390289307},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4771377742290497},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4509805738925934},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.4320753216743469},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4234231114387512},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39429935812950134},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2558709979057312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20273497700691223}],"concepts":[{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7880562543869019},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7763094305992126},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7545620799064636},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.5539879202842712},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5439285635948181},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5378420352935791},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5342352390289307},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4771377742290497},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4509805738925934},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.4320753216743469},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4234231114387512},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39429935812950134},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2558709979057312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20273497700691223},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0218014","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218014","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:ecommons.cornell.edu:1813/6609","is_oa":false,"landing_page_url":"https://hdl.handle.net/1813/6609","pdf_url":null,"source":{"id":"https://openalex.org/S4306400757","display_name":"eCommons (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"technical report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1836810876","https://openalex.org/W1972559959","https://openalex.org/W1972897119","https://openalex.org/W1974952807","https://openalex.org/W1976284552","https://openalex.org/W1978583881","https://openalex.org/W2015188932","https://openalex.org/W2018729969","https://openalex.org/W2027679733","https://openalex.org/W2064687921","https://openalex.org/W2066104460","https://openalex.org/W2069489095","https://openalex.org/W2070265306","https://openalex.org/W2073491596","https://openalex.org/W2087489294","https://openalex.org/W2089062581","https://openalex.org/W2089828587","https://openalex.org/W2132733020"],"related_works":["https://openalex.org/W2005615533","https://openalex.org/W2743938404","https://openalex.org/W2099271296","https://openalex.org/W2055625272","https://openalex.org/W1838063489","https://openalex.org/W2036758175","https://openalex.org/W1577155814","https://openalex.org/W1545170796","https://openalex.org/W2038796709","https://openalex.org/W1972433940"],"abstract_inverted_index":{"A":[0],"parallel":[1],"algorithm,":[2],"called":[3],"adaptive":[4],"bitonic":[5,62],"sorting,":[6],"that":[7],"runs":[8],"on":[9],"a":[10,16,29,66,80],"PRAC":[11],"(parallel":[12],"random":[13],"access":[14],"computer),":[15],"shared-memory":[17],"multiprocessor":[18],"where":[19],"fetch":[20],"and":[21,78],"store":[22],"conflicts":[23],"are":[24],"disallowed,":[25],"is":[26],"proposed.":[27],"On":[28],"P":[30],"processors":[31],"PRAC,":[32],"the":[33,50],"algorithm":[34],"presented":[35],"here":[36],"achieves":[37],"optimal":[38],"performance":[39],"$TP":[40],"=":[41],"O(N\\log":[42,59],"N)$,":[43],"for":[44],"any":[45],"computation":[46],"time":[47],"T":[48,57],"in":[49],"range":[51],"$\\Omega":[52],"(\\log":[53],"^2":[54],"N)":[55],"\\leqq":[56,58],"N)$.":[60],"Adaptive":[61],"sorting":[63],"also":[64],"has":[65],"small":[67],"constant":[68],"factor,":[69],"since":[70],"it":[71],"performs":[72],"less":[73],"than":[74],"$2N\\log":[75],"N$":[76],"comparisons,":[77],"only":[79],"handful":[81],"of":[82],"operations":[83],"per":[84],"comparison.":[85]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}