No abstract

No abstract

Data-intensive queries are common in business intelligence, data warehousing and analytics applications. Typically, processing a query involves full inspection of large in-storage data sets by CPUs. An intuitive way to speed up such queries is to reduce the volume of data transferred over the storage network to a host system. This can be achieved by filtering out extraneous data within the storage, motivating a form of near-data processing. This work presents Biscuit, a novel near-data processing framework designed for modern solid-state drives. It allows programmers to write a data-intensive application to run on the host system and the storage system in a distributed, yet seamless manner. In order to offer a high-level programming model, Biscuit builds on the concept of data flow. Data processing tasks communicate through typed and data-ordered ports. Biscuit does not distinguish tasks that run on the host system and the storage system. As the result, Biscuit has desirable traits like generality and expressiveness, while promoting code reuse and naturally exposing concurrency. We implement Biscuit on a host system that runs the Linux OS and a high-performance solid-state drive. We demonstrate the effectiveness of our approach and implementation with experimental results. When data filtering is done by hardware in the solid-state drive, the average speed-up obtained for the top five queries of TPC-H is over 15×.

No abstract

A solid state device (SSD), which has the characteristics such as high IO bandwidth and low access latency, is drawing attention as a next-generation storage device. Even though SSD provides a high internal bandwidth, the performance bottleneck exists on the host interface of relatively low bandwidth in spite of the increased internal bandwidth of SSD. To overcome the performance bottleneck, the notion of intelligent SSD (iSSD) has been proposed. In iSSD, there are still problems in processing the algorithms of high complexity. In this paper, we address an effective collaboration of iSSD and host CPU in order to maximize the performance of data-intensive algorithms. Extensive experimental results show that our approach performs faster up to 2.43 times than a previous approach.