Skip to main content
SpringerLink
Log in

Study on Data Allocation Model in Distributed Storage

  • Conference paper
Parallel and Distributed Computing: Applications and Technologies (PDCAT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3320))

  • 778 Accesses

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 to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Google Scholar 

  2. 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)

    Google Scholar 

  3. Long, D.D.E., Montague, B.R., Cabrera, L.-F.: Swift/RAID: a distributed RAID system. Computing Systems 7(3), 333–359 (Summer 1994)

    Google Scholar 

  4. Cao, P., Lim, S.B., Venkataraman, S., Wilkes, J.: The TickerTAIP parallel RAID architecture. ACM Transactions on Computer Systems 12(3), 236–269 (1994)

    Article  Google Scholar 

  5. Brinkmann, A., Salzwedel, K., Scheideler, C.: Efficient Distributed Data Placement Strategies for Storage Area Networks. In: Proc. 12 ACM SPAA (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Software Engineering, Tongji University, Shanghai, 200331, China

    Qing-song Wei & Qing-feng Du

Authors
  1. Qing-song Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qing-feng Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Nanyang Centre for Supercomputing and Visualisation School of Mechanical and Production Engineering, Nanyang Technological University, 50 Nanyang Avenue, 639 798, Singapore

    Kim-Meow Liew

  2. School of Computer Science, The University of Adelaide,  

    Hong Shen

  3. Asia Pacific Science and Technology Center, Sun Microsystems Inc., 50 Nanyang Avenue, N3-1c-10, 639798, Singapore

    Simon See

  4. School of Computer Engineering, Nanyang Technological University, 639798, Singapore

    Wentong Cai

  5. Southwest Jiaotong University,  

    Pingzhi Fan

  6. Tohoku University ,  

    Susumu Horiguchi

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation