Sep 2026· Proceedings of the International Conference on Parallel Processing· pp. 704-714· 0 citations· 25 references
Abstract
Disaggregated memory architecture has gained wide adoption in cloud and high-performance systems [18, 31, 43] due to its decoupled resource model, elasticity, and low-latency access. In such architectures, transaction mechanisms must ensure atomic and consistent access to remote memory. Prior designs use array-based version structures to improve locality, but their fixed capacity introduces false conflicts, especially for long transactions that require accessing historical versions, limiting concurrency and throughput. We present MiTDM, a transaction system tailored for disaggregated memory environments. MiTDM introduces a hierarchical block version chain that combines the benefits of array and chained structures, supporting dynamic version expansion while maintaining low-latency access. A lightweight Block Index Table accelerates remote reads, and an asynchronous index update mechanism synchronizes indexes across nodes with minimal overhead. To manage version growth, MiTDM employs a hybrid garbage collection strategy aware of transaction states, enabling safe reclamation and reuse of version slots, particularly in hot spots. A one-sided optimistic transaction protocol ensures consistency and atomicity under high concurrency. Experimental results on a disaggregated memory cluster show that MiTDM outperforms state-of-the-art systems. Under the TPC-C workload with 128 clients, it achieves up to 80.1% higher throughput compared to FaRMV2 and 42.7% higher than Motor, while significantly reducing P50 and P99 latencies.
Modern storage systems must scale request processing across many cores, making efficient concurrency control essential. Data partitioning routes operations to execution contexts that own portions of system state, reducing synchronization overhead but potentially introducing false collisions: unnecessary serialization i...
Matthew Curtis-Maury, Sushrut Bhowmik, Grey Files et al.· Proceedings of the 19th ACM...· 0 citations
An available KV-cache hit is not always a safe decoder hit. A miss loses reuse; an invalid commit can silently perturb decoder output. In a disaggregated cache, a replica may know where a block was placed, but retirement, allocation reuse, and reader lifetimes evolve elsewhere. We use the CALM monotonicity criterion to...
Kalyan Pullela, H. B. Acharya· Proceedings of the 18th ACM...· 0 citations
XTRA is presented, a novel synchronization architecture that efficiently scales CXL distributed TRAnsactions by decoupling the synchronization state from individual data records, consolidating it into a compact directory within the HCC region, while keeping data in the large non-coherent pool.
Zhi-Jun Yang, Yu Hua, Ming Zhang et al.· Proceedings of the ACM SIGOP...· 0 citations
SolidAttention is introduced, an LLM inference engine which addresses limitations through a tight co-design of dynamic attention sparsity algorithms and SSD-based storage management and minimizes SSD-induced blocking latency.
Xin Zheng, Dong-Liang Wei, Jian-Xiang Gao et al.· 0 citations
Log-structured merge-tree (LSM-tree) key-value stores rely on caching to mitigate multi-component lookups and long tails, yet block and KP caches are prone to compactioninduced expiry, and all three cache types suffer from scan pollution under LRU eviction. We present AutoThermKV, a two-level in-memory architecture tha...
Yunfan Chi, E. Sha, Longshan Xu et al.· IEEE International Conferenc...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.