FAST '19
| title | author | length |
|---|---|---|
| Transactions and Scalability in Cloud Databases—Can’t We Have Both? | Doug Terry | 01h 08m |
Claim: Amazon adds full ACID transactions to DynamoDB without breaking scalability, availability or low latency. Implementation: new one-shot transactions API… | ||
| Reaping the performance of fast NVM storage with uDepot | Kornilios Kourtis | 26m |
Kornilios Kourtis, IBM Research
Many applications require low-latency key-value storage, a requirement that is typically satisfied using key-value stores… | ||
| Optimizing Systems for Byte-Addressable NVM by Reducing Bit Flipping | Daniel Bittman, Darrell D. E. Long, Peter Alvaro, Ethan L. Miller | 29m |
This work defines bit flips, not write counts, as the optimization target for byte-addressable NVM and shows that reducing writes can increase flips. It… | ||
| Write-Optimized Dynamic Hashing for Persistent Memory | Moohyeon Nam | 24m |
Implements Cacheline-Conscious Extendible Hashing (CCEH): a three-level directory→segment→cacheline-pocket layout that finds items with two cacheline accesses… | ||
| Software Wear Management for Persistent Memories | Vaibhav Gogte | 32m |
Vaibhav Gogte, University of Michigan
The commercial release of byte-addressable persistent memories (PMs) is imminent. Unfortunately, these devices suffer… | ||
| Storage Gardening: Using a Virtualization Layer for Efficient Defragmentation in the WAFL | Ram Kesavan | 26m |
WAFL leverages a V→P indirection and a fat container file to move physical blocks (including snapshot leaves) without rewriting file-level pointers… | ||
| Pay Migration Tax to Homeland: Anchor-based Scalable Reference Counting for Multicores | Seokyong Jung | 28m |
PAYGO implements an anchor counter plus per-core local counters so increments use fast non-atomic updates and only migrated threads pay an atomic “migration… | ||
| Speculative Encryption on GPU Applied to Cryptographic File Systems | Wagner M. Nunan Zola | 28m |
Implements EncFS++ with a CUDA/GPU backend (wise/wiseT) and libfuse, using CTR mode to speculatively generate encryption masks on the GPU and a per-volume… | ||
| Sketching Volume Capacities in Deduplicated Storage | Danny Harnik | 25m |
Sketch-based estimators use content-defined sampling of chunk fingerprints (keep hashes whose leading bits meet a threshold, e.g. parameter 13) to represent a… | ||
| Finesse: Fine-Grained Feature Locality based Fast Resemblance Detection... | Wen Xia | 19m |
Proposes replacing costly N-transform super-features by splitting each chunk into fixed-size subchunks, computing Rabin fingerprints per subchunk and grouping… | ||
| Sliding Look-Back Window Assisted Data Chunk Rewriting for Improving Deduplication... | Zhichao Cao, Shiyong Liu, Fenggang Wu, Guohua Wang, Bingzhe Li, David H.C. Du | 29m |
Proposes a rewrite system combining FC-RC (flexible container reference-count thresholds) with a sliding look-back window plus candidate cache and recipe cache… | ||
| DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed... | Zaoxing Liu | 25m |
DistCache proves a two-layer distributed cache that makes cache throughput grow roughly linearly with added cache nodes and absorbs hot-object skew as long as… | ||
| GearDB: A GC-free Key-Value Store on HM-SMR Drives with Gear Compaction | Ting Yao | 28m |
GearDB builds a GC-free LSM-style key-value store for host-managed SMR drives using a new on-disk layout, compaction windows, and a recursive gear compaction… | ||
| SPEICHER: Securing LSM-based Key-Value Stores using Shielded Execution | Maurice Bailleu, Jörg Thalheim, Pramod Bhatotia, Christof Fetzer, Michio Honda, Kapil Vaswani | 21m |
Speicher is a secure LSM-backed key-value store that provides confidentiality, integrity and freshness for persistent data by extending trust beyond the SGX… | ||
| SLM-DB: Single-Level Key-Value Store with Persistent Memory | Olzhas Kaiyrakhmet | 29m |
SLM-DB is a key-value store built for byte-addressable persistent memory: it keeps the memtable in PM (so no write-ahead log), uses a persistent B+tree index… | ||
| Ziggurat: A Tiered File System for Non-Volatile Main Memories and Disks | Shengan Zheng | 30m |
Ziggurat is a tiered file system built on NOVA that steers writes between NVMM, DRAM and SSD using two online predictors—the synchrony predictor (detects… | ||
| Orion: A Distributed File System for Non-Volatile Main Memory and RDMA-Capable Networks | Jian Yang | 30m |
Orion is a kernel file system that unifies POSIX I/O and RDMA networking to expose distributed NVMM as byte-addressable storage, using one-sided RDMA for data… | ||
| INSTalytics: Cluster Filesystem Co-design for Big-data Analytics | Midhul Vuppalapati | 28m |
Midhul Vuppalapati, Microsoft Research India
We present the design, implementation, and evaluation of Instalytics, a co-designed stack of a cluster file… | ||
| GraphOne: A Data Store for Real-time Analytics on Evolving Graphs | Pradeep Kumar | 27m |
GraphOne is a graph datastore that combines edge list and adjacency list storage with dual versioning and a GraphView API that lets analytics choose visibility… | ||
| Automatic, Application-Aware I/O Forwarding Resource Allocation | Xu Ji | 29m |
A system called DFRA uses low-overhead, history-based I/O monitoring (BEACON) to decide at job dispatch whether to give a job extra forwarding nodes or… | ||
| Design Tradeoffs for SSD Reliability | Bryan S. Kim | 24m |
Measured raw bit error rates rise sharply across generations, and uncoordinated use of data re-read, intra-SSD redundancy, and scrubbing drives big slowdowns… | ||
| Fully Automatic Stream Management for Multi-Streamed SSDs Using Program Contexts | Taejin Kim | 29m |
This paper presents PCStream, a kernel-level, fully automatic stream management system for multi-streamed SSDs that assigns SSD streams based on dominant I/O… | ||
| Large-Scale Graph Processing on Emerging Storage Devices | Nima Elyasi, Changho Choi, Anand Sivasubramaniam | 32m |
Claims a vertex-only partitioning that fits each destination partition in DRAM and replaces GraphBoost’s big external sort, cutting I/O by streaming sources… | ||
| Fast Erasure Coding for Data Storage: A Comprehensive Study of the Acceleration... | Tianli Zhou | 26m |
Shows a concrete pipeline: search bitmatrix by simulated annealing/genetic algorithms to minimize a weighted cost, then generate a schedule that applies XOR… | ||
| OpenEC: Toward Unified and Configurable Erasure Coding Management... | Xiaolu Li | 24m |
OpenEC is a middleware that decouples erasure coding control from storage workflows using an EC-deck DAG to express encoding, repair and placement, and it… | ||
| Cluster storage systems gotta have HeART... | Saurabh Kadekodi, K.V. Rashmi, Gregory R. Ganger | 30m |
An online tool called HeART monitors per–make/model annualized failure rates, uses an anomaly detector (robust random cut forest) and a change-point detector… | ||
| ScaleCheck: A Single-Machine Approach for Discovering Scalability Bugs... | Cesar A. Stuardo | 29m |
A toolchain combines a static/dynamic program analysis that flags scale-dependent data structures with a single-process cluster (SPC), a global event-driven… | ||
| nothing matches | ||