A Sub-Logarithmic Time Sorting Algorithm on a Reconfigurable Array

Koji NAKANO; Toshimitsu MASUZAWA; Nobuki TOKURA

Copy

Koji NAKANO, Toshimitsu MASUZAWA, Nobuki TOKURA, "A Sub-Logarithmic Time Sorting Algorithm on a Reconfigurable Array" in IEICE TRANSACTIONS on Information, vol. E74-D, no. 11, pp. 3894-3901, November 1991, doi: .
Abstract: A bus system whose configuration can be dynamically changed is called a reconfigurable bus system. A reconfigurable array consists of processors arranged to a 2-dimensional grid with a reconfigurable bus system. We present a parallel algorithm which sorts N elements in O (T) time on a reconfigurable array with NN log^(T) N processors for every Tlog^*N.
URL: https://global.ieice.org/en_transactions/information/10.1587/e74-d_11_3894/_p

Copy

@ARTICLE{e74-d_11_3894,
author={Koji NAKANO, Toshimitsu MASUZAWA, Nobuki TOKURA, },
journal={IEICE TRANSACTIONS on Information},
title={A Sub-Logarithmic Time Sorting Algorithm on a Reconfigurable Array},
year={1991},
volume={E74-D},
number={11},
pages={3894-3901},
abstract={A bus system whose configuration can be dynamically changed is called a reconfigurable bus system. A reconfigurable array consists of processors arranged to a 2-dimensional grid with a reconfigurable bus system. We present a parallel algorithm which sorts N elements in O (T) time on a reconfigurable array with NN log^(T) N processors for every Tlog^*N.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - A Sub-Logarithmic Time Sorting Algorithm on a Reconfigurable Array
T2 - IEICE TRANSACTIONS on Information
SP - 3894
EP - 3901
AU - Koji NAKANO
AU - Toshimitsu MASUZAWA
AU - Nobuki TOKURA
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E74-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 1991
AB - A bus system whose configuration can be dynamically changed is called a reconfigurable bus system. A reconfigurable array consists of processors arranged to a 2-dimensional grid with a reconfigurable bus system. We present a parallel algorithm which sorts N elements in O (T) time on a reconfigurable array with NN log^(T) N processors for every Tlog^*N.
ER -