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

Dakota Fulp

dblp:230/2365 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

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
Hardware reliability and fault tolerance · 61% Storage systems · 39%

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

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance › error correction
error-correcting codes
0.512021
ARC: An Automated Approach to Resiliency for Lossy Compressed Data via Error Correcting Codes · HPDC 2021
Storage systems › i/o architecture
i/o subsystem
0.512021
ARC: An Automated Approach to Resiliency for Lossy Compressed Data via Error Correcting Codes · HPDC 2021
Hardware reliability and fault tolerance
soft errors
0.512021
ARC: An Automated Approach to Resiliency for Lossy Compressed Data via Error Correcting Codes · HPDC 2021
Storage systems
data compression
0.112021
ARC: An Automated Approach to Resiliency for Lossy Compressed Data via Error Correcting Codes · HPDC 2021
YearPublicationVenuePosition
2022 Estimating Potential Error in Sampling Interpolation
abstract
As high-performance computing systems rapidly advance, the volumes of scientific data produced are a prominent issue. Data reduction methods, including compression and sampling, seek to alleviate these bottlenecks by significantly reducing overall size. Yet, research shows sampling yields lower overall reconstruction quality than lossy compression due to its inability to bound the error it introduces. This work presents and assesses the ability to estimate reconstruction error. We propose an absolute error estimation scheme using various metrics and evaluate its capabilities over several real-world datasets. Upon evaluation, our scheme is between 63.6% and 94.9% accurate at estimating absolute error and has an average 87.7% correlation with the error. Lastly, we implement and discuss applications of our error estimation, including a novel sampler enhancement that allows for user-specified targeted data quality and a process to achieve a user-specified storage constraint while yielding a better preservation of data than existing methods.
Megan Hickman Fulp, Dakota Fulp, Jon Calhoun 0001
IEEE Big Data2
2021 ARC: An Automated Approach to Resiliency for Lossy Compressed Data via Error Correcting Codes
abstract
Progress in high-performance computing (HPC) systems has led to complex applications that stress the I/O subsystem by creating vast amounts of data. Lossy compression reduces data size considerably, but a single error renders lossy compressed data unusable. This sensitivity stems from the high information content per bit in compressed data and is a critical issue as soft errors that cause bit-flips have become increasingly commonplace in HPC systems. While many works have improved lossy compressor performance, few have sought to address this critical weakness.
Dakota Fulp, Alexandra Poulos, Robert Underwood, Jon Calhoun 0001
HPDC1