Toward building high-availability disk-array-based storage servers

Ming-Syan Chen; Jeng-Chun Chen

doi:10.1117/12.253390

30 September 1996 Toward building high-availability disk-array-based storage servers

Ming-Syan Chen, Jeng-Chun Chen

Proceedings Volume 2898, Electronic Imaging and Multimedia Systems; (1996) https://doi.org/10.1117/12.253390
Event: Photonics China '96, 1996, Beijing, China

Abstract

In multimedia applications, disk-arrays are often used to support he disk bandwidth requirements and data availability. Serious problems on available disk bandwidth and data availability could occur upon disk failure. In this paper, we discuss issues related to replicating data copies to provide high fault-tolerance required in a disk-array- based storage server. Replication and parity are two approaches to increase fault tolerance. By exploring theoretical aspects of these two concepts, we examine methods to build high availability disk arrays with multiple redundancy. The data allotment presented achieves the optimal fault-tolerance for goth triple and quadruple redundant disk arrays. Some theoretical properties of this problem are investigated.

Citation Download Citation

Ming-Syan Chen and Jeng-Chun Chen "Toward building high-availability disk-array-based storage servers", Proc. SPIE 2898, Electronic Imaging and Multimedia Systems, (30 September 1996); https://doi.org/10.1117/12.253390

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available