{"id":"https://openalex.org/W2025913682","doi":"https://doi.org/10.1142/s0129626499000098","title":"EFFICIENT DETERMINISTIC SORTING ON THE BSP MODEL","display_name":"EFFICIENT DETERMINISTIC SORTING ON THE BSP MODEL","alternate_titles":[],"publication_year":1999,"publication_date":"1999-03-01","ids":{"openalex":"https://openalex.org/W2025913682","doi":"https://doi.org/10.1142/s0129626499000098","mag":"2025913682"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626499000098","doi":"https://doi.org/10.1142/s0129626499000098","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626499000098","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-4"],"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2025913682"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5010296758","display_name":"Alexandros V. Gerbessiotis","orcid":"https://orcid.org/0000-0003-3268-1579","observed_orcids":["https://orcid.org/0000-0003-3268-1579"]},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"ALEXANDROS V. GERBESSIOTIS","raw_affiliation_strings":["Programming Research Group, Computing Laboratory, Oxford University, Oxford, OX1 3QD, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Programming Research Group, Computing Laboratory, Oxford University, Oxford, OX1 3QD, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064579630","display_name":"Constantinos J. Siniolakis","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"CONSTANTINOS J. SINIOLAKIS","raw_affiliation_strings":["Programming Research Group, Computing Laboratory, Oxford University, Oxford, OX1 3QD, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Programming Research Group, Computing Laboratory, Oxford University, Oxford, OX1 3QD, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":2.0115,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.86276276,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":96},"biblio":{"volume":"09","issue":"01","first_page":"69","last_page":"79"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.8525000214576721,"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.8525000214576721,"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/T11269","display_name":"Algorithms and Data Compression","score":0.04309999942779541,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.020999999716877937,"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/bulk-synchronous-parallel","display_name":"Bulk Synchronous Parallel model","score":0.9739999771118164},{"id":"https://openalex.org/keywords/parallel-sorting","display_name":"parallel sorting","score":0.7440000176429749},{"id":"https://openalex.org/keywords/partitioning-schemes","display_name":"partitioning schemes","score":0.6430000066757202},{"id":"https://openalex.org/keywords/sampling","display_name":"sampling","score":0.7020000219345093},{"id":"https://openalex.org/keywords/speedup","display_name":"speedup","score":0.6549999713897705},{"id":"https://openalex.org/keywords/worst-case-analysis","display_name":"worst-case analysis","score":0.6190000176429749},{"id":"https://openalex.org/keywords/load-imbalance","display_name":"load imbalance","score":0.6269999742507935},{"id":"https://openalex.org/keywords/key-distribution","display_name":"key distribution","score":0.6150000095367432}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.828362226486206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7196557521820068},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7066366076469421},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6389279365539551},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6335027813911438},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5575650930404663},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5567488670349121},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5187897086143494},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4958573281764984},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4925249516963959},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.48319900035858154},{"id":"https://openalex.org/C2778937211","wikidata":"https://www.wikidata.org/wiki/Q486598","display_name":"Quicksort","level":4,"score":0.47675642371177673},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.42194488644599915},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2578999400138855},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0129626499000098","doi":"https://doi.org/10.1142/s0129626499000098","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626499000098","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-4"],"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.25.8139","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.8139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.njit.edu/~alexg/pubs/papers/PRG1996.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.25.9699","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.9699","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.njit.edu/~alexg/pubs/papers/PRG1996r.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1808157072","https://openalex.org/W1975934607","https://openalex.org/W1978583881","https://openalex.org/W2045271686","https://openalex.org/W2087489294","https://openalex.org/W2092574257","https://openalex.org/W2137239103"],"related_works":["https://openalex.org/W7101078943","https://openalex.org/W2100450097","https://openalex.org/W2002509291","https://openalex.org/W1749468754","https://openalex.org/W7097709522","https://openalex.org/W2105909411","https://openalex.org/W7098796175","https://openalex.org/W2391303559","https://openalex.org/W2103370535","https://openalex.org/W1497408952"],"abstract_inverted_index":{"We":[0,16],"present":[1],"a":[2,21,46,62],"new":[3],"algorithm":[4,58],"for":[5,61],"deterministic":[6],"sorting":[7],"on":[8,75],"the":[9,26,51,66,70],"Bulk-Synchronous":[10],"Parallel":[11],"(BSP)":[12],"model":[13],"of":[14,28,50,65],"computation.":[15],"sort":[17],"n":[18],"keys":[19],"using":[20],"partitioning":[22],"scheme":[23],"that":[24,72],"achieves":[25],"requirements":[27],"efficiency":[29],"(one-optimality)":[30],"and":[31],"insensitivity":[32],"against":[33],"initial":[34],"key":[35],"distribution.":[36],"Although":[37],"we":[38,44],"employ":[39],"sampling":[40],"to":[41],"realize":[42],"efficiency,":[43],"give":[45],"precise":[47],"worst-case":[48],"estimation":[49],"maximum":[52],"imbalance":[53],"which":[54],"might":[55],"occur.":[56],"The":[57],"is":[59,78],"one-optimal":[60],"wide":[63],"range":[64],"BSP":[67],"parameters":[68],"in":[69],"sense":[71],"its":[73],"speedup":[74],"p":[76],"processors":[77],"asymptotically":[79],"(1":[80],"-":[81],"o(1))p.":[82]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2025913682","counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
