With the rapid development of cloud computing technology, it’s the cloud rendering that cloud computing is applied to render the job in CG (Computer Graphic) industry. The cloud rendering can handle a large number of rendering requests which are enormous pressure for back-end servers in system. Facing with massive data and computing resources, the bottleneck of original HDFS (Hadoop Distributed File System) based on cloud computing has become more and more prominent, such as the failure of single Namenode, scalability issues. Therefore, the paper proposed an improved HDFS which evolved a single Namenode into multi-Namenode. In HDFS, Metadata management is very important. So this paper presented a two-level Metadata distribution algorithm. The two-level algorithm was based on the principle that different distribution strategies were used to different categories of Metadata. The experiments verified that the improved HDFS effectively improved the performance of the system.
목차
Abstract 1. Introduction 1.1. The Present and Problems of File System in Cloud Rendering 1.2. The Present and Problems of HDFS 2. The Basic Idea of HDFS 2.1. Namenode 2.2. Datanode 2.3. The Operations of Reading and Writing in HDFS 3. Improved HDFS Based on the Multi-Namenode Architecture 3.1. The Election Mechanism of Master Namenode 3.2. Metadata Information Based on the Two-Level Distribution Strategy 4. Experimental Results 4.1. Experimental Environment 4.2 Experimental Results and Analyses 5. Conclusions References
보안공학연구지원센터(IJDTA) [Science & Engineering Research Support Center, Republic of Korea(IJDTA)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Database Theory and Application
간기
격월간
pISSN
2005-4270
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Database Theory and Application Vol.9 No.11