Skip to main content
SpringerLink
Log in
Book cover

Workshop on wide area networks and high performance computing pp 307–330Cite as

Highly available distributed storage systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 249))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. A. Anderson, “Symmetry Groups of Some Perfect 1-Factorizations of Complete Graphs,” Discrete Mathematics, 18, 227–234, 1977.

    Article  MathSciNet  Google Scholar 

  2. M. Blaum, J. Brady, J. Bruck and J. Menon, “EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures,” IEEE Trans. on Computers, 44(2), 192–202, Feb. 1995.

    Article  MATH  Google Scholar 

  3. M. Blaum, J. Bruck, A. Vardy, “MDS Array Codes with Independent Parity Symbols,” IEEE Trans. on Information Theory, 42(2), 529–542, March 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. Blaum, P. G. Farrell and H. C. A. van Tilborg, “Chapter on Array Codes”, Handbook of Coding Theory, edited by V. S. Pless and W. C. Huffman, to appear.

    Google Scholar 

  5. M. Blaum, R. M. Roth, “New Array Codes for Multiple Phased Burst Correction,” IEEE Trans. on Information Theory, 39(1), 66–77, Jan. 1993.

    Article  MATH  MathSciNet  Google Scholar 

  6. V. Bohossian, C. Fan, P. LeMahieu, M. Riedel, L. Xu and J. Bruck, “Computing in the RAIN: A Reliable Array of Independent Nodes”, Caltech Technical Report, 1998. Available at: http://paradise.caltech.edu/papers/etr029.ps.

    Google Scholar 

  7. M. N. Frank, “Dispersity Routing in Store-and-Forward Networks,” Ph.D. thesis, University of Pennsylvania, 1975.

    Google Scholar 

  8. P. G. Farrell, “A Survey of Array Error Control Codes,” ETT, 3(5), 441–454, 1992.

    Google Scholar 

  9. R. G. Gallager, “Low-Density Parity-Check Codes,” MIT Press, Cambridge, Massachusetts, 1963.

    Google Scholar 

  10. J. Gemmell, “Scalable Reliable Multicast Using Erasuring-Correcting Re-Sends,” Technical Report MSR-TR-97-20, Microsoft Research, June, 1997.

    Google Scholar 

  11. R. M. Goodman, R. J. McEliece and M. Sayano, “Phased Burst Error Correcting Arrays Codes,” IEEE Trans. on Information Theory, 39, 684–693, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  12. A. Kotzig, “Hamilton Graphs and Hamilton Circuits,” Theory of Graphs and Its Applications (Proc. Sympos. Smolenice), 63–82, 1963.

    Google Scholar 

  13. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes, Amsterdam: North-Holland, 1977.

    MATH  Google Scholar 

  14. Norman K. Ouchi, “System for Recovering Data Stored in Failed Memory Unit,” US Patent 4092732, May 30, 1978.

    Google Scholar 

  15. A. Papoulis, Probability, Random Variables, and Stochastic Processes, 2nd Edition, McGraw-Hill, Inc., 1984.

    Google Scholar 

  16. D. A. Patterson, G. A. Gibson and R. H. Katz, “A Case for Redundant Arrays of Inexpensive Disks,” Proc. SIGMOD Int. Conf. Data Management, 109–116, Chicago, IL, 1988.

    Google Scholar 

  17. R. M. Tanner, “A Recursive Approach to Low Complexity Codes,” IEEE Trans. on Information Theory, 27(5), 533–547, Sep. 1981.

    Article  MATH  MathSciNet  Google Scholar 

  18. D. G. Wagner, “On the Perfect One-Factorization Conjecture,” Discrete Mathematics, 104, 211–215, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  19. W. D. Wallis, One-Factorizations, Kluwer Academic Publisher, 1997.

    Google Scholar 

  20. Samuel S. Wilks, Mathematical Statistics, John Wiley & Sons, Inc., 1963.

    Google Scholar 

  21. L. Xu and J. Bruck, “X-Code: MDS Array Codes with Optimal Encoding,” IEEE Trans. on Information Theory, 45(1), 272–276, Jan., 1999. Also available at: http://paradise.caltech.edu/papers/etr020.ps.

    Article  MATH  MathSciNet  Google Scholar 

  22. L. Xu, V. Bohossian, J. Bruck and D. Wagner, “Low Density MDS Codes and Factors of Complete Graphs,” Proceedings of 1998 IEEE Symposium on Information Theory, Aug., 1998; Revised version to appear in IEEE Trans. on Information Theory, Sep. 1999. Also available at: http://paradise.caltech.edu/papers/etr025.ps.

    Google Scholar 

  23. L. Xu, “Highly Available Distributed Storage Systems,” Ph.D. thesis, California Institute of Technology, 1998. Also available at: http://paradise.caltech.edu/∼lihao/thesis.html.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Washington University, Campus Box 1045, 63130, Saint Louis, MO, USA

    Lihao Xu

  2. Department of Electrical Engineering, California Institute of Technology, Mail Stop 136-93, 91125, Pasadena, CA, USA

    Jehoshua Bruck

Authors
  1. Lihao Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jehoshua Bruck
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Cooperman (Professor)E. Jessen (Professor)G. Michler (Professor)

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag London Limited

About this paper

Cite this paper

Xu, L., Bruck, J. (1999). Highly available distributed storage systems. In: Cooperman, G., Jessen, E., Michler, G. (eds) Workshop on wide area networks and high performance computing. Lecture Notes in Control and Information Sciences, vol 249. Springer, London. https://doi.org/10.1007/BFb0110096

Download citation

  • DOI: https://doi.org/10.1007/BFb0110096

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-642-4

  • Online ISBN: 978-1-84628-578-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation