Sorting and counting networks of small depth and arbitrary width

Costas Busch, Maurice Herlihy

Research output: Contribution to conferencePaper

2 Scopus citations

Abstract

We present the first construction for sorting and counting networks of arbitrary width that uses both small depth and small constant factors. Let w be the product w = p0···pn-1, whose factors are not necessarily prime. We present a novel network construction of width w and depth O(n2) = O(log2w), using comparators (or balancers) of width less than or equal to max(pi). This construction is practical in the sense that the asymptotic notation does not hide any large constants. An interesting aspect of this construction is that it establishes a family of sorting and counting networks of width w, one for each distinct factorization of w. A factorization in which max(pi) is large and n is small yields a network that trades small depth for large comparators (or balancers), and a factorization where max(pi) is small and n is large makes the opposite trade-off.

Original languageEnglish (US)
Pages64-73
Number of pages10
DOIs
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99 - Saint-Malo
Duration: Jun 27 1999Jun 30 1999

Conference

ConferenceProceedings of the 1999 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99
CitySaint-Malo
Period6/27/996/30/99

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality

Fingerprint Dive into the research topics of 'Sorting and counting networks of small depth and arbitrary width'. Together they form a unique fingerprint.

Cite this