2025/01/20 by Hao Shi, Shi, Hao, Zhengyi Jiang +7 · 1 voice
Computer Science · #Advanced Data Storage Technologies #Caching and Content Delivery #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT
paper · pdf · doi:10.48550/arxiv.2501.11353
openalex publication_date 2025/01/20 · arxiv published 2025/01/20 · arxiv updated 2025/01/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Maximum distance separable (MDS) array codes are widely employed in modern distributed storage systems to provide high data reliability with small storage overhead. Compared with the data access latency of the entire file, the data access latency of a single node in a distributed storage system is equally important. In this paper, we propose two algorithms to effectively reduce the data access latency on a single node in different scenarios for MDS codes. We show theoretically that our algorithms have an expected reduction ratio of ((n-k)(n-k+1))/(n(n+1)) and (n-k)/(n) for the data access latency of a single node when it obeys uniform distribution and shifted-exponential distribution, respectively, where n and k are the numbers of all nodes and the number of data nodes respectively. In the worst-case analysis, we show that our algorithms have a reduction ratio of more than 60% when (n,k)=(3,2). Furthermore, in simulation experiments, we use the Monte Carlo simulation algorithm to demonstrate less data access latency compared with the baseline algorithm.