一种面向纠删码的存储库优化方法.pdfVIP

计算机研究与发展

Journal

of

Computer

Research

and

Development62（5）：1123−1135，2025

一种面向纠删码的存储库优化方法

谢汶兵关睿雪张艺鸣李佳梅王俊

（无锡先进技术研究院江苏无锡214126）

（xiewb@）

EfficientOptimizationofErasureCodingforStorageLibrary

Xie

Wenbing,

Guan

Ruixue,

Zhang

Yiming,

Li

Jiamei,

and

Wang

Jun

（WuxiInstituteofAdvancedTechnology,Wuxi,Jiangsu214126）

AbstractIn

the

information

stage,

the

importance

of

data

storage

lies

in

ensuring

the

reliability,

consistency,

security,

and

real-time

accessibility

of

information.

Erasure

codes

(EC)

play

a

crucial

role

in

data

storage

systems

due

to

their

ability

to

minimize

storage

overhead

and

handle

multiple

component

failures.

However,

the

process

of

encoding

and

decoding

EC

involves

intensive

computation,

impacting

storage

system

efficiency.

This

paper

focuses

on

optimizing

EC,

with

a

special

emphasis

on

the

Galois

field

(GF)

multiplication

within

multi-layer

loops,

a

time-

consuming

aspect

of

EC.

We

first

evaluate

the

pros

and

cons

of

three

methods

for

GF

multiplication

calculation:

the

log

table

searching

method,

the

complete

multiplication

table

searching

method,

and

the

shift

decomposition

method.

Subsequently,

a

4

b

splitting

(SP)

method

is

proposed

to

reduce

memory

access

overhead

during

table

searching

in

8

GF(2).

We

delve

into

the

SP’s

analysis

and

leverage

the

64

b

modern

processor

architecture

and

vector

instruction

set

characteristics

to

introduce

data-level

parallelism

in

multi-layer

loops.

This

involves

amplifying

data

access

granularity

and

implementing

single

instruction

multiple

data

(SIMD)

vectorization.

Based

on

the

open-source

Intel

storage

acceleration

library

(ISA-L),

all

optimization

methods

are

implemented

and

tested

on

Sunway

processor

and

x