TY - GEN

T1 - Improving deduplication techniques by accelerating remainder calculations

AU - Hirsch, Michael

AU - Klein, Shmuel T.

AU - Toaffl, Yair

N1 - Place of conference:Czech Republic

PY - 2011

Y1 - 2011

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 B mod P, 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 B mod P, 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.

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

M3 - منشور من مؤتمر

SN - 9788001048702

T3 - Proceedings of the Prague Stringology Conference 2011

SP - 173

EP - 183

BT - Proceedings of the Prague Stringology Conference 2011

T2 - Prague Stringology Conference 2011, PSC 2011

Y2 - 29 August 2011 through 31 August 2011

ER -