An Transfer Latency Optimized Solution in GPU-Accelerated De-Duplication

Article Preview

Abstract:

Recently, GPU has been introduced as an important tool in general purpose programming due to its powerful computing capacity. In data de-duplication systems, GPU has been used to accelerate the chunking and hashing algorithms. However, the data transfer latency between the memories of CPU to GPU is one of the main challenges in GPU accelerated de-duplication. To alleviate this challenge, our solution strives to reduce the data transfer time between host and GPU memory on parallelized content-defined chunking and hashing algorithm. In our experiment, it has shown 15%~20% performance improvements over already accelerated baseline GPU implementation in data de-duplication.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2059-2062

Citation:

Online since:

July 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Moya V. and Gonzalez, C. and Roca, J. and Fernandez, A. and Espasa, R. Shader performance analysis on a modern GPU architecture, In IEEE/ACM International Symposium on Microarchitecture, MICRO-38, pp.10-22, (2005).

DOI: 10.1109/micro.2005.30

Google Scholar

[2] INTRODUCING CUDA 5. http: /www. nvidia. com/object/cuda_home_new. html.

Google Scholar

[3] Eshghi, K. and Lillibridge, M. and Wilcock, L. and Belrose, G. and Hawkes, R. Jumbo Store: Providing Efficient Incremental Upload and Versioning for a Utility Rendering Service, In Proceedings of the 5th USENIX conference on File and Storage Technologies, pp.22-33, (2007).

Google Scholar

[4] GPGPU community website. http: /www. gpgpu. org.

Google Scholar

[5] Al-Kiswany Samer, Gharaibeh Abdullah, Santos-Neto Elizu, Yuan George, Ripeanu Matei. StoreGPU: Exploiting Graphics Processing Units to Accelerate Distributed Storage Systems, In Proceedings of the 17th international symposium on High Performance Distributed Computing, pp.165-174, (2008).

DOI: 10.1145/1383422.1383443

Google Scholar

[6] Udi Manber. Finding Similar Files in a Large File System, In proceedings of the USENIX Winter 1994 Technical Conference, pp.17-21, (1994).

Google Scholar

[7] J. Ziv and A. Lempel. A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, Vol. 23, No. 3, p.337~343, (1997).

DOI: 10.1109/tit.1977.1055714

Google Scholar