{"id":"https://openalex.org/W1982912667","doi":"https://doi.org/10.1145/140901.140907","title":"Optimal sorting on mesh-connected processor arrays","display_name":"Optimal sorting on mesh-connected processor arrays","alternate_titles":[],"publication_year":1992,"publication_date":"1992-06-01","ids":{"openalex":"https://openalex.org/W1982912667","doi":"https://doi.org/10.1145/140901.140907","mag":"1982912667"},"language":"en","primary_location":{"id":"doi:10.1145/140901.140907","doi":"https://doi.org/10.1145/140901.140907","is_oa":true,"landing_page_url":"https://doi.org/10.1145/140901.140907","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/140901.140907","source":{"id":"https://openalex.org/S7407088212","display_name":"ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W1982912667"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/140901.140907","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004643947","display_name":"Christos Kaklamanis","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]},{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Christos Kaklamanis","raw_affiliation_strings":["Aiken Computation Lab Dept. of Computer Science Harvard University University of Rochester Cambridge, MA 02138 Rochester, N}' 14627"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aiken Computation Lab Dept. of Computer Science Harvard University University of Rochester Cambridge, MA 02138 Rochester, N}' 14627","institution_ids":["https://openalex.org/I136199984","https://openalex.org/I5388228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058262792","display_name":"Danny Kriz\u0327anc","orcid":"https://orcid.org/0000-0002-0941-4010","observed_orcids":["https://orcid.org/0000-0002-0941-4010"]},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]},{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Danny Krizanc","raw_affiliation_strings":["Aiken Computation Lab Dept. of Computer Science Harvard University University of Rochester Cambridge, MA 02138 Rochester, N}' 14627"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aiken Computation Lab Dept. of Computer Science Harvard University University of Rochester Cambridge, MA 02138 Rochester, N}' 14627","institution_ids":["https://openalex.org/I136199984","https://openalex.org/I5388228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.5865,"has_fulltext":true,"cited_by_count":39,"citation_normalized_percentile":{"value":0.96572995,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":92},"biblio":{"volume":null,"issue":null,"first_page":"50","last_page":"59"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9731000065803528,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9731000065803528,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.022199999541044235,"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.0020000000949949026,"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/parallel-sorting","display_name":"parallel sorting","score":0.8410000205039978},{"id":"https://openalex.org/keywords/mesh-connected-processor-arrays","display_name":"mesh-connected processor arrays","score":0.8949999809265137},{"id":"https://openalex.org/keywords/optimal-parallel-algorithms","display_name":"optimal parallel algorithms","score":0.5569999814033508},{"id":"https://openalex.org/keywords/diameter-lower-bound","display_name":"diameter lower bound","score":0.8700000047683716},{"id":"https://openalex.org/keywords/parallel-computers","display_name":"parallel computers","score":0.6079999804496765}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7817391157150269},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.728752076625824},{"id":"https://openalex.org/C2778805511","wikidata":"https://www.wikidata.org/wiki/Q1713","display_name":"Citation","level":2,"score":0.700849175453186},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.39942634105682373},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39901164174079895},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.3867277204990387},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.34146562218666077},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17303326725959778}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/140901.140907","doi":"https://doi.org/10.1145/140901.140907","is_oa":true,"landing_page_url":"https://doi.org/10.1145/140901.140907","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/140901.140907","source":{"id":"https://openalex.org/S7407088212","display_name":"ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/140901.140907","doi":"https://doi.org/10.1145/140901.140907","is_oa":true,"landing_page_url":"https://doi.org/10.1145/140901.140907","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/140901.140907","source":{"id":"https://openalex.org/S7407088212","display_name":"ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1982912667.pdf","grobid_xml":"https://content.openalex.org/works/W1982912667.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1530271078","https://openalex.org/W1587590810","https://openalex.org/W1968312484","https://openalex.org/W1968358793","https://openalex.org/W1977908721","https://openalex.org/W2012216209","https://openalex.org/W2033191517","https://openalex.org/W2055469140","https://openalex.org/W2066104460","https://openalex.org/W2089062581","https://openalex.org/W2122545984","https://openalex.org/W2134008688","https://openalex.org/W2137239103","https://openalex.org/W2138848754","https://openalex.org/W2284389895","https://openalex.org/W4243983003"],"related_works":["https://openalex.org/W2066104460","https://openalex.org/W2055469140","https://openalex.org/W2107989947","https://openalex.org/W1519425125","https://openalex.org/W2020821447","https://openalex.org/W2284389895","https://openalex.org/W7099913328","https://openalex.org/W2188475479","https://openalex.org/W1566007376","https://openalex.org/W2059958225"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,119],"sorting":[3],"an":[4,15],"input":[5],"of":[6,104,141],"size":[7],"N":[8],"=":[9],"nz":[10],"can":[11,65],"be":[12,66],"performed":[13],"by":[14,115],"n":[16,18],"x":[17],"mesh-connected":[19],"processor":[20],"array":[21],"in":[22,89],"2n":[23],"+":[24,61],"O(n)":[25],"parallel":[26,136],"communication":[27,132],"steps":[28],"and":[29,102],"using":[30],"constant-size":[31],"queues,":[32],"with":[33],"high":[34,120],"probability.This":[35],"result":[36],"is":[37,87],"optimal":[38],"to":[39,68,91],"within":[40],"a":[41,129,138],"low":[42],"order":[43],"additive":[44],"term,":[45],"realizing":[46],"the":[47,82,100,125],"obvious":[48],"diameter":[49,86,121],"lower":[50],"bound.The":[51],"best":[52],"previously":[53],"known":[54,83],"algorithm":[55],"for":[56,111,134],"this":[57],"problem":[58],"required":[59],"2.5n":[60],"o(n)":[62],"steps.Our":[63],"techniques":[64],"applied":[67],"higher":[69],"dimensional":[70],"meshes":[71],"as":[72,74,124],"well":[73],"torus-connected":[75],"networks,":[76],"achieving":[77],"significantly":[78],"better":[79],"bounds":[80],"than":[81],"results.computers.While":[84],"its":[85,105],"large":[88,139],"comparison":[90],"other":[92],"well-studied":[93],"networks":[94,122],"(e.g.,":[95],"hypercube,":[96],"butterfly,":[97],"shuffle-exchange":[98],"networks),":[99],"simplicity":[101],"regularity":[103],"interconnection":[106],"pattern":[107],"make":[108],"it":[109],"ideal":[110],"VLSI":[112],"implementation.Recent":[113],"work":[114],"Dally":[116],"[Da187]":[117],"suggests":[118],"such":[123],"mesh":[126],"may":[127],"provide":[128],"more":[130],"efficient":[131,142],"medium":[133],"VLSI-based":[135],"computers.Furthermore,":[137],"number":[140],"algorithms":[143],"have":[144],"been":[145]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1982912667","counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
