34 citations · 52 across the 4 of their papers we have counts for
5 papers
File System Aging
Alex Conway, Ainesh Bakshi, Arghya Bhattacharya +11
File systems must allocate space for files without knowing what will be added or removed in the future. Over the life of a file system, this may cause suboptimal file placement dec…
Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering
Michael A. Bender, Bradley C. Kuszmaul, William Kuszmaul
First introduced in 1954, linear probing is one of the oldest data structures in computer science, and due to its unrivaled data locality, it continues to be one of the fastest has…
PageRank Pipeline Benchmark: Proposal for a Holistic System Benchmark for Big-Data Platforms
Patrick Dreher, Chansup Byun, Chris Hill +3
The rise of big data systems has created a need for benchmarks to measure and compare the capabilities of these systems. Big data benchmarks present unique scalability challenges.…
Don't Thrash: How to Cache Your Hash on Flash
Michael A. Bender, Martin Farach-Colton, Rob Johnson +7
This paper presents new alternatives to the well-known Bloom filter data structure. The Bloom filter, a compact data structure supporting set insertion and membership queries, has…
Optimal Cache-Oblivious Mesh Layouts
Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng +1
A mesh is a graph that divides physical space into regularly-shaped regions. Meshes computations form the basis of many applications, e.g. finite-element methods, image rendering,…