Distributed Storage Support in Private Clouds Based on Static Scheduling Algorithms
This paper is focused on an extension to an open source Infrastructure as a Service Cloud called Eucalytpus for supporting distributed storage according to a defined storage strategy. As a proof of concept, three algorithms known from the scheduling theory were implemented, namely MonteCarlo, Round Robin and Weighted Queuing. To evaluate the extension, a set of tests were performed on a sample Cloud installation using a modified version of the Eucalyptus cloud. The paper ends up with a discussion on choosing the most efficient static algorithm for data storing based on the obtained results.