15 citations · 27 across the 4 of their papers we have counts for
8 papers
PonyTail: Profiling and Improving Service Tail Latency
Roee Wodislawski, Adam Morrison
Datacenter services must meet tight tail latency service-level objectives. Research on improving tail latency focuses on reducing queuing delay by approximating optimal request sch…
Reverse Engineering the Apple M1 Conditional Branch Predictor for Out-of-Place Spectre Mistraining
Adam Tuby, Adam Morrison
Spectre v1 information disclosure attacks, which exploit CPU conditional branch misprediction, remain unsolved in deployed software. Certain Spectre v1 gadgets can be exploited onl…
Prefix Filter: Practically and Theoretically Better Than Bloom
Tomer Even, Guy Even, Adam Morrison
Many applications of approximate membership query data structures, or filters, require only an incremental filter that supports insertions but not deletions. However, the design sp…
Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing
Adar Zeitak, Adam Morrison
We present the Cuckoo Trie, a fast, memory-efficient ordered index structure. The Cuckoo Trie is designed to have memory-level parallelism -- which a modern out-of-order processor…
Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity
Daniel Katzan, Adam Morrison
We present the first recoverable mutual exclusion (RME) algorithm that is simultaneously abortable, adaptive to point contention, and with sublogarithmic RMR complexity. Our algori…
Proving Highly-Concurrent Traversals Correct
Yotam M. Y. Feldman, Artem Khyzha, Constantin Enea +4
Modern highly-concurrent search data structures, such as search trees, obtain multi-core scalability and performance by having operations traverse the data structure without any sy…
Speculative Interference Attacks: Breaking Invisible Speculation Schemes
Mohammad Behnia, Prateek Sahu, Riccardo Paccagnella +13
Recent security vulnerabilities that target speculative execution (e.g., Spectre) present a significant challenge for processor design. The highly publicized vulnerability uses spe…
Order out of Chaos: Proving Linearizability Using Local Views
Yotam M. Y. Feldman, Constantin Enea, Adam Morrison +2
Proving the linearizability of highly concurrent data structures, such as those using optimistic concurrency control, is a challenging task. The main difficulty is in reasoning abo…