A lightweight infrastructure for graph analytics
D Nguyen, A Lenharth, K Pingali - Proceedings of the twenty-fourth ACM …, 2013 - dl.acm.org
Several domain-specific languages (DSLs) for parallel graph analytics have been proposed
recently. In this paper, we argue that existing DSLs can be implemented on top of a general …
recently. In this paper, we argue that existing DSLs can be implemented on top of a general …
Speedy transactions in multicore in-memory databases
Silo is a new in-memory database that achieves excellent performance and scalability on
modern multicore machines. Silo was designed from the ground up to use system memory …
modern multicore machines. Silo was designed from the ground up to use system memory …
Cache craftiness for fast multicore key-value storage
We present Masstree, a fast key-value database designed for SMP machines. Masstree
keeps all data in memory. Its main data structure is a trie-like concatenation of B+-trees …
keeps all data in memory. Its main data structure is a trie-like concatenation of B+-trees …
Stronger Semantics for {Low-Latency}{Geo-Replicated} Storage
We present the first scalable, geo-replicated storage system that guarantees low latency,
offers a rich data model, and provides “stronger” semantics. Namely, all client requests are …
offers a rich data model, and provides “stronger” semantics. Namely, all client requests are …
Renaissance: Benchmarking suite for parallel applications on the jvm
Established benchmark suites for the Java Virtual Machine (JVM), such as DaCapo,
ScalaBench, and SPECjvm2008, lack workloads that take advantage of the parallel …
ScalaBench, and SPECjvm2008, lack workloads that take advantage of the parallel …
Fast concurrent lock-free binary search trees
A Natarajan, N Mittal - Proceedings of the 19th ACM SIGPLAN …, 2014 - dl.acm.org
We present a new lock-free algorithm for concurrent manipulation of a binary search tree in
an asynchronous shared memory system that supports search, insert and delete operations …
an asynchronous shared memory system that supports search, insert and delete operations …
Asynchronized concurrency: The secret to scaling concurrent search data structures
We introduce" asynchronized concurrency (ASCY)," a paradigm consisting of four
complementary programming patterns. ASCY calls for the design of concurrent search data …
complementary programming patterns. ASCY calls for the design of concurrent search data …
More than you ever wanted to know about synchronization: Synchrobench, measuring the impact of the synchronization on concurrent algorithms
V Gramoli - Proceedings of the 20th ACM SIGPLAN Symposium on …, 2015 - dl.acm.org
In this paper, we present the most extensive comparison of synchronization techniques. We
evaluate 5 different synchronization techniques through a series of 31 data structure …
evaluate 5 different synchronization techniques through a series of 31 data structure …
XIndex: a scalable learned index for multicore data storage
We present XIndex, a concurrent ordered index designed for fast queries. Similar to a recent
proposal of the learned index, XIndex uses learned models to optimize index efficiency …
proposal of the learned index, XIndex uses learned models to optimize index efficiency …
Building a bw-tree takes more than just buzz words
In 2013, Microsoft Research proposed the Bw-Tree (humorously termed the" Buzz Word
Tree''), a lock-free index that provides high throughput for transactional database workloads …
Tree''), a lock-free index that provides high throughput for transactional database workloads …