### Abstract

This paper analyzes how to sort n k-bit numbers in a minimum storage network. The techniques also give new AT**2 lower bounds for a VLSI sorting model. The principal results are as follows. (1) Lower bounds are given for the minimum storage (and area) needed to sort n k-bit numbers, and accompanying upper bounds (sorting networks) are presented, which match the lower bounds, up to a constant factor. (2) Sharp bounds are derived, which demonstrate that the minimum storage requirements depend quite strongly on the I/O schedule, and on the sorting model. (3) AT**2 lower bounds are established for a VLSI device that sorts n k-bit numbers where k less than log n.

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

Pages (from-to) | 355-361 |

Number of pages | 7 |

Journal | IEEE Transactions on Computers |

Volume | C-34 |

Issue number | 4 |

State | Published - Apr 1985 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture
- Electrical and Electronic Engineering

### Cite this

*IEEE Transactions on Computers*,

*C-34*(4), 355-361.

**MINIMUM STORAGE SORTING NETWORKS.** / Siegel, Alan.

Research output: Contribution to journal › Article

*IEEE Transactions on Computers*, vol. C-34, no. 4, pp. 355-361.

}

TY - JOUR

T1 - MINIMUM STORAGE SORTING NETWORKS.

AU - Siegel, Alan

PY - 1985/4

Y1 - 1985/4

N2 - This paper analyzes how to sort n k-bit numbers in a minimum storage network. The techniques also give new AT**2 lower bounds for a VLSI sorting model. The principal results are as follows. (1) Lower bounds are given for the minimum storage (and area) needed to sort n k-bit numbers, and accompanying upper bounds (sorting networks) are presented, which match the lower bounds, up to a constant factor. (2) Sharp bounds are derived, which demonstrate that the minimum storage requirements depend quite strongly on the I/O schedule, and on the sorting model. (3) AT**2 lower bounds are established for a VLSI device that sorts n k-bit numbers where k less than log n.

AB - This paper analyzes how to sort n k-bit numbers in a minimum storage network. The techniques also give new AT**2 lower bounds for a VLSI sorting model. The principal results are as follows. (1) Lower bounds are given for the minimum storage (and area) needed to sort n k-bit numbers, and accompanying upper bounds (sorting networks) are presented, which match the lower bounds, up to a constant factor. (2) Sharp bounds are derived, which demonstrate that the minimum storage requirements depend quite strongly on the I/O schedule, and on the sorting model. (3) AT**2 lower bounds are established for a VLSI device that sorts n k-bit numbers where k less than log n.

UR - http://www.scopus.com/inward/record.url?scp=0022042731&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022042731&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0022042731

VL - C-34

SP - 355

EP - 361

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 4

ER -