Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Filters








178 Hits in 5.2 sec

Multi-level Forwarding and Scheduling Recovery Algorithm in Rapidly-changing Network for Erasure-coded Clusters [article]

Hai Zhou, Dan Feng, Yuchong Hu
2021 arXiv   pre-print
A key design goal of erasure-coded clusters is to reduce the repair time. The existing Erasure-coded data repair schemes are roughly classified into two categories: 1.  ...  However, these solutions are difficult to cope with the heterogeneous and Rapidly-changing network in erasure-coded clusters.  ...  MOTIVATION Fig. 3 Bandwidth-aware multi-level forwarding repair We first observe a three-node Erasure-code cluster, node1, node2 and node3.  ... 
arXiv:2011.01410v2 fatcat:cawawgob2vglbbp22ymvd5h7hi

Rack Aware Data Placement for Network Consumption in Erasure-Coded Clustered Storage Systems

Bilin Shao, Dan Song, Genqing Bian, Yu Zhao
2018 Information  
The amount of encoded data replication in an erasure-coded clustered storage system has a great impact on the bandwidth consumption and network latency, mostly during data reconstruction.  ...  Theoretical analysis and simulation results show that our proposed strategy greatly reduces the frequency and data volume of the cross-rack transmission during data reconstruction.  ...  The Architecture of the Erasure-Coded Clustered System In the erasure-coded cluster storage system, data blocks and encoding blocks are stored separately in different nodes of different racks.  ... 
doi:10.3390/info9070150 fatcat:pwufr6ulfvfevion5vyrwpyhda

Exploiting Redundancies and Deferred Writes to Conserve Energy in Erasure-Coded Storage Clusters

Jianzhong Huang, Fenghao Zhang, Xiao Qin, Changsheng Xie
2013 ACM Transactions on Storage  
The experimental results indicate that compared to energy-oblivious erasure-coded storage, ECS 2 can save the energy used by storage clusters up to 29.8% and 28.0% in read-intensive and write-dominated  ...  We present a power-efficient scheme for erasure-coded storage clusters-ECS 2 -which aims to offer high energy efficiency with marginal reliability degradation.  ...  The authors also appreciate Shuaijun Han and Shenjie Cui for their assistance in the development of the experimental platform for this study.  ... 
doi:10.1145/2491472.2491473 fatcat:uehiywrkpbajlcjszymx3ywwpm

Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation [article]

Xiaolu Li, Zuoru Yang, Jinhong Li, Runhui Li, Patrick P. C. Lee, Qun Huang, Yuchong Hu
2020 arXiv   pre-print
We propose repair pipelining, a technique that speeds up the repair performance in general erasure-coded storage.  ...  By carefully scheduling the repair of failed data in small-size units across storage nodes in a pipelined manner, repair pipelining reduces the single-block repair time to approximately the same as the  ...  Conclusions Repair pipelining is a general technique that reduces the single-block repair time to almost the same as the normal read time for a single available block in erasure-coded storage.  ... 
arXiv:1908.01527v3 fatcat:poj7lo37azd3nnu4u3i7qzjdie

Boosting Full-Node Repair in Erasure-Coded Storage

Shiyao Lin, Guowen Gong, Zhirong Shen, Patrick P. C. Lee, Jiwu Shu
2021 USENIX Annual Technical Conference  
A variety of erasure codes and repair algorithms are designed in recent years to relieve the repair traffic, yet we unveil via careful analysis that they are still plagued by several limitations, which  ...  We present RepairBoost, a scheduling framework that can assist existing linear erasure codes and repair algorithms to boost the full-node repair performance.  ...  Acknowledgments We thank our shepherd, Mike Mesnier, and the anonymous reviewers for the comments on our camera-ready preparations.  ... 
dblp:conf/usenix/LinGSLS21 fatcat:xbq7m7brtrfntfk76tsy7d7ks4

The CORE Storage Primitive: Cross-Object Redundancy for Efficient Data Repair & Access in Erasure Coded Storage [article]

Kyumars Sheykh Esmaili, Lluis Pamies-Juarez, Anwitaman Datta
2013 arXiv   pre-print
We build upon this study to design CORE, a general storage primitive that we integrate into HDFS. We benchmark this implementation in a proprietary cluster and in EC2.  ...  In this paper, we take an engineering alternative, exploring the use of simple and mature techniques -juxtaposing a standard erasure code with RAID-4 like parity.  ...  codes [1, 3, 23] , applying network coding techniques [2, 4, 20] , or designing completely new codes with lower repair fan-in [13] [14] [15] , and (iii) fast creation of erasure coded redundancy [  ... 
arXiv:1302.5192v4 fatcat:rwljkazcc5azfi7khqpsy7vc5i

RAFI: Risk-Aware Failure Identification to Improve the RAS in Erasure-coded Data Centers

Juntao Fang, Shenggang Wan, Xubin He
2018 USENIX Annual Technical Conference  
Data reliability and availability, and serviceability (RAS) of erasure-coded data centers are highly affected by data repair induced by node failures.  ...  Compared to the recovery phase of the data repair, which is widely studied and well optimized, the failure identification phase of the data repair is less investigated.  ...  We are grateful to anonymous reviewers and particularly our shepherd Dahlia Malkhi for their helpful comments and suggestions.  ... 
dblp:conf/usenix/FangWH18 fatcat:nvp7jnwksraevgleilj6ocoykq

S3: Joint Scheduling and Source Selection for Background Traffic in Erasure-Coded Storage

Shijing Li, Tian Lan, Moo-Ryong Ra, Rajesh Panta
2017 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)  
In this paper, we claim that an optimal scheduling algorithm that aims to maximize the number of background tasks completed before deadlines must simultaneously consider deadline-aware scheduling, network  ...  Erasure-coded storage systems have gained considerable adoption recently since they can provide the same level of reliability with significantly lower storage overhead compared to replicated systems.  ...  LPST ALGORITHM DESIGN AND COMPETITORS In this section, we describe our proposed algorithm, called Linear Programming for Selected Tasks (LPST), which harnesses resource-aware chunk selection, deadline-aware  ... 
doi:10.1109/icdcs.2017.204 dblp:conf/icdcs/LiLRP17 fatcat:4v7wtqs2incz5epusdhlgwimpy

Dominoes: Speculative Repair in Erasure-Coded Hadoop System

Xi Yang, Chen Feng, Zhiwei Xu, Xian-He Sun
2015 2015 IEEE 22nd International Conference on High Performance Computing (HiPC)  
In an erasure-coded system, data reconstruction time will be paid while tasks access the missing blocks during MapReduce job processing.  ...  Erasure coding can provide equivalent three-way fault tolerance to HDFS's default three replication mechanism but degrades data availability for task scheduling.  ...  This research is also supported in part by NSF under NSF grants CNS-0751200, CNS-1162540, and CNS-1526887.  ... 
doi:10.1109/hipc.2015.39 dblp:conf/hipc/YangFXS15 fatcat:k66mwepd5nh3dd5l5pffueil24

Fatman

An Qin, Dianming Hu, Jun Liu, Wenjun Yang, Dai Tan
2014 Proceedings of the VLDB Endowment  
Fatman is specifically designed for enhancing the utilization of existing storage resources and cutting down the hardware purchase cost.  ...  It firstly improves data reliability by applying disk failure prediction to minish failure recovery cost, named fault-aware data management, dramatically reduces the MTTR by 76.3% and decreases file crash  ...  The integration of failure prediction and erasure codes is never reported in recent articles, especially applying prediction to pre-schedule decoding.  ... 
doi:10.14778/2733004.2733078 fatcat:7pnkj34lgnfhxcqssoxgq4iq4i

TOWARDS DIGITAL TWINS FOR OPTIMIZING METRICS IN DISTRIBUTED STORAGE SYSTEMS - A REVIEW

May Itani, Layal Abu Daher, Ahmad Hammoud
2023 BAU Journal - Science and Technology  
These constitute: Repair bandwidth, load imbalance, latency, disk failure, and reliability. • Repair Bandwidth is the transmission efficiency during the recovery process in DSSs, is defined as the average  ...  The paper describes the design method, numerical analysis, simulation study, and experimental validation of this method.  ... 
doi:10.54729/2959-331x.1118 fatcat:3bdrygiebrg2hivh2cu662oz2q

XORing elephants

Maheswaran Sathiamoorthy, Megasthenis Asteris, Dimitris Papailiopoulos, Alexandros G. Dimakis, Ramkumar Vadali, Scott Chen, Dhruba Borthakur
2013 Proceedings of the VLDB Endowment  
We present a novel family of erasure codes that are efficiently repairable and offer higher reliability compared to Reed-Solomon codes.  ...  Reed-Solomon codes are the standard design choice and their high repair cost is often considered an unavoidable price to pay for high storage efficiency and high reliability.  ...  in repair bandwidth and disk I/O.  ... 
doi:10.14778/2535573.2488339 fatcat:ncei5mlrfjhjvgndoj463tqv6e

Fault tolerance in big data storage and processing systems: A review on challenges and solutions

Muntadher Saadoon, Siti Hafizah Ab. Hamid, Hazrina Sofian, Hamza H.M. Altarturi, Zati Hakim Azizul, Nur Nasuha
2021 Ain Shams Engineering Journal  
This study aims to provide a consistent understanding of fault tolerance in big data systems and highlights common challenges that hinder the improvement in fault tolerance efficiency.  ...  Achieving an efficient fault tolerance solution in a big data system is challenging because fault tolerance must meet some constraints related to the system performance and resource consumption.  ...  A hybrid technique that involves erasure coding and replication can also be applied in the storage systems.  ... 
doi:10.1016/j.asej.2021.06.024 fatcat:bk7hhhss7fe73ok24df6tjrfum

Erasure Coding-oriented Data Update for Cloud Storage: A Survey

Yifei Xiao, Shijie Zhou, Linpeng Zhong
2020 IEEE Access  
We also appreciate Jingwei Li and Hu Xiong for their sincere help.  ...  an encoding matrix G ∈ C, thus, the repair bandwidth per symbol of repaired data for the proposed code with IA tends to n−1 n−kn .  ...  To improve DR efficiency, the main body of the literature on erasure coding has made great contributions on designing excellent erasure codes or improving existing erasure codes [9] , [27] , [29] ,  ... 
doi:10.1109/access.2020.3033024 fatcat:5lddrtxervaxle6eqx2koioh24

XORing Elephants: Novel Erasure Codes for Big Data [article]

Maheswaran Sathiamoorthy, Megasthenis Asteris, Dimitris Papailiopoulos, Alexandros G. Dimakis, Ramkumar Vadali, Scott Chen, Dhruba Borthakur
2013 arXiv   pre-print
We present a novel family of erasure codes that are efficiently repairable and offer higher reliability compared to Reed-Solomon codes.  ...  Reed-Solomon codes are the standard design choice and their high repair cost is often considered an unavoidable price to pay for high storage efficiency and high reliability.  ...  in repair bandwidth and disk I/O.  ... 
arXiv:1301.3791v1 fatcat:7u5w67cebbbm3eumjdxm2vhpje
« Previous Showing results 1 — 15 out of 178 results