The Parallel Enumeration Sorting Scheme for VLSI

Hiroto Yasuura, Naofumi Takagi, Shuzo Yajima

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

We propose a new parallel sorting scheme, called the parallel enumeration sorting scheme, which is suitable for VLSI implementation. This scheme can be introduced to conventional computer systems without changing their architecture. In this scheme, sorting is divided into two stages, the ordering process and the rearranging one. The latter can be efficiently performed by central processing units or intelligent memory devices. For implementations of the ordering process by VLSI technology, we design a new hardware algorithm of parallel enumeration sorting circuits whose processing time is linearly proportional to the number of data for sorting. Data are serially transmitted between the sorting circuit and memory devices and the total communication between them is minimized. The basic structure used in the algorithm is called a bus connected cellular array structure with pipeline and parallel processing. The circuit consists of a linear array of one type of simple cell and two buses connecting all cells for efficient global communications in the circuit. The sorting circuit is simple, regular and small enough for realization by today's VLSI technology. We discuss several applications of the sorting circuit and evaluate its performance.

Original languageEnglish
Pages (from-to)1192-1201
Number of pages10
JournalIEEE Transactions on Computers
VolumeC-31
Issue number12
DOIs
Publication statusPublished - Jan 1 1982
Externally publishedYes

Fingerprint

Sorting
Enumeration
Networks (circuits)
Cellular arrays
Data storage equipment
Linear Array
Communication
Cell
Processing
Parallel Processing
Program processors
Computer systems
Pipelines
Linearly
Directly proportional
Hardware
Unit
Evaluate

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

The Parallel Enumeration Sorting Scheme for VLSI. / Yasuura, Hiroto; Takagi, Naofumi; Yajima, Shuzo.

In: IEEE Transactions on Computers, Vol. C-31, No. 12, 01.01.1982, p. 1192-1201.

Research output: Contribution to journalArticle

Yasuura, Hiroto ; Takagi, Naofumi ; Yajima, Shuzo. / The Parallel Enumeration Sorting Scheme for VLSI. In: IEEE Transactions on Computers. 1982 ; Vol. C-31, No. 12. pp. 1192-1201.
@article{59312fa36812495ca692e6ad087610ab,
title = "The Parallel Enumeration Sorting Scheme for VLSI",
abstract = "We propose a new parallel sorting scheme, called the parallel enumeration sorting scheme, which is suitable for VLSI implementation. This scheme can be introduced to conventional computer systems without changing their architecture. In this scheme, sorting is divided into two stages, the ordering process and the rearranging one. The latter can be efficiently performed by central processing units or intelligent memory devices. For implementations of the ordering process by VLSI technology, we design a new hardware algorithm of parallel enumeration sorting circuits whose processing time is linearly proportional to the number of data for sorting. Data are serially transmitted between the sorting circuit and memory devices and the total communication between them is minimized. The basic structure used in the algorithm is called a bus connected cellular array structure with pipeline and parallel processing. The circuit consists of a linear array of one type of simple cell and two buses connecting all cells for efficient global communications in the circuit. The sorting circuit is simple, regular and small enough for realization by today's VLSI technology. We discuss several applications of the sorting circuit and evaluate its performance.",
author = "Hiroto Yasuura and Naofumi Takagi and Shuzo Yajima",
year = "1982",
month = "1",
day = "1",
doi = "10.1109/TC.1982.1675943",
language = "English",
volume = "C-31",
pages = "1192--1201",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "12",

}

TY - JOUR

T1 - The Parallel Enumeration Sorting Scheme for VLSI

AU - Yasuura, Hiroto

AU - Takagi, Naofumi

AU - Yajima, Shuzo

PY - 1982/1/1

Y1 - 1982/1/1

N2 - We propose a new parallel sorting scheme, called the parallel enumeration sorting scheme, which is suitable for VLSI implementation. This scheme can be introduced to conventional computer systems without changing their architecture. In this scheme, sorting is divided into two stages, the ordering process and the rearranging one. The latter can be efficiently performed by central processing units or intelligent memory devices. For implementations of the ordering process by VLSI technology, we design a new hardware algorithm of parallel enumeration sorting circuits whose processing time is linearly proportional to the number of data for sorting. Data are serially transmitted between the sorting circuit and memory devices and the total communication between them is minimized. The basic structure used in the algorithm is called a bus connected cellular array structure with pipeline and parallel processing. The circuit consists of a linear array of one type of simple cell and two buses connecting all cells for efficient global communications in the circuit. The sorting circuit is simple, regular and small enough for realization by today's VLSI technology. We discuss several applications of the sorting circuit and evaluate its performance.

AB - We propose a new parallel sorting scheme, called the parallel enumeration sorting scheme, which is suitable for VLSI implementation. This scheme can be introduced to conventional computer systems without changing their architecture. In this scheme, sorting is divided into two stages, the ordering process and the rearranging one. The latter can be efficiently performed by central processing units or intelligent memory devices. For implementations of the ordering process by VLSI technology, we design a new hardware algorithm of parallel enumeration sorting circuits whose processing time is linearly proportional to the number of data for sorting. Data are serially transmitted between the sorting circuit and memory devices and the total communication between them is minimized. The basic structure used in the algorithm is called a bus connected cellular array structure with pipeline and parallel processing. The circuit consists of a linear array of one type of simple cell and two buses connecting all cells for efficient global communications in the circuit. The sorting circuit is simple, regular and small enough for realization by today's VLSI technology. We discuss several applications of the sorting circuit and evaluate its performance.

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

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

U2 - 10.1109/TC.1982.1675943

DO - 10.1109/TC.1982.1675943

M3 - Article

AN - SCOPUS:0020312595

VL - C-31

SP - 1192

EP - 1201

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 12

ER -