About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
International Conference on Parallel and Distributed Information Systems 1993
Conference paper
Performance analysis of a dual striping strategy for replicated disk arrays
Abstract
Data replicationhas been widely used as a means of increasing the data availabilityfor critical applicationsin the event of disk failure. This paper compares stmtegiesfor organizing the two copies of data in the context of database applications. We consider the effects of small and large stripe sizes on the performance of disk arrays with two active copies of data under a mixed workload of queries and transactions with a skewed access pattern. We propose a dual striping strategy which uses different stripe sires for the two copies. An analyticalperformance model is devised for this scheme, and the results are shown to match well with simulation data. Comparison with uniform striping stmtegies shows that the dual striping scheme yields the most stable performance in a variety of workloads, outperforming the uniform striping stmtegy using either mirrored or chaineddeclusteringunder both normal andfailure mode operations.