EECS 252 Graduate Computer Architecture Lec 01 252研究生计算机系统结构01采用LEC.pptxVIP

下载本文档

4
0
约 23页
2017-06-15 发布于上海
举报
版权申诉

EECS 252 Graduate Computer Architecture Lec 01 252研究生计算机系统结构01采用LEC.pptx

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

EECS 262a Advanced Topics in Computer SystemsLecture 3Filesystems (Con’t)September 10th, 2012 John Kubiatowicz and Anthony D. Joseph Electrical Engineering and Computer Sciences University of California, Berkeley /~kubitron/cs262 Today’s Papers The HP AutoRAID Hierarchical Storage System (2-up version), John Wilkes, Richard Golding, Carl Staelin, and Tim Sullivan. Appears in ACM Transactions on Computer Systems, Vol. 14, No, 1, February 1996, Pages 108-136. Finding a needle in Haystack: Facebook’s photo storage,Doug Beaver, Sanjeev Kumar, Harry C. Li, Jason Sobel, Peter Vajgel. Appears in Proceedings of the USENIX conference in Operating Systems Design and Implementation (OSDI), 2010 System design paper and system analysis paper Thoughts? Array Reliability Reliability of N disks = Reliability of 1 Disk ÷ N 50,000 Hours ÷ 70 disks = 700 hours Disk system MTTF: Drops from 6 years to 1 month! ? Arrays (without redundancy) too unreliable to be useful! Hot spares support reconstruction in parallel with access: very high media availability can be achieved RAID Basics (Two optional papers) Levels of RAID (those in RED are actually used): RAID 0: striping with no parity (just bandwidth) RAID 1: Mirroring (simple, fast, but requires 2x storage) Reads faster, writes slower (why?) RAID 2: bit interleaving with error-correcting codes (ECC) Dedicated parity disk (RAID level 3), byte-level striping Dedicated parity disk is write bottleneck, since every write also writes parity RAID 4:dedicated parity disk, block-level striping RAID 5: Rotating parity disk, block-level striping most popular; rotating disk spreads out parity load RAID 6: RAID 5 with two parity blocks (tolerates two failures) If you don’t have RAID 6 with today’s drive sizes, you are asking for trouble…! Redundant Arrays of DisksRAID 1: Disk Mirroring/Shadowing ??Each disk is fully duplicated onto its shadow Very high availability can be achieved ? Bandwidth sacrifice on write: Logical w