• An exploration of non-asymptot...

Result: An exploration of non-asymptotic low-density, parity check erasure codes for wide-area storage applications

Title:
An exploration of non-asymptotic low-density, parity check erasure codes for wide-area storage applications
Authors:
PLANK, James S, THOMASON, Michael G
Source:
Clusters and computational grids for scientific computingParallel processing letters. 17(1):103-123
Publisher Information:
Singapore: World Scientific Publishing, 2007.
Publication Year:
2007
Physical Description:
print, 33 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Electronics, Electronique, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Approximation asymptotique, Asymptotic approximation, Aproximación asintótica, Code Reed Solomon, Reed Solomon code, Código Reed Solomon, Comportement asymptotique, Asymptotic behavior, Comportamiento asintótico, Contrôle parité, Parity check, Control paridad, Décodage, Decoding, Desciframiento, Effacement, Erasure, Borradura, Evaluation performance, Performance evaluation, Evaluación prestación, Modélisation, Modeling, Modelización, Mémoire répartie, Distributed memory, Memoria compartida, Parallélisme, Parallelism, Paralelismo, Parité, Parity, Paridad, Phénomène collectif, Collective process, Fenómeno colectivo, Poste à poste, Peer to peer, Par a par, Réplication, Replication, Replicación, Système mémoire, Storage system, Sistema memoria, Système réparti, Distributed system, Sistema repartido, Tolérance faute, Fault tolerance, Tolerancia falta, Erasure codes, Tornado codes, fault-tolerance, low-density parity (LDPC) codes, peer-to-peer, storage systems
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, University of Tennessee, Knoxville, Tennessee 37996, United States
ISSN:
0129-6264
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18702955
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18702955
Database:
PASCAL Archive

Further Information

As peer-to-peer and widely distributed storage systems proliferate, the need to perform efficient erasure coding, instead of replication, is crucial to performance and efficiency. Low-Density Parity-Check (LDPC) codes have arisen as alternatives to standard erasure codes, such as Reed-Solomon codes, trading off vastly improved decoding performance for inefficiencies in the amount of data that must be acquired to perform decoding. The scores of papers written on LDPC codes typically analyze their collective and asymptotic behavior. Unfortunately, their practical application requires the generation and analysis of individual codes for finite systems. This paper attempts to illuminate the practical considerations of LDPC codes for peer-to-peer and distributed storage systems. The three main types of LDPC codes are detailed, and a huge variety of codes are generated, then analyzed using simulation. This analysis focuses on the performance of individual codes for finite systems, and addresses several important heretofore unanswered questions about employing LDPC codes in real-world systems.