大内存对乐观并发控制方案性能的影响

Philip S. Yu, D. Dias
{"title":"大内存对乐观并发控制方案性能的影响","authors":"Philip S. Yu, D. Dias","doi":"10.1109/PARBSE.1990.77120","DOIUrl":null,"url":null,"abstract":"Under optimistic concurrency control (OCC) schemes, the buffer hit ratio and hence the abort probability of a rerun transaction can be affected by its previous runs, since the data items brought in from the previous runs may still be in memory. It is noted that this buffering effect on rerun transactions has been ignored in previous performance studies. In the present work the authors examine its effect on different OCC schemes. It is shown that, with sufficient buffer, a new approach to buffer management can be adopted so that data items referenced by aborted transactions continue to be retained in memory for access during rerun. By considering the I/O reduction during rerun, it is found that, at high contention levels, the broadcast OCC which attempts to abort conflicting transactions as early as possible can be inferior to the pure OCC which only aborts a transaction at its commit time. Second, combining the two schemes, with pure OCC during the first run of a transaction and broadcast OCC during any reruns, can typically lead to better performance, especially at high contention levels.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"210 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Impact of large memory on the performance of optimistic concurrency control schemes\",\"authors\":\"Philip S. Yu, D. Dias\",\"doi\":\"10.1109/PARBSE.1990.77120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Under optimistic concurrency control (OCC) schemes, the buffer hit ratio and hence the abort probability of a rerun transaction can be affected by its previous runs, since the data items brought in from the previous runs may still be in memory. It is noted that this buffering effect on rerun transactions has been ignored in previous performance studies. In the present work the authors examine its effect on different OCC schemes. It is shown that, with sufficient buffer, a new approach to buffer management can be adopted so that data items referenced by aborted transactions continue to be retained in memory for access during rerun. By considering the I/O reduction during rerun, it is found that, at high contention levels, the broadcast OCC which attempts to abort conflicting transactions as early as possible can be inferior to the pure OCC which only aborts a transaction at its commit time. Second, combining the two schemes, with pure OCC during the first run of a transaction and broadcast OCC during any reruns, can typically lead to better performance, especially at high contention levels.<<ETX>>\",\"PeriodicalId\":389644,\"journal\":{\"name\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"volume\":\"210 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PARBSE.1990.77120\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PARBSE.1990.77120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

在乐观并发控制(OCC)模式下,缓冲区命中率以及重新运行事务的中止概率可能会受到其先前运行的影响,因为从先前运行引入的数据项可能仍在内存中。值得注意的是,在以前的性能研究中忽略了对重新运行事务的缓冲影响。在本工作中,作者考察了它对不同OCC方案的影响。结果表明,在有足够缓冲区的情况下,可以采用一种新的缓冲区管理方法,以便被中止的事务引用的数据项继续保留在内存中,以便在重新运行期间访问。通过考虑重新运行期间的I/O减少,可以发现,在高争用级别下,试图尽早终止冲突事务的广播OCC可能不如仅在提交时终止事务的纯OCC。其次,结合这两种方案,在事务的第一次运行期间使用纯OCC,在任何重播期间使用广播OCC,通常可以带来更好的性能,特别是在高争用级别时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Impact of large memory on the performance of optimistic concurrency control schemes
Under optimistic concurrency control (OCC) schemes, the buffer hit ratio and hence the abort probability of a rerun transaction can be affected by its previous runs, since the data items brought in from the previous runs may still be in memory. It is noted that this buffering effect on rerun transactions has been ignored in previous performance studies. In the present work the authors examine its effect on different OCC schemes. It is shown that, with sufficient buffer, a new approach to buffer management can be adopted so that data items referenced by aborted transactions continue to be retained in memory for access during rerun. By considering the I/O reduction during rerun, it is found that, at high contention levels, the broadcast OCC which attempts to abort conflicting transactions as early as possible can be inferior to the pure OCC which only aborts a transaction at its commit time. Second, combining the two schemes, with pure OCC during the first run of a transaction and broadcast OCC during any reruns, can typically lead to better performance, especially at high contention levels.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信