OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
A Genetic Algorithm for the Multidimensional Knapsack Problem
Journal of Heuristics
Performance Evaluation of a Distributed Video Storage System
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Mariposa: a wide-area distributed database system
The VLDB Journal — The International Journal on Very Large Data Bases
Sabotage-Tolerance Mechanisms for Volunteer Computing Systems
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Compute Power Market: Towards a Market-Oriented Grid
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Dynamic Programming
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
A Real-Time Performance Evaluation Model for Distributed Software with Reliability Constrains
The Journal of Supercomputing
The Journal of Supercomputing
The Computational and Storage Potential of Volunteer Computing
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
A high-performance computing method for data allocation in distributed database systems
The Journal of Supercomputing
Improvements on dynamic adjustment mechanism in co-allocation data grid environments
The Journal of Supercomputing
A resource broker with an efficient network information model on grid environments
The Journal of Supercomputing
Grid resource management based on economic mechanisms
The Journal of Supercomputing
Storage exchange: a global trading platform for storage services
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
An auxiliary storage subsystem to distributed computing systems for external storage service
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Hi-index | 0.00 |
In this paper, we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of finding the optimal composition for availability and price requirements can be reduced to the knapsack problem, and propose three techniques for efficiently finding approximate solutions. The first algorithm uses a dynamic programming approach to find mirrored storage resources for high availability requirements, and runs in the pseudo-polynomial O(n 2 c) time where n is the number of sellers’ resources to choose from and c is a capacity function of the requested and minimum availability. The second technique is a heuristic which finds resources to be agglomerated into a larger coherent resource, with complexity of O(nlog n). The third technique finds a compromise between capacity and availability (which in our phrasing is a complex integer programming problem) using a genetic algorithm. The algorithms can be implemented on a broker that intermediates between buyers and sellers of storage resources. Finally, we show that a broker in an open storage market, using the combination of the three algorithms can more frequently meet user requests and lower the cost of requests that are met compared to a broker that simply matches single resources to requests.