Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lucas Kuhring

dblp:244/9207 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 30% Reconfigurable computing and FPGAs · 30% Hardware accelerators and domain-specific architectures · 30%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems
distributed storage
0.412019
I Can't Believe It's Not (Only) Software! Bionic Distributed Storage for Parquet Files · Proc. VLDB Endow. 2019
Reconfigurable computing and FPGAs
FPGA accelerator
0.412019
I Can't Believe It's Not (Only) Software! Bionic Distributed Storage for Parquet Files · Proc. VLDB Endow. 2019
Hardware accelerators and domain-specific architectures › domain-specific accelerator
storage accelerator
0.412019
I Can't Believe It's Not (Only) Software! Bionic Distributed Storage for Parquet Files · Proc. VLDB Endow. 2019
Parallel and multicore computing
dataflow computing
0.112019
I Can't Believe It's Not (Only) Software! Bionic Distributed Storage for Parquet Files · Proc. VLDB Endow. 2019

Methods — techniques the papers use, named apart from their topics

selective column reads · 0.4data deduplication · 0.4
YearPublicationVenuePosition
2019 Storing Parquet Tile by Tile: Application-Aware Storage with Deduplication
abstract
Distributed storage in the cloud needs to offer both low latency and high bandwidth access to data and efficient use of storage capacity in order to keep up with emerging big data workloads. Deduplication has been successfully used to help with the latter requirement but it is often at odds with low latency data access. Deduplication ratios can be significantly increased if the storage nodes are aware of the file format and the ways clients interact with it - but implementing different file-type specific parsing on FPGAs for multiple tenants can be unfeasible due to area constraints. We show the benefits of making the storage system aware of the application through the example of Parquet files, a columnar format used in machine learning and big data frameworks to store and transfer datasets. We achieve high deduplication ratios by using a companion software library that allows Parquet files to be stored in a "divided" way. This makes deduplication more efficient and enables clients to access individual columns or meta-data fields selectively. At the same time, the storage nodes remain general purpose and can store and deduplicate arbitrary data. This work paves the way for in-storage processing for Parquet files and other columnar formats because the different columns can be accessed in a streaming fashion and their processing requires no specialized logic on the FPGA.
Lucas Kuhring, Zsolt István
FPL1
2019 Specialize in Moderation - Building Application-aware Storage Services using FPGAs in the Datacenter
Lucas Kuhring, Eva García, Zsolt István
HotStorage1
2019 I Can't Believe It's Not (Only) Software! Bionic Distributed Storage for Parquet Files
abstract
There is a steady increase in the size of data stored and processed as part of data science applications, leading to bottlenecks and inefficiencies at various layers of the stack. One way of reducing such bottlenecks and increasing energy efficiency is by tailoring the underlying distributed storage solution to the application domain, using resources more efficiently. We explore this idea in the context of a popular column-oriented storage format used in big data workloads, namely Apache Parquet. Our prototype uses an FPGA-based storage node that offers high bandwidth data deduplication and a companion software library that exposes an API for Parquet file access. This way the storage node remains general purpose and could be shared by applications from different domains, while, at the same time, benefiting from deduplication well suited to Apache Parquet files and from selective reads of columns in the file. In this demonstration we show, on the one hand, that by relying on the FPGA's dataflow processing model, it is possible to implement in-line deduplication without increasing latencies significantly or reducing throughput. On the other hand, we highlight the benefits of implementing the application-specific aspects in a software library instead of FPGA circuits and how this enables, for instance, regular data science frameworks running in Python to access the data on the storage node and to offload filtering operations.
Lucas Kuhring, Zsolt István
Proc. VLDB Endow.1