Improved decoding algorithm for the generalized EVENODD array code

Data placement scheme based on the generalized EVENODD array code was one of the most important choices for data storage systems to tolerate failures. The efficiency of the erasure code was directly related to the number of XOR operations during the encoding and decoding. We provided an improved dec...

Full description

Saved in:
Bibliographic Details
Published in2012 2nd International Conference on Computer Science and Network Technology pp. 2216 - 2219
Main Authors Haibo, Jiang, Mingyu, Fan, Yilong, Xiao, Xiaojing, Wang, Yu, Wu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2012
Subjects
Arrays
Codes
data placement
Decoding
decoding algorithm
Distributed databases
Encoding
erasure code
Mathematical models
Peer-to-peer computing
Software
Software algorithms
Symbols
XOR operations
Online AccessGet full text
ISBN1467329630
9781467329637
DOI10.1109/ICCSNT.2012.6526358

Cover

Abstract Data placement scheme based on the generalized EVENODD array code was one of the most important choices for data storage systems to tolerate failures. The efficiency of the erasure code was directly related to the number of XOR operations during the encoding and decoding. We provided an improved decoding algorithm of the generalized EVENODD array code for correcting various triple node failures. It showed that the decoding complexity of the new algorithm was much lower than those of the existing comparable algorithm, thus it made the generalized EVENODD array code more efficiency in storage systems.
AbstractList Data placement scheme based on the generalized EVENODD array code was one of the most important choices for data storage systems to tolerate failures. The efficiency of the erasure code was directly related to the number of XOR operations during the encoding and decoding. We provided an improved decoding algorithm of the generalized EVENODD array code for correcting various triple node failures. It showed that the decoding complexity of the new algorithm was much lower than those of the existing comparable algorithm, thus it made the generalized EVENODD array code more efficiency in storage systems.
Author Mingyu, Fan
Haibo, Jiang
Yu, Wu
Yilong, Xiao
Xiaojing, Wang
Author_xml – sequence: 1
  givenname: Jiang
  surname: Haibo
  fullname: Haibo, Jiang
  email: haibo330@126.com
  organization: School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
– sequence: 2
  givenname: Fan
  surname: Mingyu
  fullname: Mingyu, Fan
  organization: School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
– sequence: 3
  givenname: Xiao
  surname: Yilong
  fullname: Yilong, Xiao
  organization: School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
– sequence: 4
  givenname: Wang
  surname: Xiaojing
  fullname: Xiaojing, Wang
  organization: Chengdu Computer Applications Institute, Chinese Academy of Sciences, Chengdu, China
– sequence: 5
  givenname: Wu
  surname: Yu
  fullname: Yu, Wu
  email: xyl201358@sina.com
  organization: School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
BookMark eNpFj1FLwzAUhSMq6OZ-wV7yB1ZvkjZpHrWrWhjbg9PXcbvcdJWuHWkR5q-34MCnwwfnO3Am7KbtWmJsLiASAuxjkWXv620kQchIJ1KrJL1iExFro6TVsb3-BwV3bNb3XwAwqtqk6p49F8dT6L7JcUf7ztVtxbGpulAPhyP3XeDDgXhFLQVs6p-xln_m681yyTEEPPNRoQd267HpaXbJKft4ybfZ22K1eS2yp9WiFiYZFtIjuhKttRoMgXTSe4rBuDihsvQjp0IlDtDpFEo0YGKNSH6fKuVBWDVl87_dmoh2p1AfMZx3l8_qFy7zTNo
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICCSNT.2012.6526358
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1467329649
9781467329644
9781467329620
1467329622
EndPage 2219
ExternalDocumentID 6526358
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ADFMO
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
IERZE
OCL
RIE
RIL
ID FETCH-LOGICAL-i175t-2faadba999607e02d2ffe407d45ebbf2d28135d0ad680ba70746aaefc833f0193
IEDL.DBID RIE
ISBN 1467329630
9781467329637
IngestDate Wed Sep 03 07:09:52 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-2faadba999607e02d2ffe407d45ebbf2d28135d0ad680ba70746aaefc833f0193
PageCount 4
ParticipantIDs ieee_primary_6526358
PublicationCentury 2000
PublicationDate 2012-Dec.
PublicationDateYYYYMMDD 2012-12-01
PublicationDate_xml – month: 12
  year: 2012
  text: 2012-Dec.
PublicationDecade 2010
PublicationTitle 2012 2nd International Conference on Computer Science and Network Technology
PublicationTitleAbbrev ICCSNT
PublicationYear 2012
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001106783
Score 1.5480713
Snippet Data placement scheme based on the generalized EVENODD array code was one of the most important choices for data storage systems to tolerate failures. The...
SourceID ieee
SourceType Publisher
StartPage 2216
SubjectTerms Arrays
Codes
data placement
Decoding
decoding algorithm
Distributed databases
Encoding
erasure code
Mathematical models
Peer-to-peer computing
Software
Software algorithms
Symbols
XOR operations
Title Improved decoding algorithm for the generalized EVENODD array code
URI https://ieeexplore.ieee.org/document/6526358
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV09T8MwELVKJyZALeJbHhhJmsZ24qz0QwWpBYkWdavO8blUQIuidKC_HjsJrUAMbHFiWbYc-e6d770j5DpGFmCowRMJTy1AkcZTYWQ8e1a2YyN0goljIw9H0WDC76diWiM3Wy4MIhbJZ-i7x-IuX6_StQuVtSLhpFPkHtmLZVRytXbxFKeFJlnB3YpiFtofayvpVLXjSnWoHSStu07naTR2qV2hXw37o75KYV76B2T4PbEyq-TVX-fKTze_NBv_O_ND0twR-ejj1kQdkRouG-S2DCSgptpiT_eBwtt8lS3yl3dqfVhqfUI6L-WoFxvbrffcGz10uxSyDD6pI8E3yaTfG3cGXlVKwVtY_yD3QgOgFTh0E8QYhDo0Bi2W01ygUsa2ZZsJHYCOZKAgdlVIANCkkjFjvUB2TOrL1RJPCLWnAhgUPBUgOAcDyFIuA26BRxtiJU5Jw61_9lGqZcyqpZ_9_fqc7Ls9KBNELkg9z9Z4ac18rq6K_f0CIzCjQg
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELZKGWAC1CLeeGAkaZrYeaz0oRbagESL2KpzfC4V0KIoHeivx05CKxADW5xEka2LfPed7_uOkKsAPQddCRaPWKIBSqgs4frK0ntlM1BcRhgZNvIw9ntjdvvMnyvkes2FQcS8-Axtc5mf5ctFsjSpsobPjXRKuEW2OWOMF2ytTUbFqKGFXs7e8gPP1b_WWtSpHAel7lDTiRr9VusxHpniLtcuP_yjw0ruYLp7ZPg9taKu5NVeZsJOVr9UG_87931S31D56MPaSR2QCs5r5KZIJaCkUqNP84DC23SRzrKXd6qjWKqjQjotBKlnK_1a56kT37fbFNIUPqmhwdfJuNsZtXpW2UzBmukIIbNcBSAFGHzjBOi40lUKNZqTjKMQSo_DpselA9IPHQGB6UMCgCoJPU_pONA7JNX5Yo5HhOp9ARRylnDQdgAF6CUsdJiGHk0IBD8mNbP-yUehlzEpl37y9-1LstMbDQeTQT--OyW7xh5FucgZqWbpEs-108_ERW7rL-Zdpo8
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2012+2nd+International+Conference+on+Computer+Science+and+Network+Technology&rft.atitle=Improved+decoding+algorithm+for+the+generalized+EVENODD+array+code&rft.au=Haibo%2C+Jiang&rft.au=Mingyu%2C+Fan&rft.au=Yilong%2C+Xiao&rft.au=Xiaojing%2C+Wang&rft.date=2012-12-01&rft.pub=IEEE&rft.isbn=9781467329637&rft.spage=2216&rft.epage=2219&rft_id=info:doi/10.1109%2FICCSNT.2012.6526358&rft.externalDocID=6526358
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467329637/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467329637/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467329637/sc.gif&client=summon&freeimage=true