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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cabrera, L.-F., Long, D.D.E.: Swift: Using distributed disk striping to provide high I/O data rate. Computing System 4(4), 405–436 (1991)
Atchley, S., Soltesz, S., Plank, J.S., et al.: Fault-Tolerance in the Network Storage Stack. In: Proceedings of the FAST 2002 Conference, California, USA, pp. 3–5 (2002)
Long, D.D.E., Montague, B.R., Cabrera, L.-F.: Swift/RAID: a distributed RAID system. Computing Systems 7(3), 333–359 (Summer 1994)
Cao, P., Lim, S.B., Venkataraman, S., Wilkes, J.: The TickerTAIP parallel RAID architecture. ACM Transactions on Computer Systems 12(3), 236–269 (1994)
Brinkmann, A., Salzwedel, K., Scheideler, C.: Efficient Distributed Data Placement Strategies for Storage Area Networks. In: Proc. 12 ACM SPAA (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wei, Qs., Du, Qf. (2004). Study on Data Allocation Model in Distributed Storage. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-30501-9_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24013-6
Online ISBN: 978-3-540-30501-9
eBook Packages: Computer ScienceComputer Science (R0)