锁(locks)-保证了并发控制(cc)的正确性但又限制了系统的扩展性(scalability)..pptxVIP

锁(locks)-保证了并发控制(cc)的正确性但又限制了系统的扩展性(scalability)..pptx

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
锁 (Locks): 保证了并发控制 (CC) 的正确性 但又限制了系统的扩展性 (Scalability) 怎么办?; 计算机 系统和应用进程的三个阶段;计算机系统本质是什么?;Number of Concurrent Processes;Throughput drops after reaching peak (MySQL);Latency increases as # threads increase to contend locks ;High Performance Computing is Scale-up based; Same Efforts to achieve high Scalability in BD systems; A sustained scalability is archived in large data systems by finding a proper balanced point between parallelism and latency ;Concurrency Control (CC);OCC executes a transaction in three phases: Phase 1: concurrent local processing Reads tuples into a read set Buffers writes into a write set Phase 2: Validation in critical section Validates whether serializability is guaranteed: Has any tuple in the read set been modified? Phase 3: Commit the results in critical section or abort Aborts: aborts the transaction if validation fails Commits: installs the write set and commits the transaction ;Validation;;Serializability Theorem;OCC: Serializable Scope;OCC’s Problem: False Aborts;Issues and Challenges ;Number of Concurrent Processes;BCC: Balanced Concurrency Control;Outline;Basic Structure of BCC;;If T’s read set remains the same, commit T. Otherwise: (1) Validating T2: If T is wr-, ww- or rw-dependent on T’s concurrent transactions. (2) Validating T1: Only when T1 is a snapshot transaction, can happen after T2 commits. If T is a snapshot transaction the transaction T is anti-dependent on also has anti-dependency. ;BCC’s Implementation;System Efforts: Minimizing Various Overheads;Evaluation;Comparable Performance in Low Contention;Effectiveness in High Contention (2PL is better than OCC);Effectiveness in High Contention (2PL is close to OCC);Effectiveness in High Contention (OCC is better than 2PL);Conclusions;系统研究总结;Balance: an Eternal theme of Human and Physical world 平衡:一个人类和物理世界的永恒主题 ;Number of Concurrent Processes;价格是一个市场供需平衡的结果;一个革命性但没有平衡点的经济理论;谢谢!

文档评论(0)

189****0315 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档