IEICE TRANSACTIONS on Fundamentals
Sorting Matrix Architecture for Continuous Data Sequences
Summary :
Sorting is one of the most fundamental problems in mathematics and computer science. Because high-throughput and flexible sorting is a key requirement in modern databases, this paper presents efficient techniques for designing a high-throughput sorting matrix that supports continuous data sequences. There have been numerous studies on the optimization of sorting circuits on FPGA (field-programmable gate array) platforms. These studies focused on attaining high throughput for a single command with fixed data width. However, the architectures proposed do not meet the requirement of diversity for database data types. A sorting matrix architecture is thus proposed to overcome this problem. Our design consists of a matrix of identical basic sorting cells. The sorting cells work in a pipeline and in parallel, and the matrix can simultaneously process multiple data streams, which can be combined into a high-width single-channel data stream or low-width multiple-channel data streams. It can handle continuous sequences and allows for sorting variable-length data sequences. Its maximum throughput is approximately 1.4 GB/s for 32-bit sequences and approximately 2.5 GB/s for 64-bit sequences on our platform.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.2 pp.542-546
- Publication Date
- 2020/02/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2019EAL2133
- Type of Manuscript
- LETTER
- Category
- Algorithms and Data Structures
Authors
Meiting XUE
Zhejiang University
Huan ZHANG
Hangzhou Dianzi University
Weijun LI
Zhejiang University
Feng YU
Zhejiang University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Meiting XUE, Huan ZHANG, Weijun LI, Feng YU, "Sorting Matrix Architecture for Continuous Data Sequences" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 2, pp. 542-546, February 2020, doi: 10.1587/transfun.2019EAL2133.
Abstract: Sorting is one of the most fundamental problems in mathematics and computer science. Because high-throughput and flexible sorting is a key requirement in modern databases, this paper presents efficient techniques for designing a high-throughput sorting matrix that supports continuous data sequences. There have been numerous studies on the optimization of sorting circuits on FPGA (field-programmable gate array) platforms. These studies focused on attaining high throughput for a single command with fixed data width. However, the architectures proposed do not meet the requirement of diversity for database data types. A sorting matrix architecture is thus proposed to overcome this problem. Our design consists of a matrix of identical basic sorting cells. The sorting cells work in a pipeline and in parallel, and the matrix can simultaneously process multiple data streams, which can be combined into a high-width single-channel data stream or low-width multiple-channel data streams. It can handle continuous sequences and allows for sorting variable-length data sequences. Its maximum throughput is approximately 1.4 GB/s for 32-bit sequences and approximately 2.5 GB/s for 64-bit sequences on our platform.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019EAL2133/_p
Copy
@ARTICLE{e103-a_2_542,
author={Meiting XUE, Huan ZHANG, Weijun LI, Feng YU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Sorting Matrix Architecture for Continuous Data Sequences},
year={2020},
volume={E103-A},
number={2},
pages={542-546},
abstract={Sorting is one of the most fundamental problems in mathematics and computer science. Because high-throughput and flexible sorting is a key requirement in modern databases, this paper presents efficient techniques for designing a high-throughput sorting matrix that supports continuous data sequences. There have been numerous studies on the optimization of sorting circuits on FPGA (field-programmable gate array) platforms. These studies focused on attaining high throughput for a single command with fixed data width. However, the architectures proposed do not meet the requirement of diversity for database data types. A sorting matrix architecture is thus proposed to overcome this problem. Our design consists of a matrix of identical basic sorting cells. The sorting cells work in a pipeline and in parallel, and the matrix can simultaneously process multiple data streams, which can be combined into a high-width single-channel data stream or low-width multiple-channel data streams. It can handle continuous sequences and allows for sorting variable-length data sequences. Its maximum throughput is approximately 1.4 GB/s for 32-bit sequences and approximately 2.5 GB/s for 64-bit sequences on our platform.},
keywords={},
doi={10.1587/transfun.2019EAL2133},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Sorting Matrix Architecture for Continuous Data Sequences
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 542
EP - 546
AU - Meiting XUE
AU - Huan ZHANG
AU - Weijun LI
AU - Feng YU
PY - 2020
DO - 10.1587/transfun.2019EAL2133
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2020
AB - Sorting is one of the most fundamental problems in mathematics and computer science. Because high-throughput and flexible sorting is a key requirement in modern databases, this paper presents efficient techniques for designing a high-throughput sorting matrix that supports continuous data sequences. There have been numerous studies on the optimization of sorting circuits on FPGA (field-programmable gate array) platforms. These studies focused on attaining high throughput for a single command with fixed data width. However, the architectures proposed do not meet the requirement of diversity for database data types. A sorting matrix architecture is thus proposed to overcome this problem. Our design consists of a matrix of identical basic sorting cells. The sorting cells work in a pipeline and in parallel, and the matrix can simultaneously process multiple data streams, which can be combined into a high-width single-channel data stream or low-width multiple-channel data streams. It can handle continuous sequences and allows for sorting variable-length data sequences. Its maximum throughput is approximately 1.4 GB/s for 32-bit sequences and approximately 2.5 GB/s for 64-bit sequences on our platform.
ER -
English
