## 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 = p_{0}···p_{n-1}, whose factors are not necessarily prime. We present a novel network construction of width w and depth O(n^{2}) = O(log^{2}w), using comparators (or balancers) of width less than or equal to max(p_{i}). 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(p_{i}) is large and n is small yields a network that trades small depth for large comparators (or balancers), and a factorization where max(p_{i}) is small and n is large makes the opposite trade-off.

Original language | English (US) |
---|---|

Pages | 64-73 |

Number of pages | 10 |

DOIs | |

State | Published - 1999 |

Externally published | Yes |

Event | Proceedings of the 1999 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99 - Saint-Malo Duration: Jun 27 1999 → Jun 30 1999 |

### Conference

Conference | Proceedings of the 1999 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99 |
---|---|

City | Saint-Malo |

Period | 6/27/99 → 6/30/99 |

## ASJC Scopus subject areas

- Software
- Safety, Risk, Reliability and Quality