7 citations · 8 across the 4 of their papers we have counts for
4 papers
Bridging Cache-Friendliness and Concurrency: A Locality-Optimized In-Memory B-Skiplist
Yicong Luo, Senhe Hao, Brian Wheatman +2
Skiplists are widely used for in-memory indexing in many key-value stores, such as RocksDB and LevelDB, due to their ease of implementation and simple concurrency control mechanism…
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers
Brian Wheatman, Xiaojun Dong, Zheqi Shen +4
A fundamental building block in any graph algorithm is a graph container - a data structure used to represent the graph. Ideally, a graph container enables efficient access to the…
Masked Matrix Multiplication for Emergent Sparsity
Brian Wheatman, Meghana Madhyastha, Randal Burns
Artificial intelligence workloads, especially transformer models, exhibit emergent sparsity in which computations perform selective sparse access to dense data. The workloads are i…
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
Brian Wheatman, Randal Burns, Aydın Buluç +1
This paper introduces the batch-parallel Compressed Packed Memory Array (CPMA), a compressed, dynamic, ordered set data structure based on the Packed Memory Array (PMA). Traditiona…