System Development & Application
|
App. Res. of Comp. Printed Article
Vol. 41, 2024 No. 1
193-199

Local repairable array code model in storage systems

Hong Tieyuan1,2
Tang Dan1,2
Xiong Pan1,2
Cai Hongliang1,2
Zeng Qiong1,2
Xu Yuanping1
1. School of Software Engineering, Chengdu University of Information Technology, Chengdu 610225, China
2. Sichuan Province Engineering Technology Research Center of Support Software of Informatization Application, Chengdu 610225, China
DOI: 10.19734/j.issn.1001-3695.2023.05.0211

Abstract

For single fault tolerance and double fault tolerance systems, any failures that occurs during the disk repair process may cause data loss, leading to repair failure. Ensuring the efficiency of data repair is essential to the reliability of storage systems. RDP code(row diagonal parity code) can reduce the total number of reads by 25% when using the hybrid recovery algorithm for single disk failure repair, but all elements need to be read when repairing double disk failure. To address the current difficulties in improving the efficiency of single and double disk failure repair at the same time, this paper extended RDP code and proposed an array code model with local repair properties, namely DRDP code(double rows diagonal parity code). Based on RDP code, DRDP code generated a local horizontal parity column by XOR calculation of some data columns according to horizontal lines and participated it in the encoding calculation of global parity columns, thus shortening the repair chain and making it have the function of local repair. Through theoretical analysis, DRDP code not only has good encoding and decoding complexity and update efficiency, but also significantly saves the single disk failure repair read overhead and optimizes the double disk failure repair read overhead. It can also repair 75% of three disk failure cases. The experimental results show that compared with RDP code, LRRDP code, and RDP(p, 3) code, the encoding time of DRDP code can be saved by 8.23% to 32.89%, the repair time of single disk failure can be saved by 7.08% to 35.01%, and the repair time of double disk failure can be saved by 5.07% to 29.26%.

Foundation Support

四川省科技厅重大专项资助项目(2022ZDZX0001)
四川省科技计划资助项目(2022YFG0033,2022YFG0037)

Publish Information

DOI: 10.19734/j.issn.1001-3695.2023.05.0211
Publish at: Application Research of Computers Printed Article, Vol. 41, 2024 No. 1
Section: System Development & Application
Pages: 193-199
Serial Number: 1001-3695(2024)01-029-0193-07

Publish History

[2023-10-07] Accepted Paper
[2024-01-05] Printed Article

Cite This Article

洪铁原, 唐聃, 熊攀, 等. 存储系统中的局部修复阵列码模型 [J]. 计算机应用研究, 2024, 41 (1): 193-199. (Hong Tieyuan, Tang Dan, Xiong Pan, et al. Local repairable array code model in storage systems [J]. Application Research of Computers, 2024, 41 (1): 193-199. )

About the Journal

  • Application Research of Computers Monthly Journal
  • Journal ID ISSN 1001-3695
    CN  51-1196/TP

Application Research of Computers, founded in 1984, is an academic journal of computing technology sponsored by Sichuan Institute of Computer Sciences under the Science and Technology Department of Sichuan Province.

Aiming at the urgently needed cutting-edge technology in this discipline, Application Research of Computers reflects the mainstream technology, hot technology and the latest development trend of computer application research at home and abroad in a timely manner. The main contents of the journal include high-level academic papers in this discipline, the latest scientific research results and major application results. The contents of the columns involve new theories of computer discipline, basic computer theory, algorithm theory research, algorithm design and analysis, blockchain technology, system software and software engineering technology, pattern recognition and artificial intelligence, architecture, advanced computing, parallel processing, database technology, computer network and communication technology, information security technology, computer image graphics and its latest hot application technology.

Application Research of Computers has many high-level readers and authors, and its readers are mainly senior and middle-level researchers and engineers engaged in the field of computer science, as well as teachers and students majoring in computer science and related majors in colleges and universities. Over the years, the total citation frequency and Web download rate of Application Research of Computers have been ranked among the top of similar academic journals in this discipline, and the academic papers published are highly popular among the readers for their novelty, academics, foresight, orientation and practicality.

Indexed & Evaluation

  • The Second National Periodical Award 100 Key Journals
  • Double Effect Journal of China Journal Formation
  • the Core Journal of China (Peking University 2023 Edition)
  • the Core Journal for Science
  • Chinese Science Citation Database (CSCD) Source Journals
  • RCCSE Chinese Core Academic Journals
  • Journal of China Computer Federation
  • 2020-2022 The World Journal Clout Index (WJCI) Report of Scientific and Technological Periodicals
  • Full-text Source Journal of China Science and Technology Periodicals Database
  • Source Journal of China Academic Journals Comprehensive Evaluation Database
  • Source Journals of China Academic Journals (CD-ROM Version), China Journal Network
  • 2017-2019 China Outstanding Academic Journals with International Influence (Natural Science and Engineering Technology)
  • Source Journal of Top Academic Papers (F5000) Program of China's Excellent Science and Technology Journals
  • Source Journal of China Engineering Technology Electronic Information Network and Electronic Technology Literature Database
  • Source Journal of British Science Digest (INSPEC)
  • Japan Science and Technology Agency (JST) Source Journal
  • Russian Journal of Abstracts (AJ, VINITI) Source Journals
  • Full-text Journal of EBSCO, USA
  • Cambridge Scientific Abstracts (Natural Sciences) (CSA(NS)) core journals
  • Poland Copernicus Index (IC)
  • Ulrichsweb (USA)