668 citations · 941 across the 35 of their papers we have counts for
36 papers
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…
Prospective Learning: Principled Extrapolation to the Future
Ashwin De Silva, Rahul Ramesh, Lyle Ungar +40
Learning is a process which can update decision rules, based on past experience, such that future performance improves. Traditionally, machine learning is often evaluated under the…
PACSET (Packed Serialized Trees): Reducing Inference Latency for Tree Ensemble Deployment
Meghana Madhyastha, Kunal Lillaney, James Browne +2
We present methods to serialize and deserialize tree ensembles that optimize inference latency when models are not already loaded into memory. This arises whenever models are large…
Observations on Porting In-memory KV stores to Persistent Memory
Brian Choi, Parv Saxena, Ryan Huang +1
Systems that require high-throughput and fault tolerance, such as key-value stores and databases, are looking to persistent memory to combine the performance of in-memory systems w…
Towards Marrying Files to Objects
Kunal Lillaney, Vasily Tarasov, David Pease +1
To deal with the constant growth of unstructured data, vendors have deployed scalable, resilient, and cost effective object-based storage systems built on RESTful web services. How…
Graphyti: A Semi-External Memory Graph Library for FlashGraph
Disa Mhembere, Da Zheng, Carey E. Priebe +2
Graph datasets exceed the in-memory capacity of most standalone machines. Traditionally, graph frameworks have overcome memory limitations through scale-out, distributing computing…