Filters








1,065 Hits in 6.8 sec

Agar: A Caching System for Erasure-Coded Data

Raluca Halalai, Pascal Felber, Anne-Marie Kermarrec, Francois Taiani
2017 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)  
In this paper, we address the problem of minimizing access latency in erasure-coded storage. We propose Agar-a novel caching system tailored for erasure-coded content.  ...  Recent research showed that it is feasible to use erasure coding for hot data as well, thus opening new perspectives for improving erasure-coded storage systems.  ...  Caching Erasure-Coded Data CAROM [2] is a LRU-based caching scheme tailored for erasure-coded cloud file systems, whose workloads are known to exhibit temporal locality.  ... 
doi:10.1109/icdcs.2017.97 dblp:conf/icdcs/HalalaiFKT17 fatcat:cxynhdr5nrgw5meubuxblz6sy4

Enabling energy efficient Hybrid Memory Cube systems with erasure codes

Shibo Wang, Yanwei Song, Mahdi Nazm Bojnordi, Engin Ipek
2015 2015 IEEE/ACM International Symposium on Low Power Electronics and Design (ISLPED)  
We introduce a new technique that alleviates the long wakeup penalty of an HMC by employing erasure codes.  ...  Simulations show that the proposed architecture outperforms a current HMC-based multicore system by 6.2⇥, and reduces the system energy by 5.3⇥ under the same power budget as the multicore baseline.  ...  The evaluation indicates that the proposed mechanism based on erasure codes makes more efficient use of the extra storage space than caching does, providing a higher probability of reconstructing inaccessible  ... 
doi:10.1109/islped.2015.7273492 dblp:conf/islped/WangSBI15 fatcat:iigykddxgzgujnng3xvjyqp7ny

Secure Deduplication For Cloud Storage Using Memory Mapping Technique For Improving Performance And Security

Jibin Joy, Department of Computer Science, Sri Krishna Arts and Science College, Coimbatore, Tamil Nadu, India., Dr. S. Devaraju, Department of Computer Applications, Sri Krishna Arts and Science College, Coimbatore, Tamil Nadu, India
2021 Journal of University of Shanghai for Science and Technology  
Hash-based de-duplication is the implementation of whole file hashing to the entire file. Text data's hash values are considered to as feature properties.  ...  In cloud storage, the MPT is used to deduplication so that it is used in single copies of the same data for different data owners.  ...  To provide security, the Java platform employs an Elgama-based public key algorithm. An effective data storage system has been proposed for higher space efficiency by the author.  ... 
doi:10.51201/jusst/21/08498 fatcat:fox3qcvmjjfxdfxl4tox5dbnhi

Sprout: A Functional Caching Approach to Minimize Service Latency in Erasure-Coded Storage

Vaneet Aggarwal, Yih-Farn R. Chen, Tian Lan, Yu Xiang
2016 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)  
Storage systems may have caches at the proxy or client ends in order to reduce the latency. In this paper, we consider a novel caching framework with erasure code called functional caching.  ...  Functional Caching involves using erasure-coded chunks in the cache such that the code formed by the chunks in storage nodes and cache combined are maximaldistance-separable (MDS) erasure codes.  ...  The authors would like to thank Zijian He from Purdue University for many helpful discussions in the initial stages of this project.  ... 
doi:10.1109/icdcs.2016.100 dblp:conf/icdcs/AggarwalCLX16 fatcat:jxqywnsmq5frjazzaxgru3bqum

Sprout: A Functional Caching Approach to Minimize Service Latency in Erasure-Coded Storage

Vaneet Aggarwal, Yih-Farn Robin Chen, Tian Lan, Yu Xiang
2017 IEEE/ACM Transactions on Networking  
Storage systems may have caches at the proxy or client ends in order to reduce the latency. In this paper, we consider a novel caching framework with erasure code called functional caching.  ...  Functional Caching involves using erasure-coded chunks in the cache such that the code formed by the chunks in storage nodes and cache combined are maximaldistance-separable (MDS) erasure codes.  ...  The authors would like to thank Zijian He from Purdue University for many helpful discussions in the initial stages of this project.  ... 
doi:10.1109/tnet.2017.2749879 fatcat:dy7zpbowcnhippnqzrwq3fbsi4

A New Decoding Algorithm for XOR-Based Erasure Codes

Rui Chen, Lihao Xu
2020 SN Computer Science  
This paper addresses new methods in improving the decoding speed for XOR-based erasure codes. A new decoding algorithm is proposed, with which CPU cache can be utilized more efficiently.  ...  Over the years, erasure codes, which provide the system ability to reconstruct data when damage occurs, have been proven effective and integrated within various large storage systems.  ...  The purpose of this paper is to combine the efficient XOR scheduling and caching technique and propose a new decoding algorithm for XOR-based erasure codes, which can be readily implemented by data storage  ... 
doi:10.1007/s42979-020-00141-y fatcat:jk3pkwkq4bbr7pycgqkdzq6tmq

NVM Storage in IoT Devices: Opportunities and Challenges

Yang Liu, Shan Zhao, Wenhan Chen, Xuran Ge, Fang Liu, Shuo Li, Nong Xiao
2021 Computer systems science and engineering  
Finally, we present the opportunities and challenges of building IoT storage systems based on NVM.  ...  This paper classifies the different storage architectures based on NVM and compares the system goals, architectures, features, and limitations to explore new research opportunities.  ...  Guo Yeting for his assistance in this paper. Conflicts of Interest: The authors declare that they have no conflicts of interest to report regarding the present study.  ... 
doi:10.32604/csse.2021.017224 fatcat:uu4bprtlnfglrlpafsnjjlvqfq

Sprout: A functional caching approach to minimize service latency in erasure-coded storage [article]

Vaneet Aggarwal, Yih-Farn R. Chen, Tian Lan, Yu Xiang
2017 arXiv   pre-print
Storage systems may have caches at the proxy or client ends in order to reduce the latency. In this paper, we consider a novel caching framework with erasure code called functional caching.  ...  Functional Caching involves using erasure-coded chunks in the cache such that the code formed by the chunks in storage nodes and cache combined are maximal-distance-separable (MDS) erasure codes.  ...  In this paper, we propose a new functional caching approach called Sprout that can efficiently capitalize on existing file coding in erasure-coded storage systems.  ... 
arXiv:1609.09827v3 fatcat:ucvumof4vrcjlkt6k7ikve3vcm

Iris

Emil Stefanov, Marten van Dijk, Ari Juels, Alina Oprea
2012 Proceedings of the 28th Annual Computer Security Applications Conference on - ACSAC '12  
Iris also includes novel erasure coding techniques for efficient support of dynamic Proofs of Retrievability (PoR) protocols over the file system.  ...  Iris includes new optimization and enterprise-side caching techniques specifically designed to overcome the high network latency typically experienced when accessing cloud storage.  ...  Other systems provide data integrity guarantees for key-value stores. Venus [28] implements strong consistency semantics for a key-value store with malicious storage in the back-end.  ... 
doi:10.1145/2420950.2420985 dblp:conf/acsac/StefanovDJO12 fatcat:2q4aydlwyzaixliwwhixvr55ei

An Efficient Parallel Coding Scheme in Erasure-Coded Storage Systems

Wenrui DONG, Guangming LIU
2018 IEICE transactions on information and systems  
Erasure codes have been considered as one of the most promising techniques for data reliability enhancement and storage efficiency in modern distributed storage systems.  ...  MTPerasure is a general parallel coding model focusing on the high level data allocation, and it is applicable for all erasure codes and can be implemented without any modifications of the low level coding  ...  Fig. 2 2 Decoding process of the erasure-code-based storage systems.  ... 
doi:10.1587/transinf.2017edp7218 fatcat:3dzlfnrcz5afdk4cudvp6qayum

An ensemble of replication and erasure codes for cloud file systems

Yadi Ma, Thyaga Nandagopal, Krishna P. N. Puttaswamy, Suman Banerjee
2013 2013 Proceedings IEEE INFOCOM  
In this paper, we propose a novel scheme named CAROM, an ensemble of replication and erasure codes, to provide resiliency in cloud file systems with high efficiency.  ...  We perform a large-scale evaluation using real-world file system traces and demonstrate that CAROM outperforms replication based schemes in storage cost by up to 60% and erasure coded schemes in bandwidth  ...  There are many MDS erasure codes that apply to storage system. Reed-Solomon codes are defined for all values of m and k and is one of the most well-known erasure codes [14] .  ... 
doi:10.1109/infcom.2013.6566920 dblp:conf/infocom/MaNPB13 fatcat:aatcp4tnfbhodim2xdacrb2qpu

E-ECC

Hsing-Min Chen, Akhil Arunkumar, Carole-Jean Wu, Trevor Mudge, Chaitali Chakrabarti
2015 Proceedings of the 2015 International Symposium on Memory Systems - MEMSYS '15  
Specifically, we propose two erasure and error correction (E-ECC) schemes for x8 memory systems that have 12.5% storage overhead and do not require any change in the existing memory architecture.  ...  Scheme 2 trades off reliability for higher energy efficiency by activating only 9 chips per access.  ...  While an x8 memory system is known to be more energyefficient compared to an x4 system, direct implementation of Chipkill-Correct with symbol based ECC code either has very large storage overhead or incurs  ... 
doi:10.1145/2818950.2818961 dblp:conf/memsys/ChenAWMC15 fatcat:lr6doux5q5bdbhumk23jebmyoe

Practical Performance Evaluation of Space Optimal Erasure Codes for High-Speed Data Storage Systems

Rui Chen, Lihao Xu
2019 SN Computer Science  
The goal of this paper is to provide data storage practitioner a guideline when they choose a proper erasure code for storage applications and systems that need high performance in encoding and decoding  ...  As erasure codes have been widely adopted in most large-scale data storage systems and applications, implementations of high-performance erasure codes have been improved significantly in recent years,  ...  An MDS erasure code is optimal in terms of space efficiency for a designed erasure recovery degree (e) and, therefore, is most desired in many systems and applications, including data storage systems.  ... 
doi:10.1007/s42979-019-0057-1 fatcat:ugljddavubfrxmppn7g5glppmm

Mitigating the Performance-Efficiency Tradeoff in Resilient Memory Disaggregation [article]

Youngmoon Lee, Hasan Al Maruf, Mosharaf Chowdhury, Asaf Cidon, Kang G. Shin
2020 arXiv   pre-print
Our proposed framework can access erasure-coded remote memory within a single-digit μs read/write latency, significantly improving the performance-efficiency tradeoff over the state-of-the-art - it performs  ...  We also propose a novel coding group placement algorithm for erasure-coded data, that provides load balancing while reducing the probability of data loss under correlated failures by an order of magnitude  ...  The alternative is erasure coding, which has recently made its way from disk-based storage to in-memory cluster caching to reduce storage overhead and improve load balancing [14, 21, 61, 69, 70, 73] .  ... 
arXiv:1910.09727v2 fatcat:evarof46wzc3ve5tuemrilvnva

Performance evaluation of the Mojette erasure code for fault-tolerant distributed hot data storage [article]

Dimitri Pertin, Didier Féron, Alexandre Van Kempen, Benoît Parrein
2015 arXiv   pre-print
Packet erasure codes are today a real alternative to replication in fault tolerant distributed storage systems.  ...  Those very good performances allow to deploy Mojette erasure code for hot data distributed storage and I/O intensive applications.  ...  Acknowledgements This material is based upon work supported by the Agence Nationale de la Recherche (ANR) through the project FEC4Cloud (ANR-12-EMMA-0031-01).  ... 
arXiv:1504.07038v1 fatcat:j4ciypzydveazkggprs3cclnfe
« Previous Showing results 1 — 15 out of 1,065 results