{"id":"https://openalex.org/W1998624422","doi":"https://doi.org/10.1002/cpe.4330040304","title":"Data parallel sorting for particle simulation","display_name":"Data parallel sorting for particle simulation","publication_year":1992,"publication_date":"1992-05-01","ids":{"openalex":"https://openalex.org/W1998624422","doi":"https://doi.org/10.1002/cpe.4330040304","mag":"1998624422"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.4330040304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330040304","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","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/A5034939669","display_name":"Leonardo Dagum","orcid":null},"institutions":[{"id":"https://openalex.org/I1280536761","display_name":"Ames Research Center","ror":"https://ror.org/02acart68","country_code":"US","type":"facility","lineage":["https://openalex.org/I1280536761","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Leonardo Dagum","raw_affiliation_strings":["NASA Ames Research Center Moffett Field, CA 94035, USA","The author is an employee of Computer Sciences Corporation","NASA-Ames Research Center, Moffett Field, CA 94035 USA"],"affiliations":[{"raw_affiliation_string":"NASA Ames Research Center Moffett Field, CA 94035, USA","institution_ids":["https://openalex.org/I1280536761"]},{"raw_affiliation_string":"The author is an employee of Computer Sciences Corporation","institution_ids":[]},{"raw_affiliation_string":"NASA-Ames Research Center, Moffett Field, CA 94035 USA","institution_ids":["https://openalex.org/I1280536761"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034939669"],"corresponding_institution_ids":["https://openalex.org/I1280536761"],"apc_list":null,"apc_paid":null,"fwci":2.6767,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.89904596,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"4","issue":"3","first_page":"241","last_page":"255"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9970999956130981,"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"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9958000183105469,"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.830980658531189},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7616662979125977},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.7371127009391785},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6540709137916565},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.6333137154579163},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5965414643287659},{"id":"https://openalex.org/keywords/sorting-network","display_name":"Sorting network","score":0.5813980102539062},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.5773769021034241},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4619465470314026},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.435162752866745},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40719136595726013},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32206374406814575},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32141509652137756},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14963677525520325},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.06735661625862122}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.830980658531189},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7616662979125977},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.7371127009391785},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6540709137916565},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6333137154579163},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5965414643287659},{"id":"https://openalex.org/C64540648","wikidata":"https://www.wikidata.org/wiki/Q646477","display_name":"Sorting network","level":4,"score":0.5813980102539062},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.5773769021034241},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4619465470314026},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.435162752866745},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40719136595726013},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32206374406814575},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32141509652137756},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14963677525520325},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06735661625862122},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/cpe.4330040304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330040304","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306101","display_name":"National Aeronautics and Space Administration","ror":"https://ror.org/027ka1x80"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W770215984","https://openalex.org/W1655990431","https://openalex.org/W1667229049","https://openalex.org/W1967810725","https://openalex.org/W1989741444","https://openalex.org/W2023518480","https://openalex.org/W2064086280","https://openalex.org/W2074599161","https://openalex.org/W2076357570","https://openalex.org/W2087977509","https://openalex.org/W2120380453","https://openalex.org/W2156440470","https://openalex.org/W2564051083","https://openalex.org/W4231247593","https://openalex.org/W4237739064","https://openalex.org/W6636101664"],"related_works":["https://openalex.org/W2085265870","https://openalex.org/W2396743875","https://openalex.org/W2362374543","https://openalex.org/W2094179388","https://openalex.org/W2126436988","https://openalex.org/W2325315917","https://openalex.org/W2372558933","https://openalex.org/W2348196682","https://openalex.org/W2385397541","https://openalex.org/W4239051739"],"abstract_inverted_index":{"Abstract":[0],"Sorting":[1],"on":[2,129,152],"a":[3,7,14,64,85,92,108,146],"parallel":[4,56,100],"architecture":[5],"is":[6,21,32,114,133,140],"communications":[8,66],"intensive":[9],"event":[10],"which":[11],"can":[12,68,88],"incur":[13],"high":[15],"penalty":[16],"in":[17,60,84,107,135],"applications":[18],"where":[19],"it":[20],"required.":[22],"In":[23],"the":[24,39,55,70,81,130,153],"case":[25],"of":[26,43,149],"particle":[27,86,109,123],"simulation,":[28,124],"only":[29],"integer":[30],"sorting":[31,57,82],"necessary,":[33],"and":[34,95,125],"sequential":[35],"implementations":[36],"easily":[37],"attain":[38],"minimum":[40,71],"performance":[41,72],"bound":[42,73],"O(N)":[44],"for":[45,122],"N":[46],"particles.":[47],"Parallel":[48],"implementations,":[49],"however,":[50],"have":[51],"to":[52,62,75,91,102,116],"cope":[53],"with":[54],"problem":[58,83,106],"which,":[59],"addition":[61],"incurring":[63],"heavy":[65],"cost,":[67],"make":[69],"difficult":[74],"attain.":[76],"This":[77],"paper":[78],"demonstrates":[79],"how":[80],"simulation":[87],"be":[89,117],"reduced":[90],"merging":[93,105],"problem,":[94],"describes":[96],"an":[97],"efficient":[98],"data":[99],"algorithm":[101,113,139],"solve":[103],"this":[104],"simulation.":[110],"The":[111,137],"new":[112,138],"shown":[115],"optimal":[118],"under":[119],"conditions":[120],"usual":[121],"its":[126],"fieldwise":[127,147],"implementation":[128,148],"Connection":[131,154],"Machine":[132],"analysed":[134],"detail.":[136],"about":[141],"four":[142],"times":[143],"faster":[144],"than":[145],"radix":[150],"sort":[151],"Machine.":[155]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}