Design and Implementation of High Speed Pipeline Merge Sorter with Run Length Tuning Mechanism

Yang, Weikang; Suzuki, Takahiko; Takagi, Mikio

doi:10.1007/978-1-4613-1679-4_7

Cited by 8 publications

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Query processing is therefore performed in a highly parallel fashion. The nodes itself are often enhanced using specialized circuits, e.g., hardware sorter [22]. The CAFS system [3], the LEECH processor [28], the pipelined relational query processor [19], and the relational database machine [2] are even processors that are solely designed for database query processing.…”

Section: Further Related Workmentioning

confidence: 99%

An application-specific instruction set for accelerating set-oriented database primitives

Arnold

Haas

Fettweis

et al. 2014

Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data

View full text Add to dashboard Cite

The key task of database systems is to efficiently manage large amounts of data. A high query throughput and a low query latency are essential for the success of a database system. Lately, research focused on exploiting hardware features like superscalar execution units, SIMD, or multiple cores to speed up processing. Apart from these software optimizations for given hardware, even tailor-made processing circuits running on FPGAs are built to run mostly stateless query plans with incredibly high throughput. A similar idea, which was already considered three decades ago, is to build tailor-made hardware like a database processor. Despite their superior performance, such application-specific processors were not considered to be beneficial because generalpurpose processors eventually always caught up so that the high development costs did not pay off. In this paper, we show that the development of a database processor is much more feasible nowadays through the availability of customizable processors. We illustrate exemplarily how to create an instruction set extension for set-oriented database primitives. The resulting application-specific processor provides not only a high performance but it also enables very energyefficient processing. Our processor requires in various configurations more than 960x less energy than a high-end x86 processor while providing the same performance.

show abstract

Section: Further Related Workmentioning

confidence: 99%

An application-specific instruction set for accelerating set-oriented database primitives

Arnold

Haas

Fettweis

et al. 2014

Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data

View full text Add to dashboard Cite

show abstract

“…A great deal of research in the field of database machines has focused on the development of dedicated database architectures [1], [8], [9], [10]. Parallel to this work, some vendors have developed general purpose machines with database functions such as select, search, and join integrated directly into the machine architecture [11].…”

Section: Introductionmentioning

confidence: 99%

Acceleration of nonnumeric operations using hardware support for the Ordered Table Hashing algorithms

Jovanov

Milutinović

Hurson

2002

IEEE Trans. Comput.

View full text Add to dashboard Cite

This paper introduces a new approach to acceleration of nonnumeric, database, and information retrieval operations. While traditional techniques accelerate the most time-critical high-level software constructs, we propose novel low-level primitives and demonstrate how these primitives improve database operations. Radix sorting, hashing, and bit-vector operations are used to develop a new class of nonnumeric algorithms-OTHER (Ordered Table Hashing and Radix sort algorithms)-based on low-level hashing operations Init, Mark, and Scan. We have proposed and evaluated two hardware accelerators for OTHER algorithms. It is shown that a low complexity hardware support (less than 10K transistors) can significantly improve the performance of nonnumeric operations.

show abstract

Evaluation of 18-stage pipeline hardware sorter

Yang

Fushimi

1989

Database Machines

View full text Add to dashboard Cite

Design and Implementation of High Speed Pipeline Merge Sorter with Run Length Tuning Mechanism

Cited by 8 publications

References 1 publication

An application-specific instruction set for accelerating set-oriented database primitives

An application-specific instruction set for accelerating set-oriented database primitives

Acceleration of nonnumeric operations using hardware support for the Ordered Table Hashing algorithms

Evaluation of 18-stage pipeline hardware sorter

Contact Info

Product

Resources

About