Evaluating approximately balanced parity-declustered data layouts for disk arrays

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Evaluating approximately balanced parity-declustered data layouts for disk arrays

Full text

Pdf (1.06 MB)

Source

Workshop on I/O in Parallel and Distributed Systems archive
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference table of contents

Philadelphia, Pennsylvania, United States

Pages: 41 - 54

Year of Publication: 1996

ISBN:0-89791-813-4

Authors

Eric J. Schwabe	Department of EECS, Northwestern University, Evanston, IL
Ian M. Sutherland	Department of EECS, Northwestern University, Evanston, IL
Bruce K. Holmer	Department of EECS, Northwestern University, Evanston, IL

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
IEEE-CS\TCOS : TC on Operating Systems & Application Environments
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
SIGOPS: ACM Special Interest Group on Operating Systems

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 6, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/236017.236031 What is a DOI?

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	D. Angluin and L. G. Valiant. "Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings." Journal o} Computer and System Sciences, 18(2)::t55-193, 1979.
	2	Mary G. Baker , John H. Hartman , Michael D. Kupfer , Ken W. Shirriff , John K. Ousterhout, Measurements of a distributed file system, Proceedings of the thirteenth ACM symposium on Operating systems principles, p.198-212, October 13-16, 1991, Pacific Grove, California, United States [doi>10.1145/121132.121164]
	3	R. C. Bose. "On the construction of balanced incomplete block designs." Ann. of Eugenics, Vol. 9, pp. 353-399, 1939.
	4	Peter M. Chen , David A. Patterson, Maximizing performance in a striped disk array, Proceedings of the 17th annual international symposium on Computer Architecture, p.322-331, May 28-31, 1990, Seattle, Washington, United States [doi>10.1145/325164.325158]
	5	S. Geman and D. Geman. "Stochastic Relaxation, Gibbs Distributions, and the Bayes Restoration of Images." IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 6, pp. 721-741, 1984.
	6	G. A. Gibson , L. Hellerstein , R. M. Karp , D. A. Patterson, Failure correction techniques for large disk arrays, Proceedings of the third international conference on Architectural support for programming languages and operating systems, p.123-132, April 03-06, 1989, Boston, Massachusetts, United States [doi>10.1145/70082.68194]
	7	H. I-Ianani. "Balanced Incomplete Block Designs and Related Designs." Discrete Mathematics, Vol. 11, pp. 255-369, 1975.
	8	M. Holland. Personal communication, 1994.
	9	Mark Holland , Garth A. Gibson, Parity declustering for continuous operation in redundant disk arrays, Proceedings of the fifth international conference on Architectural support for programming languages and operating systems, p.23-35, October 12-15, 1992, Boston, Massachusetts, United States [doi>10.1145/143365.143383]
	10	Mark Holland , Garth A. Gibson , Daniel P. Siewiorek, Architectures and algorithms for on-line failure recovery in redundant disk arrays, Distributed and Parallel Databases, v.2 n.3, p.295-335, July 1994 [doi>10.1007/BF01266332]
	11	IBM Corporation, IBM 0661 Disk Drive Product Description, Model 370, First Edition, Low Elad Storage Products, 504/114-2, 1989.
	12	R. H. Katz, A project on high performance I/0 subsystems, ACM SIGARCH Computer Architecture News, v.17 n.5, p.24-31, Sep. 1989 [doi>10.1145/71302.71305]
	13	S. Kirkpatrick, C. Gelatt and M. Vecchi. "Optimization by Simulated Annealing." Science 220:671, 1983.
	14	Edward K. Lee , Randy H. Katz, Performance consequences of parity placement in disk arrays, Proceedings of the fourth international conference on Architectural support for programming languages and operating systems, p.190-199, April 08-11, 1991, Santa Clara, California, United States [doi>10.1145/106972.106992]
	15	A. Merchant and P. S. Yu. "Design and Modeling of Clustered RAID." Proceedings o} the 2Pnd International Symposium on Fault-Tolerant Computing, pp. 140-149, 1992.
	16	Richard R. Muntz , John C. S. Lui, Performance analysis of disk arrays under failure, Proceedings of the sixteenth international conference on Very large databases, p.162-173, September 1990, Brisbane, Australia
	17	John K. Ousterhout , Andrew R. Cherenson , Frederick Douglis , Michael N. Nelson , Brent B. Welch, The Sprite Network Operating System, Computer, v.21 n.2, p.23-36, February 1988 [doi>10.1109/2.16]
	18	David A. Patterson , Garth Gibson , Randy H. Katz, A case for redundant arrays of inexpensive disks (RAID), Proceedings of the 1988 ACM SIGMOD international conference on Management of data, p.109-116, June 01-03, 1988, Chicago, Illinois, United States [doi>10.1145/50202.50214]
	19	Eric J. Schwabe , Ian M. Sutherland, Improved parity-declustered layouts for disk arrays, Journal of Computer and System Sciences, v.53 n.3, p.328-343, Dec. 1996 [doi>10.1006/jcss.1996.0073]
	20	E. J. Schwabe and I. M. Sutherland. "Flexible Usage of Parity Storage Space in Disk Arrays." Unpublished manuscript, 1996.
	21	L. Stockmeyer. "Parallelism in Parity-Declustered Layouts for Disk Arrays." IBM Technical Report RJ-9915, 1994.