Storage Mechanism of Processing Magnanimity Small Files Applying HDFS Architecture

Article Preview

Abstract:

Pointing at the low efficiency problem of I/O operations of small files using HDFS application architecture, this article proposes a new method, that is, add disk buffer on DataNode to reduce addressing time of reading small files, and thus reduce reading time, and reduce the stress bringed by frequent NameNode access, so as to optimize the reading efficiency of small files. Experiment results show that the design programme is feasible, and adding disk buffer benefits for increasing efficiency of processing small files applying HDFS.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 765-767)

Pages:

1614-1617

Citation:

Online since:

September 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] T. White, Hadoop: The Definitive Guide, O'Reilly Media, Yahoo! Press, June 5, (2009).

Google Scholar

[2] Apache Hadoop. http: /hadoop. apache. org.

Google Scholar

[3] Dhruba Borthakur, The Hadoop Distributed File System: Architecture and Design. Hadoop Docs.

Google Scholar

[4] Luan Yajian, Huang Qunmin, Gong Gaochen, Zhao Tiezhu, Performance Optimization Study of Hadoop Platform.

Google Scholar

[5] Chen Junjie, Zheng Weimin, A Dynamic Allocation Resolution Algorithm of the File Allocation Problem.

Google Scholar