File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: An efficient deadlock prevention approach for service oriented transaction processing

TitleAn efficient deadlock prevention approach for service oriented transaction processing
Authors
KeywordsDeadlock prevention
Distributed transaction processing
Replication
Service oriented
Two-phase commit (2PC)
Issue Date2012
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/camwa
Citation
Computers & Mathematics with Applications, 2012, v. 63 n. 2, p. 458–468 How to Cite?
AbstractTransaction processing can guarantee the reliability of business applications. Locking resources is widely used in distributed transaction management (e.g., two phase commit, 2PC) to keep the system consistent. The locking mechanism, however, potentially results in various deadlocks. In service oriented architecture (SOA), the deadlock problem becomes even worse because multiple (sub)transactions try to lock shared resources in the unexpectable way due to the more randomicity of transaction requests, which has not been solved by existing research results. In this paper, we investigate how to prevent local deadlocks, caused by the resource competition among multiple sub-transactions of a global transaction, and global deadlocks from the competition among different global transactions. We propose a replication based approach to avoid the local deadlocks, and a timestamp based approach to significantly mitigate the global deadlocks. A general algorithm is designed for both local and global deadlock prevention. The experimental results demonstrate the effectiveness and efficiency of our deadlock prevention approach. Further, it is also proved that our approach provides higher system performance than traditional resource allocation schemes. © 2011 Elsevier Ltd. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/152026
ISSN
2015 Impact Factor: 1.398
2015 SCImago Journal Rankings: 1.092
ISI Accession Number ID
Funding AgencyGrant Number
National Natural Science Foundation of China (NSFC)61073148
Hong Kong RGCHKU 717909E
Funding Information:

This work was supported by the National Natural Science Foundation of China (NSFC, No. 61073148), and Hong Kong RGC (No. HKU 717909E).

References
Grants

 

DC FieldValueLanguage
dc.contributor.authorTang, Fen_US
dc.contributor.authorYou, Ien_US
dc.contributor.authorYu, Sen_US
dc.contributor.authorWang, CLen_US
dc.contributor.authorGuo, Men_US
dc.contributor.authorLiu, Wen_US
dc.date.accessioned2012-06-26T06:32:38Z-
dc.date.available2012-06-26T06:32:38Z-
dc.date.issued2012en_US
dc.identifier.citationComputers & Mathematics with Applications, 2012, v. 63 n. 2, p. 458–468en_US
dc.identifier.issn0898-1221en_US
dc.identifier.urihttp://hdl.handle.net/10722/152026-
dc.description.abstractTransaction processing can guarantee the reliability of business applications. Locking resources is widely used in distributed transaction management (e.g., two phase commit, 2PC) to keep the system consistent. The locking mechanism, however, potentially results in various deadlocks. In service oriented architecture (SOA), the deadlock problem becomes even worse because multiple (sub)transactions try to lock shared resources in the unexpectable way due to the more randomicity of transaction requests, which has not been solved by existing research results. In this paper, we investigate how to prevent local deadlocks, caused by the resource competition among multiple sub-transactions of a global transaction, and global deadlocks from the competition among different global transactions. We propose a replication based approach to avoid the local deadlocks, and a timestamp based approach to significantly mitigate the global deadlocks. A general algorithm is designed for both local and global deadlock prevention. The experimental results demonstrate the effectiveness and efficiency of our deadlock prevention approach. Further, it is also proved that our approach provides higher system performance than traditional resource allocation schemes. © 2011 Elsevier Ltd. All rights reserved.en_US
dc.languageengen_US
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/camwaen_US
dc.relation.ispartofComputers & Mathematics with Applicationsen_US
dc.subjectDeadlock preventionen_US
dc.subjectDistributed transaction processingen_US
dc.subjectReplicationen_US
dc.subjectService orienteden_US
dc.subjectTwo-phase commit (2PC)en_US
dc.titleAn efficient deadlock prevention approach for service oriented transaction processingen_US
dc.typeArticleen_US
dc.identifier.emailTang, F: tang-fl@cs.sjtu.edu.cnen_US
dc.identifier.emailWang, CL: clwang@cs.hku.hk-
dc.identifier.authorityWang, CL=rp00183en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/j.camwa.2011.07.063en_US
dc.identifier.scopuseid_2-s2.0-84855422787en_US
dc.identifier.hkuros211148-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84855422787&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume63en_US
dc.identifier.issue2en_US
dc.identifier.spage458–468en_US
dc.identifier.epage458–468en_US
dc.identifier.eissn1873-7668-
dc.identifier.isiWOS:000300595700011-
dc.publisher.placeUnited Kingdomen_US
dc.relation.projectAdaptive Software Support for Fine-Grained Distributed Object Sharing on Multicore Clusters-
dc.identifier.scopusauthoridLiu, W=36139058500en_US
dc.identifier.scopusauthoridGuo, M=7201564780en_US
dc.identifier.scopusauthoridWang, CL=7501646188en_US
dc.identifier.scopusauthoridYu, S=35335695100en_US
dc.identifier.scopusauthoridYou, I=14038401900en_US
dc.identifier.scopusauthoridTang, F=7201979841en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats