Skip to main content

DPCT: Distributed Parity Cache Table for Redundant Parallel File System

  • Conference paper
High Performance Computing and Communications (HPCC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4208))

  • 788 Accesses

Abstract

Using parity information to protect data from loss in a parallel file system is a straightforward and cost-effective method. However, the “small-write” phenomenon can lead to poor write performance. This is still true in the distributed paradigm even when file system cache is used. The local file system knows nothing about a stripe and thus can not benefit from the related blocks of a stripe. We propose a distributed parity cache table (DPCT) which knows the related blocks of a stripe and can use them to improve the performance of parity calculation and parity updating. This high level cache can benefit from previous reads and can aggregate small writes to improve the overall performance. We implement this mechanism in our reliable parallel file system (RPFS). The experimental results show that both read and write performance can be improved with DPCT support. The improvement comes from the fact that we can reduce the number of disk accesses by DPCT. This matches our quantitative analysis which shows that the number of disk accesses can be reduced from N to N(1–H), where N is the number of I/O nodes and H is the DPCT hit ratio.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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. Gropp, W., Lusk, E., Sterling, T.: Beowulf Cluster Computing with Linux, 2nd edn. MIT Press, Cambridge (2003)

    Google Scholar 

  2. Thakur, R., Lusk, E., Gropp, W.: I/O in parallel applications: The weakest link. The International Journal of High Performance Computing Applications 12(4), 389–395 (1998)

    Article  Google Scholar 

  3. Intel Supercomputer System Division: Paragon System User’s Guide (1995)

    Google Scholar 

  4. Corbett, P.F., Feitelson, D.G., Prost, J.-P., almasi, G.S., Baylor, S.J., Bolmaricich, A.S., Hsu, Y., Satran, J., Sinr, M., Colao, R., Herr, B., Kavaky, J., Morgan, T.R., Zlotel, A.: Parallel file systems for IBM SP computers. IBM Systems Journal 34(2), 222–248 (1995)

    Article  Google Scholar 

  5. Corbett, P.F., Feitelson, D.G.: The Vesta parallel file system. In: High Performance Mass Storage and Parallel I/O: Technologies and Applications, pp. 285–308. IEEE Computer Society Press and Wiley, New York (2001)

    Google Scholar 

  6. Sandberg, R., Goldberg, D., Kleiman, S., Walsh, D., Lyon, B.: Design and implementation of the Sun Network File System. In: Proceedings Summer 1985 USENIX Conference, pp. 119–130 (1985)

    Google Scholar 

  7. Pâris, J.F.: A disk architecture for large clusters of workstations. In: Cluster Computing Conference, GA, pp. 317–327 (1997)

    Google Scholar 

  8. Message Passing Interface Forum: MPI2: Extensions to the Message Passing Interface (1997)

    Google Scholar 

  9. Patterson, D.A., Gibson, G.A., Katz, R.H.: A case for redundant arrays of inexpensive disks (RAID). In: Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, pp. 109–116 (1988)

    Google Scholar 

  10. Hung, S.-K., Hsu, Y.: Modularized redundant parallel virtual file system. In: Asia-Pacific Computer Systems Architecture Conference 2005, Singapore, pp. 186–199 (2005)

    Google Scholar 

  11. Stonebraker, M., Schloss, G.A.: Distributed RAID— A new multiple copy algorithm. In: Proceedings of 6th International Data Engineering Conference, pp. 430–437 (1990)

    Google Scholar 

  12. Long, D.D.E., Montague, B.R.: Swift/RAID: A distributed RAID system. Computing Systems 7(3), 333–359 (1994)

    Google Scholar 

  13. Hartman, J.H., Ousterhout, J.K.: The Zebra striped network file system. In: High Performance Mass Storage and Parallel I/O: Technologies and Applications, pp. 309–329. IEEE Computer Society Press and Wiley, New York (2001)

    Google Scholar 

  14. Sweeney, A., Doucette, D., Hu, W., Anderson, C., Nishimoto, M., Peck, G.: Scalability in the xFS file system. In: Proceedings of the USENIX 1996 Technical Conference, San Diego, CA, USA, pp. 1–14 (1996)

    Google Scholar 

  15. Soltis, S.R., Ruwart, T.M., O’Keefe, M.T.: The Global File System. In: Proceedings of the Fifth NASA Goddard Conference on Mass Storage Systems and Technologies, College Park, MD, pp. 319–342 (1996)

    Google Scholar 

  16. Schmuck, F., Haskin, R.: GPFS: A shared-disk file system for large computing clusters. In: Proc. of the First Conference on File and Storage Technologies (FAST), pp. 231–244 (2002)

    Google Scholar 

  17. Hwang, K., Jin, H., Ho, R.S.: Orthogonal striping and mirroring in distributed RAID for I/O-centric cluster computing. IEEE Trans. Parallel Distrib. Syst. 13(1), 26–44 (2002)

    Article  Google Scholar 

  18. Zhu, Y., Jiang, H., Qin, X., Feng, D., Swanson, D.R.: Design, implementation and performance evaluation of a Cost-Effective, Fault-Tolerance parallel virtual file system. In: International Workshop on Storage Network Architecture and Parallel I/Os, New Orleans, LA (2003)

    Google Scholar 

  19. Moyer, S.A., Sunderam, V.S.: PIOUS: a scalable parallel I/O system for distributed computing environments. In: Proceedings of the Scalable High-Performance Computing Conference, pp. 71–78 (1994)

    Google Scholar 

  20. Lee, E.K., Thekkath, C.A.: Petal: Distributed virtual disks. In: High Performance Mass Storage and Parallel I/O: Technologies and Applications, pp. 420–430. IEEE Computer Society Press and Wiley, New York (2001)

    Google Scholar 

  21. Pillai, M., Lauria, M.: CSAR: Cluster storage with adaptive redundancy. In: Proceedings of the 2003 International Conference on Parallel Processing, Kaohsiung, Taiwan, ROC, pp. 223–230 (2003)

    Google Scholar 

  22. Wilkes, J., Golding, R., Staelin, C., Sullivan, T.: The hp autoraid hierarchical storage system. ACM Transactions on Computer Systems (TOCS) 14(3), 108–136 (1996)

    Article  Google Scholar 

  23. Coker, R.: Bonnie++ – file system benchmark, http://www.coker.com.au/bonnie++/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hung, SK., Hsu, Y. (2006). DPCT: Distributed Parity Cache Table for Redundant Parallel File System. In: Gerndt, M., Kranzlmüller, D. (eds) High Performance Computing and Communications. HPCC 2006. Lecture Notes in Computer Science, vol 4208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847366_33

Download citation

  • DOI: https://doi.org/10.1007/11847366_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-39368-9

  • Online ISBN: 978-3-540-39372-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics