MINIMUM STORAGE SORTING NETWORKS.

Research output: Contribution to journalArticle

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 languageEnglish (US)
Pages (from-to)355-361
Number of pages7
JournalIEEE Transactions on Computers
VolumeC-34
Issue number4
StatePublished - Apr 1985

Fingerprint

Sorting Networks
Sorting
Sort
Lower bound
Sharp Bound
Schedule
Upper bound
Requirements
Model
Demonstrate

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

MINIMUM STORAGE SORTING NETWORKS. / Siegel, Alan.

In: IEEE Transactions on Computers, Vol. C-34, No. 4, 04.1985, p. 355-361.

Research output: Contribution to journalArticle

@article{8293192bee9b4590ad073e445cbaf632,
title = "MINIMUM STORAGE SORTING NETWORKS.",
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.",
author = "Alan Siegel",
year = "1985",
month = "4",
language = "English (US)",
volume = "C-34",
pages = "355--361",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "4",

}

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 -