TY - JOUR

T1 - Improving deduplication techniques by accelerating remainder calculations

AU - Hirsch, M.

AU - Klein, S. T.

AU - Toaff, Y.

PY - 2014/1/30

Y1 - 2014/1/30

N2 - The time efficiency of many storage systems rely critically on the ability to perform a large number of evaluations of certain hashing functions fast enough. The remainder function BmodP, generally applied with a large prime number P, is often used as a building block of such hashing functions, which leads to the need of accelerating remainder evaluations, possibly using parallel processors. We suggest several improvements exploiting the mathematical properties of the remainder function, leading to iterative or hierarchical evaluations. Experimental results show a 2 to 5-fold increase in the processing speed.

AB - The time efficiency of many storage systems rely critically on the ability to perform a large number of evaluations of certain hashing functions fast enough. The remainder function BmodP, generally applied with a large prime number P, is often used as a building block of such hashing functions, which leads to the need of accelerating remainder evaluations, possibly using parallel processors. We suggest several improvements exploiting the mathematical properties of the remainder function, leading to iterative or hierarchical evaluations. Experimental results show a 2 to 5-fold increase in the processing speed.

KW - Deduplication

KW - Hierarchical evaluation

KW - Modular arithmetic

KW - Rabin-Karp

UR - http://www.scopus.com/inward/record.url?scp=84889648521&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2013.01.027

DO - 10.1016/j.dam.2013.01.027

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84889648521

SN - 0166-218X

VL - 163

SP - 307

EP - 315

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - PART 3

ER -