ACM Home Page
Please provide us with feedback. Feedback
Parity logging disk arrays
Full text PdfPdf (1.98 MB)
Source ACM Transactions on Computer Systems (TOCS) archive
Volume 12 ,  Issue 3  (August 1994) table of contents
Pages: 206 - 235  
Year of Publication: 1994
ISSN:0734-2071
Authors
Daniel Stodolsky  Carnegie Mellon Univ., Pittsburgh, PA
Mark Holland  Carnegie Mellon Univ., Pittsburgh, PA
William V. Courtright, II  Carnegie Mellon Univ., Pittsburgh, PA
Garth A. Gibson  Carnegie Mellon Univ., Pittsburgh, PA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 28,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/185514.185516
What is a DOI?

ABSTRACT

Parity-encoded redundant disk arrays provide highly reliable, cost-effective secondary storage with high performance for reads and large writes. Their performance on small writes, however, is much worse than mirrored disks—the traditional, highly reliable, but expensive organization for secondary storage. Unfortunately, small writes are a substantial portion of the I/O workload of many important, demanding applications such as on-line transaction processing. This paper presents parity logging, a novel solution to the small-write problem for redundant disk arrays. Parity logging applies journalling techniques to reduce substantially the cost of small writes. We provide detailed models of parity logging and competing schemes—mirroring, floating storage, and RAID level 5—and verify these models by simulation. Parity logging provides performance competitive with mirroring, but with capacity overhead close to the minimum offered by RAID level 5. Finally, parity logging can exploit data caching more effectively than all three alternative approaches.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BHIDE, A, AND DIAS, D. 1992. RAID architectures for OLTP. Computer Science Research Report RC 17879, IBM Corp., Almaden, Cahf
2
3
 
4
DISK/TREND, INc. 1994.1994 DISK/TREND Report. Disk Drive Arrays. DISK/TREND, Inc., Mountain View, Calif.
 
5
FEIGEL, C. 1994. Flash memory heads toward mainstream. Microprocess. Rep. 8, 7, 19-25.
6
 
7
 
8
9
 
10
IBM CORP. 1989. IBM 0661 Dtsk Drive Product Descr~ptwn, Model 370, First Edition, Low End Storage Products, 504/114-2. IBM Corp., Armonk, New York.
 
11
MENON, J. 1993. Performance of RAID5 disk arrays with read and write caching. Computer Science Res. Rep. RJ9485(83363). IBM Corp., Alamaden, Calif.
 
12
MENON, J., AND KASSON, J. 1992. Methods for improved update performance of disk arrays. In Proceedtngs of the Hawalt International Conference on System Sctences. IEEE Computer Society Press, Los Alamitos, Calif., vol. 1, 74-83.
13
 
14
15
 
16
17
18
 
19
 
20
SC~ULZE, M. E., GmSON, G. A., KATZ, R. H., AND PATTERSON, D.A. 1989. How reliable is s RAID? In Proceedings of the 1989 IEEE Computer Society Internatwnal Conference. IEEE Computer Society Press, Los Alamitos, Calif., 118 123.
 
21
SEbTZ~R, M., CHEN, P., AND OUSTERHOUT, J. 1990. Disk scheduling revisited In Proceedings of the Winter 1990 USENIX Conference. USENIX Assoc., Berkeley, Calif., 313-324.
22
 
23
24
 
25
STODOLSKY, D., HOLLAND M., COURTRICHT, W., AND GIBSON, G. 1994. Parity logging disk arrays. Computer Science Research CMU-CS-94-170, Carnegie Mellon Univ., Pittsburgh, Penn.
 
26
TPC 1989. The TPC-A Benchmark: A Standard Specifzcation. Transaction Processing Performance Council.

CITED BY  10

Collaborative Colleagues:
Daniel Stodolsky: colleagues
Mark Holland: colleagues
William V. Courtright, II: colleagues
Garth A. Gibson: colleagues