Award Date

8-2010

Degree Type

Thesis

Degree Name

Master of Science in Computer Science

Department

Computer Science

First Committee Member

Wolfgang Bein, Co-Chair

Second Committee Member

Thomas Nartker, Co-Chair

Third Committee Member

Yoohwan Kim

Graduate Faculty Representative

Shahram Latifi

Number of Pages

61

Abstract

Cloud storage is the service provided by some corporations (such as Mozy and Carbonite) to store and backup computer files. We study the problem of allocating memory of servers in a data center based on online requests for storage. Over-the-net data backup has become increasingly easy and cheap due to cloud storage. Given an online sequence of storage requests and a cost associated with serving the request by allocating space on a certain server one seeks to select the minimum number of servers as to minimize total cost. We use two different algorithms and propose a third algorithm; we show that all algorithms perform well when the requests are random. The work here is related to "bin packing", a well studied problem in theoretical computer science. As an aside the thesis will survey some of the literature related to bin packing.

Keywords

Client/server computing; Cloud computing; Information retrieval; Virtual storage (Computer science)

Disciplines

Databases and Information Systems | Library and Information Science | Theory and Algorithms

Language

English


Share

COinS