Study on data allocation model in distributed storage

Authors:
Qing-song Wei;Qing-feng Du
Affiliations:
School of Software Engineering, Tongji University, Shanghai, China;School of Software Engineering, Tongji University, Shanghai, China
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 3
Cited 0

The TickerTAIP parallel RAID architecture

ACM Transactions on Computer Systems (TOCS)
Swift/RAID: a distributed RAID system

Computing Systems
Efficient, distributed data placement strategies for storage area networks (extended abstract)

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

According to the basic requirement of distributed storage, this paper defines several technical parameters to describe data allocation policy and presents a data allocation model by analyzing the performance of various data allocation policies. In this model, the data allocation policy is described in polyhedron view. The model can suggest an optimal data allocation policy to acquire satisfactory storage service at the less costs.