{"title":"Mathematical modeling and simulation of an algorithm for optimistic concurrency control in centralized database systems","authors":"Lieh-san Lin, James Calhoun","doi":"10.1145/62351.62381","DOIUrl":null,"url":null,"abstract":"This paper presents the analysis of an algorithm for optimistic concurrency control in centralized database systems. The effectiveness of optimistic concurrency control in a centralized database system depends on the probability of transaction conflict being low. When conflict does occur, it is resolved by aborting the older transaction and allowing resubmission. The concern here is to examine the probability that a transaction is able to avoid conflict and commit. Specifically, a set of probabilistic formulas which provide an analysis of this probability is examined. Furthermore, a report of two simulation studies, the design and implementation of a GPSS simulation and the design of a simulation for the IBM token-ring network, is given.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Simulation Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/62351.62381","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper presents the analysis of an algorithm for optimistic concurrency control in centralized database systems. The effectiveness of optimistic concurrency control in a centralized database system depends on the probability of transaction conflict being low. When conflict does occur, it is resolved by aborting the older transaction and allowing resubmission. The concern here is to examine the probability that a transaction is able to avoid conflict and commit. Specifically, a set of probabilistic formulas which provide an analysis of this probability is examined. Furthermore, a report of two simulation studies, the design and implementation of a GPSS simulation and the design of a simulation for the IBM token-ring network, is given.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
