Sherman: A write-optimized distributed b+ tree index on disaggregated memory
Memory disaggregation architecture physically separates CPU and memory into
independent components, which are connected via high-speed RDMA networks, greatly …
independent components, which are connected via high-speed RDMA networks, greatly …
Scalable persistent memory file system with {Kernel-Userspace} collaboration
We introduce Kuco, a novel direct-access file system architecture whose main goal is
scalability. Kuco utilizes three key techniques–collaborative indexing, two-level locking, and …
scalability. Kuco utilizes three key techniques–collaborative indexing, two-level locking, and …
Nap: A {Black-Box} Approach to {NUMA-Aware} Persistent Memory Indexes
We present Nap, a black-box approach that converts concurrent persistent memory (PM)
indexes into NUMA-aware counterparts. Based on the observation that real-world workloads …
indexes into NUMA-aware counterparts. Based on the observation that real-world workloads …
Pacman: An efficient compaction approach for {Log-Structured}{Key-Value} store on persistent memory
Recent persistent memory (PM) key-value (KV) stores adopt the log-structured approach to
reap PM's full potential. However, they fail to sustain high performance at high capacity …
reap PM's full potential. However, they fail to sustain high performance at high capacity …
{AlNiCo}:{SmartNIC-accelerated} contention-aware request scheduling for transaction processing
High-performance transaction processing needs to schedule numerous requests from the
network. However, such request scheduling comes with costs of complex information …
network. However, such request scheduling comes with costs of complex information …
Replicating Persistent Memory {Key-Value} Stores with Efficient {RDMA} Abstraction
Combining persistent memory (PM) with RDMA is a promising approach to performant
replicated distributed key-value stores (KVSs). However, existing replication approaches do …
replicated distributed key-value stores (KVSs). However, existing replication approaches do …
SafePM: A sanitizer for persistent memory
Memory safety violation is a major root cause of reliability and security issues in software
systems. Byte-addressable persistent memory (PM), just like its volatile counterpart, is also …
systems. Byte-addressable persistent memory (PM), just like its volatile counterpart, is also …
SwitchTx: scalable in-network coordination for distributed transaction processing
Online-transaction-processing (OLTP) applications require the underlying storage system to
guarantee consistency and serializability for distributed transactions involving large …
guarantee consistency and serializability for distributed transactions involving large …
Perseid: A Secondary Indexing Mechanism for LSM-Based Storage Systems
LSM-based storage systems are widely used for superior write performance on block
devices. However, they currently fail to efficiently support secondary indexing, since a …
devices. However, they currently fail to efficiently support secondary indexing, since a …
DxHash: A Memory-saving Consistent Hashing Algorithm
C Dong, F Wang, D Feng - ACM Transactions on Internet Technology, 2024 - dl.acm.org
Consistent Hashing (CH) algorithms are widely adopted in networks and distributed systems
for their ability to achieve load balancing and minimize disruptions. However, the rise of the …
for their ability to achieve load balancing and minimize disruptions. However, the rise of the …