MIT 6 033 - Preparation for Recitation 15 (2 pages)

Previewing page 1 of 2 page document View the full content.
View Full Document

Preparation for Recitation 15



Previewing page 1 of actual document.

View the full content.
View Full Document
View Full Document

Preparation for Recitation 15

93 views

Lecture Notes


Pages:
2
School:
Massachusetts Institute of Technology
Course:
6 033 - Computer System Engineering
Computer System Engineering Documents

Unformatted text preview:

MIT OpenCourseWare http ocw mit edu 6 033 Computer System Engineering Spring 2009 For information about citing these materials or our Terms of Use visit http ocw mit edu terms Preparation for Recitation 15 Read A Case for Redundant Arrays of Inexpensive Disks RAID by Patterson et al Proceedings of the ACM SIGMOD Conference 1988 Read the paper and think of an answer to the following question Modern RAID arrays use parity information and standby disks to provide a highly reliable storage medium even in the face of hardware failures A highly reliable system however requires more than just a highly reliable storage medium Consider a networked server handling network transactions a web server or bank central computer perhaps Think about other components of this system whose failure could result in a loss of service Pick out a few of these and explain how they might be made more reliable in the same way that RAID made disks more reliable For example multiple power supplies can be arranged in parallel to power a machine even if one fails For your examples consider at least one hardware component and one software component of the system



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Preparation for Recitation 15 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Preparation for Recitation 15 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?