Distributed concurrency control based on limited wait-depth

The performance of high-volume transaction processing systems for business applications is determined by the degree of contention for hardware resources as well as for data. Hardware resource requirements may be met cost-effectively with a data-partitioned or shared-nothing architecture. However, th...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 1993-11, Vol.4 (11), p.1246-1264
Main Authors: Franaszek, P.A., Haritsa, J.R., Robinson, J.T., Thomasian, A.
Format: Article
Language:English
Subjects:
Applied sciences
Bandwidth
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Concurrency control
Concurrent computing
Costs
Decision making
Distributed databases
Exact sciences and technology
Hardware
Software
System recovery
Tin
Transaction databases
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c337t-4ddacd411676dd0676d28459614e93646e2e6c96436a4e4582ccbee5417f89c83
cites cdi_FETCH-LOGICAL-c337t-4ddacd411676dd0676d28459614e93646e2e6c96436a4e4582ccbee5417f89c83
container_end_page 1264
container_issue 11
container_start_page 1246
container_title IEEE transactions on parallel and distributed systems
container_volume 4
creator Franaszek, P.A.
Haritsa, J.R.
Robinson, J.T.
Thomasian, A.
description The performance of high-volume transaction processing systems for business applications is determined by the degree of contention for hardware resources as well as for data. Hardware resource requirements may be met cost-effectively with a data-partitioned or shared-nothing architecture. However, the two-phase locking (2PL) concurrency control method may restrict the performance of a shared-nothing system more severely than that of a centralized system due to increased lock holding times. Deadlock detection and resolution are an added complicating factor in shared-nothing systems. The authors describe distributed Wait-Depth Limited (WDL) concurrency control (CC), a locking-based distributed CC method that limits the wait-depth of blocked transactions to one, thus preventing the occurrence of deadlocks. Several implementations of distributed WDL which vary in the number of messages and the amount of information available for decision making are discussed. The performance of a generic implementation of distributed WDL is compared with distributed 2PL (with general-waiting policy) and the Wound-Wait CC method through a detailed simulation. It is shown that distributed WDL behaves similarly to 2PL for low lock contention levels, but for substantial lock contention levels (caused by higher degrees of transaction concurrency), distributed WDL outperforms the other methods to a significant degree.< >
doi_str_mv 10.1109/71.250103
format article
fullrecord <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_proquest_miscellaneous_26001026</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>250103</ieee_id><sourcerecordid>26001026</sourcerecordid><originalsourceid>FETCH-LOGICAL-c337t-4ddacd411676dd0676d28459614e93646e2e6c96436a4e4582ccbee5417f89c83</originalsourceid><addsrcrecordid>eNqFkM1LxDAQxYMouK4evHragwgeumby1QRPsn7Cghc9hzSdYqTbrkmL7H9vS5e9epl58H7zYB4hl0CXANTc5bBkkgLlR2QGUuqMgebHg6ZCZoaBOSVnKX1TCkJSMSP3jyF1MRR9h-XCt43vY8TG70bdxbZeFC4NTtss6rAJI_TrQpeVuO2-zslJ5eqEF_s9J5_PTx-r12z9_vK2elhnnvO8y0RZOl8KAJWrsqTjZFpIo0Cg4UooZKi8UYIrJ1BIzbwvEKWAvNLGaz4nN1PuNrY_PabObkLyWNeuwbZPlmmmJFPwP6iGvylTA3g7gT62KUWs7DaGjYs7C9SOPdoc7NTjwF7vQ13yrq6ia3xIhwNBQWsYI68mLCDiwd1n_AHeJHiI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>26001026</pqid></control><display><type>article</type><title>Distributed concurrency control based on limited wait-depth</title><source>IEEE Xplore (Online service)</source><creator>Franaszek, P.A. ; Haritsa, J.R. ; Robinson, J.T. ; Thomasian, A.</creator><creatorcontrib>Franaszek, P.A. ; Haritsa, J.R. ; Robinson, J.T. ; Thomasian, A.</creatorcontrib><description>The performance of high-volume transaction processing systems for business applications is determined by the degree of contention for hardware resources as well as for data. Hardware resource requirements may be met cost-effectively with a data-partitioned or shared-nothing architecture. However, the two-phase locking (2PL) concurrency control method may restrict the performance of a shared-nothing system more severely than that of a centralized system due to increased lock holding times. Deadlock detection and resolution are an added complicating factor in shared-nothing systems. The authors describe distributed Wait-Depth Limited (WDL) concurrency control (CC), a locking-based distributed CC method that limits the wait-depth of blocked transactions to one, thus preventing the occurrence of deadlocks. Several implementations of distributed WDL which vary in the number of messages and the amount of information available for decision making are discussed. The performance of a generic implementation of distributed WDL is compared with distributed 2PL (with general-waiting policy) and the Wound-Wait CC method through a detailed simulation. It is shown that distributed WDL behaves similarly to 2PL for low lock contention levels, but for substantial lock contention levels (caused by higher degrees of transaction concurrency), distributed WDL outperforms the other methods to a significant degree.&lt; &gt;</description><identifier>ISSN: 1045-9219</identifier><identifier>EISSN: 1558-2183</identifier><identifier>DOI: 10.1109/71.250103</identifier><identifier>CODEN: ITDSEO</identifier><language>eng</language><publisher>Los Alamitos, CA: IEEE</publisher><subject>Applied sciences ; Bandwidth ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Concurrency control ; Concurrent computing ; Costs ; Decision making ; Distributed databases ; Exact sciences and technology ; Hardware ; Software ; System recovery ; Tin ; Transaction databases</subject><ispartof>IEEE transactions on parallel and distributed systems, 1993-11, Vol.4 (11), p.1246-1264</ispartof><rights>1994 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c337t-4ddacd411676dd0676d28459614e93646e2e6c96436a4e4582ccbee5417f89c83</citedby><cites>FETCH-LOGICAL-c337t-4ddacd411676dd0676d28459614e93646e2e6c96436a4e4582ccbee5417f89c83</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/250103$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=4018816$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Franaszek, P.A.</creatorcontrib><creatorcontrib>Haritsa, J.R.</creatorcontrib><creatorcontrib>Robinson, J.T.</creatorcontrib><creatorcontrib>Thomasian, A.</creatorcontrib><title>Distributed concurrency control based on limited wait-depth</title><title>IEEE transactions on parallel and distributed systems</title><addtitle>TPDS</addtitle><description>The performance of high-volume transaction processing systems for business applications is determined by the degree of contention for hardware resources as well as for data. Hardware resource requirements may be met cost-effectively with a data-partitioned or shared-nothing architecture. However, the two-phase locking (2PL) concurrency control method may restrict the performance of a shared-nothing system more severely than that of a centralized system due to increased lock holding times. Deadlock detection and resolution are an added complicating factor in shared-nothing systems. The authors describe distributed Wait-Depth Limited (WDL) concurrency control (CC), a locking-based distributed CC method that limits the wait-depth of blocked transactions to one, thus preventing the occurrence of deadlocks. Several implementations of distributed WDL which vary in the number of messages and the amount of information available for decision making are discussed. The performance of a generic implementation of distributed WDL is compared with distributed 2PL (with general-waiting policy) and the Wound-Wait CC method through a detailed simulation. It is shown that distributed WDL behaves similarly to 2PL for low lock contention levels, but for substantial lock contention levels (caused by higher degrees of transaction concurrency), distributed WDL outperforms the other methods to a significant degree.&lt; &gt;</description><subject>Applied sciences</subject><subject>Bandwidth</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Concurrency control</subject><subject>Concurrent computing</subject><subject>Costs</subject><subject>Decision making</subject><subject>Distributed databases</subject><subject>Exact sciences and technology</subject><subject>Hardware</subject><subject>Software</subject><subject>System recovery</subject><subject>Tin</subject><subject>Transaction databases</subject><issn>1045-9219</issn><issn>1558-2183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1993</creationdate><recordtype>article</recordtype><recordid>eNqFkM1LxDAQxYMouK4evHragwgeumby1QRPsn7Cghc9hzSdYqTbrkmL7H9vS5e9epl58H7zYB4hl0CXANTc5bBkkgLlR2QGUuqMgebHg6ZCZoaBOSVnKX1TCkJSMSP3jyF1MRR9h-XCt43vY8TG70bdxbZeFC4NTtss6rAJI_TrQpeVuO2-zslJ5eqEF_s9J5_PTx-r12z9_vK2elhnnvO8y0RZOl8KAJWrsqTjZFpIo0Cg4UooZKi8UYIrJ1BIzbwvEKWAvNLGaz4nN1PuNrY_PabObkLyWNeuwbZPlmmmJFPwP6iGvylTA3g7gT62KUWs7DaGjYs7C9SOPdoc7NTjwF7vQ13yrq6ia3xIhwNBQWsYI68mLCDiwd1n_AHeJHiI</recordid><startdate>19931101</startdate><enddate>19931101</enddate><creator>Franaszek, P.A.</creator><creator>Haritsa, J.R.</creator><creator>Robinson, J.T.</creator><creator>Thomasian, A.</creator><general>IEEE</general><general>IEEE Computer Society</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19931101</creationdate><title>Distributed concurrency control based on limited wait-depth</title><author>Franaszek, P.A. ; Haritsa, J.R. ; Robinson, J.T. ; Thomasian, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c337t-4ddacd411676dd0676d28459614e93646e2e6c96436a4e4582ccbee5417f89c83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1993</creationdate><topic>Applied sciences</topic><topic>Bandwidth</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Concurrency control</topic><topic>Concurrent computing</topic><topic>Costs</topic><topic>Decision making</topic><topic>Distributed databases</topic><topic>Exact sciences and technology</topic><topic>Hardware</topic><topic>Software</topic><topic>System recovery</topic><topic>Tin</topic><topic>Transaction databases</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Franaszek, P.A.</creatorcontrib><creatorcontrib>Haritsa, J.R.</creatorcontrib><creatorcontrib>Robinson, J.T.</creatorcontrib><creatorcontrib>Thomasian, A.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on parallel and distributed systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Franaszek, P.A.</au><au>Haritsa, J.R.</au><au>Robinson, J.T.</au><au>Thomasian, A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Distributed concurrency control based on limited wait-depth</atitle><jtitle>IEEE transactions on parallel and distributed systems</jtitle><stitle>TPDS</stitle><date>1993-11-01</date><risdate>1993</risdate><volume>4</volume><issue>11</issue><spage>1246</spage><epage>1264</epage><pages>1246-1264</pages><issn>1045-9219</issn><eissn>1558-2183</eissn><coden>ITDSEO</coden><abstract>The performance of high-volume transaction processing systems for business applications is determined by the degree of contention for hardware resources as well as for data. Hardware resource requirements may be met cost-effectively with a data-partitioned or shared-nothing architecture. However, the two-phase locking (2PL) concurrency control method may restrict the performance of a shared-nothing system more severely than that of a centralized system due to increased lock holding times. Deadlock detection and resolution are an added complicating factor in shared-nothing systems. The authors describe distributed Wait-Depth Limited (WDL) concurrency control (CC), a locking-based distributed CC method that limits the wait-depth of blocked transactions to one, thus preventing the occurrence of deadlocks. Several implementations of distributed WDL which vary in the number of messages and the amount of information available for decision making are discussed. The performance of a generic implementation of distributed WDL is compared with distributed 2PL (with general-waiting policy) and the Wound-Wait CC method through a detailed simulation. It is shown that distributed WDL behaves similarly to 2PL for low lock contention levels, but for substantial lock contention levels (caused by higher degrees of transaction concurrency), distributed WDL outperforms the other methods to a significant degree.&lt; &gt;</abstract><cop>Los Alamitos, CA</cop><pub>IEEE</pub><doi>10.1109/71.250103</doi><tpages>19</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1045-9219
ispartof IEEE transactions on parallel and distributed systems, 1993-11, Vol.4 (11), p.1246-1264
issn 1045-9219
1558-2183
language eng
recordid cdi_proquest_miscellaneous_26001026
source IEEE Xplore (Online service)
subjects Applied sciences
Bandwidth
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Concurrency control
Concurrent computing
Costs
Decision making
Distributed databases
Exact sciences and technology
Hardware
Software
System recovery
Tin
Transaction databases
title Distributed concurrency control based on limited wait-depth
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T09%3A20%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Distributed%20concurrency%20control%20based%20on%20limited%20wait-depth&rft.jtitle=IEEE%20transactions%20on%20parallel%20and%20distributed%20systems&rft.au=Franaszek,%20P.A.&rft.date=1993-11-01&rft.volume=4&rft.issue=11&rft.spage=1246&rft.epage=1264&rft.pages=1246-1264&rft.issn=1045-9219&rft.eissn=1558-2183&rft.coden=ITDSEO&rft_id=info:doi/10.1109/71.250103&rft_dat=%3Cproquest_pasca%3E26001026%3C/proquest_pasca%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c337t-4ddacd411676dd0676d28459614e93646e2e6c96436a4e4582ccbee5417f89c83%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=26001026&rft_id=info:pmid/&rft_ieee_id=250103&rfr_iscdi=true