NDLI: Performance analysis of locking policies with limited wait depth

Content Provider	ACM Digital Library
Author	Thomasian, Alexander
Abstract	The performance of a transaction processing system with the standard two-phase locking (2PL) concurrency control (CC) method (with the general waiting policy upon a lock conflict) may be degraded significantly due to transaction blocking in a high lock contention environment. In the limit this effect leads to the thrashing phenomenon, i.e., the majority of the transactions in the system become blocked. Limiting the wait depth of blocked transactions is an effective method to increase the number of active transactions in the system and to prevent thrashing, but this is at the cost of additional processing due to transaction restarts. The no-waiting (or immediate restart) policy limits the wait-depth to zero, while cautious waiting and the running priority policies use different methods to limit the wait depth to one. A variant of the wait depth limited (WDL) policy [8] also limits the wait depth to one, while attempting to minimize the wasted processing incurred by transaction aborts. A unified methodology to analyze the performance of the 2PL CC method with limited wait depth policies in a system with multiple transaction classes is described in this paper. The analysis is based on Markov chains representing the execution steps of each transaction in isolation, but as affected by hardware resource and data contention with other transactions in the system. Since the transition rates of the Markov chain are not known a priori, an iterative solution method is developed, which is then applied to the running priority and WDL policies. Simulation is used for validating the accuracy of the approximate analytic solutions. Of interest are the conservation laws governing the rate at which locks are transferred among transactions, which can be used to verify the correctness of the analysis.
Starting Page	115
Ending Page	127
Page Count	13
File Format	PDF
ISSN	01635999
DOI	10.1145/149439.133095
Journal	ACM SIGMETRICS Performance Evaluation Review (PERV)
Volume Number	20
Issue Number	1
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-01-10
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Analysis of locking policies in database management systems

Performance analysis of locking policies with limited wait depth

Performance analysis of “Time Warp” with limited memory

A performance comparison of locking methods with limited wait depth

Analysis of size interval task assignment policies

Performance analysis of communications in static interconnection networks

Some new disk scheduling policies and their performance

Performance comparison of thrashing control policies for concurrent Mergesorts with parallel prefetching

Performance analysis of multiclass queueing networks

Performance analysis of locking policies with limited wait depth

Similar Documents

Analysis of locking policies in database management systems

Performance analysis of locking policies with limited wait depth

Performance analysis of “Time Warp” with limited memory

A performance comparison of locking methods with limited wait depth

Analysis of size interval task assignment policies

Performance analysis of communications in static interconnection networks

Some new disk scheduling policies and their performance

Performance comparison of thrashing control policies for concurrent Mergesorts with parallel prefetching

Performance analysis of multiclass queueing networks

Performance analysis of locking policies with limited wait depth