By Topic

A data placement algorithm with binary weighted tree on PC cluster-based cloud storage system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Julia Myint ; University Of Computer Studies, Yangon, Yangon, Myanmar ; Thinn Thu Naing

The need and use of scalable storage on cloud has rapidly increased in last few years. Organizations need large amount of storage for their operational data and backups. To address this need, high performance storage servers for cloud computing are the ultimate solution, but they are very expensive. Therefore we propose efficient cloud storage system by using inexpensive and commodity computer nodes. These computer nodes are organized into PC cluster as datacenter. Data objects are distributed and replicated in a cluster of commodity nodes located in the cloud. In the proposed cloud storage system, a data placement algorithm which provides a highly available and reliable storage is proposed. The proposed algorithm applies binary tree to search storage nodes. It supports the weighted allocation of data objects, balancing load on PC cluster with minimum cost. The proposed system is implemented with HDFS and experimental results prove that the proposed algorithm can balance storage load depending on the disk space, expected availability and failure probability of each node in PC cluster.

Published in:

Cloud and Service Computing (CSC), 2011 International Conference on

Date of Conference:

12-14 Dec. 2011