File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: PERFORMANCE STUDY OF TWO PHASE LOCKING IN SINGLE-SITE DATABASE SYSTEMS.

TitlePERFORMANCE STUDY OF TWO PHASE LOCKING IN SINGLE-SITE DATABASE SYSTEMS.
Authors
Issue Date1988
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tse
Citation
Ieee Transactions On Software Engineering, 1988, v. SE-13 n. 12, p. 1311-1328 How to Cite?
AbstractQueuing network models are used to study the problem for the preclaim and the claim-as-needed locking profiles. A wide variety of realistic conditions, such as different database-size/transaction-size ratios, and different granule placement assumptions, are considered. Using simple combinatorial arguments and elementary probability theory, the authors show that expressions for quantities such as the probability of a lock being granted, the probability of deadlock, and the mean wait time for a blocked request can all be derived analytically. The analysis is straightforward and the models are easy to understand. Validation of the models is done by comparing the models' predictions with simulation results, which shows very good agreement. Finally, the problem for a claim-with-ordering locking policy is studied. Because analytic modeling of this policy is difficult, a simulation model is used instead.
Persistent Identifierhttp://hdl.handle.net/10722/152226
ISSN
2015 Impact Factor: 1.516
2015 SCImago Journal Rankings: 1.543

 

DC FieldValueLanguage
dc.contributor.authorPun, KHen_US
dc.contributor.authorBelford, Geneva Gen_US
dc.date.accessioned2012-06-26T06:36:37Z-
dc.date.available2012-06-26T06:36:37Z-
dc.date.issued1988en_US
dc.identifier.citationIeee Transactions On Software Engineering, 1988, v. SE-13 n. 12, p. 1311-1328en_US
dc.identifier.issn0098-5589en_US
dc.identifier.urihttp://hdl.handle.net/10722/152226-
dc.description.abstractQueuing network models are used to study the problem for the preclaim and the claim-as-needed locking profiles. A wide variety of realistic conditions, such as different database-size/transaction-size ratios, and different granule placement assumptions, are considered. Using simple combinatorial arguments and elementary probability theory, the authors show that expressions for quantities such as the probability of a lock being granted, the probability of deadlock, and the mean wait time for a blocked request can all be derived analytically. The analysis is straightforward and the models are easy to understand. Validation of the models is done by comparing the models' predictions with simulation results, which shows very good agreement. Finally, the problem for a claim-with-ordering locking policy is studied. Because analytic modeling of this policy is difficult, a simulation model is used instead.en_US
dc.languageengen_US
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tseen_US
dc.relation.ispartofIEEE Transactions on Software Engineeringen_US
dc.titlePERFORMANCE STUDY OF TWO PHASE LOCKING IN SINGLE-SITE DATABASE SYSTEMS.en_US
dc.typeArticleen_US
dc.identifier.emailPun, KH:pun@cs.hku.hken_US
dc.identifier.authorityPun, KH=rp00164en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0023669957en_US
dc.identifier.volumeSE-13en_US
dc.identifier.issue12en_US
dc.identifier.spage1311en_US
dc.identifier.epage1328en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridPun, KH=8979404900en_US
dc.identifier.scopusauthoridBelford, Geneva G=7004236690en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats