Filters








1,482 Hits in 8.4 sec

Reducing Sub-transaction Aborts and Blocking Time Within Atomic Commit Protocols [chapter]

Stefan Böttcher, Le Gruenwald, Sebastian Obermeier
2006 Lecture Notes in Computer Science  
In this paper, we introduce an extension to existing atomic commit protocols, which decreases the time during which a resource manager that is involved in a web-service is blocked.  ...  In addition, our proposal reduces the number of sub-transaction aborts that arise due to message loss or due to conflicting concurrent transactions by distinguishing re-usable and repeatable sub-transactions  ...  To reduce both, the blocking time and the probability of an abort, our solution distinguishes between two states within which a transaction waits for the global commit decision: Besides a blocking state  ... 
doi:10.1007/11788911_5 fatcat:u3vlvobx6rcfbj7noazkqveq34

A low-latency resilient protocol for e-business transactions

Muhammad Younas, Barry Eaglestone, Kuo-Ming Chao
2004 International Journal of Web Engineering and Technology  
The analysis given shows that LLR avoids resource blocking of e-business systems and significantly reduces response time between such systems.  ...  This is achieved through the use of e-business transaction within which alternative sub-transactions are specified. , in 2001.  ...  PA protocol reduces the numbers of messages and forced-write operations by assuming that a sub-transaction is aborted, in the absence of confirmation that it has been committed.  ... 
doi:10.1504/ijwet.2004.005234 fatcat:gnzsv2touvemhjjsoppdac6tlq

Performance of Short-Commit in Extreme Database Environment

Muhammad Tayyab Shahzad, Muhammad Rizwan
2011 International Journal of Database Management Systems  
Atomic commit protocols are used where data integrity is more important than data availability. Two-Phase commit (2PC) is a standard commit protocol for commercial database management systems.  ...  Short-Commit protocol is developed with an objective to achieve low cost transaction commitment cost with nonblocking capability.  ...  Optimistic commit protocol reduces blocking time period on the assumption that every transaction will commit eventually [17] .  ... 
doi:10.5121/ijdms.2011.3203 fatcat:vpkdwopcqfblncqzmahag4skny

A Failure Tolerating Atomic Commit Protocol for Mobile Environments

Stefan Bottcher, Le Gruenwald, Sebastian Obermeier
2007 2007 International Conference on Mobile Data Management  
To use traditional database applications within a mobile scenario, we need an atomic commit protocol that reduces the chance of infinite blocking.  ...  In traditional fixed-wired networks, standard protocols like 2-Phase-Commit are used to guarantee atomicity for distributed transactions.  ...  To apply distributed database technology in mobile networks, we need a non-blocking atomic commit protocol that not only stabilizes the coordination process, but also reduces the blocking of participating  ... 
doi:10.1109/mdm.2007.31 dblp:conf/mdm/BottcherGO07 fatcat:xf3uhk7aj5ealinraydrnbv5ee

Performance of Short-Commit in Extreme Database Environment [article]

Muhammad Tayyab Shahzad, Muhammad Rizwan
2011 arXiv   pre-print
Short-Commit protocol is developed with an objective to achieve low cost transaction commitment cost with non-blocking capability.  ...  Atomic commit protocols are used where data integrity is more important than data availability. Two-Phase commit (2PC) is a standard commit protocol for commercial database management systems.  ...  Optimistic commit protocol reduces blocking time period on the assumption that every transaction will commit eventually [17] .  ... 
arXiv:1105.5951v1 fatcat:ynugbsocizfm7dqbxb7upfu53m

A Systematic Study of Real time Distributed Systems in the Context of Distributed DBMS

2017 International Journal of Recent Trends in Engineering and Research  
A number of new criteria needs to be developed to involve timing constraints of real time applications in many database systems design issues, such as query processing or transaction, data buffering, CPU  ...  , and I/O scheduling.  ...  (I) Presumed Abort/Presumed Commit Protocol A variant of two phase commit(2PC) protocol, called Presumed Abort(PA), attempts to reduce 2PC overheads by requiring all cohorts to follow a "in the no information  ... 
doi:10.23883/ijrter.2017.3207.uidj0 fatcat:foj62sdmsfdt7b35nf3mosmkvi

An Automated Framework for Decomposing Memory Transactions to Exploit Partial Rollback

Aditya Dhoke, Roberto Palmieri, Binoy Ravindran
2015 2015 IEEE International Parallel and Distributed Processing Symposium  
The first is a static tool that analyzes application source code and produces a compact representation of transactions' business logic.  ...  In this paper, we present a framework that automatically decomposes programmer-written flat transactions into closed-nested transactions.  ...  ACKNOWLEDGMENTS This work is supported in part by US National Science Foundation under grants CNS-1217385 and CNS-1116190.  ... 
doi:10.1109/ipdps.2015.106 dblp:conf/ipps/DhokePR15 fatcat:4u3krxekerdoberjq6sgkehmie

Atomic Commitment Across Blockchains [article]

Victor Zakhary, Divyakant Agrawal, Amr El Abbadi
2019 arXiv   pre-print
In this paper, we present AC3WN, the first decentralized all-or-nothing atomic cross-chain commitment protocol.  ...  The recent adoption of blockchain technologies and open permissionless networks suggest the importance of peer-to-peer atomic cross-chain transaction protocols.  ...  This cost equals to the cost of deploying a coordination smart contract in the witness network plus the cost of a function call to the coordination smart contract to decide the commitment or the abortion  ... 
arXiv:1905.02847v2 fatcat:ehvpp6tmnzf4joxv4ro2cglbta

Reducing False Transactional Conflicts with Speculative Sub-Blocking State -- An Empirical Study for ASF Transactional Memory System

Lifeng Nai, Hsien-Hsin S. Lee
2013 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum  
By adding an extra speculative state for each cache line's sub-block, we can maintain conflict detection at the granularity of sub-blocks while keeping the original cache coherence protocol intact.  ...  It is found that false conflicts showed rather stable pattern within each cache line that subsequently inspired our false transactional conflict reduction technique using our proposed speculative sub-blocking  ...  When remote transactions commit, abort or hit the corresponding sub-blocks with dirty state, these dirty state bits will be cleared naturally.  ... 
doi:10.1109/ipdpsw.2013.113 dblp:conf/ipps/NaiL13 fatcat:nirgcxnkirew3dlpboeiji4w6q

Brief Announcement

Mohamed Mohamedin, Roberto Palmieri, Ahmed Hassan, Binoy Ravindran
2015 Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures - SPAA '15  
In this paper we present Part-HTM, the first hybrid transactional memory protocol that solves the problem of transactions aborted due to the resource limitations (space/time) of current best-effort HTM  ...  The basic idea of Part-HTM is to partition those transactions into multiple sub-transactions, which can likely be committed in hardware.  ...  Hereafter, we refer to the original (single block) transaction as a global transaction and the smaller sub-transactions as sub-HTM transactions.  ... 
doi:10.1145/2755573.2755611 dblp:conf/spaa/MohamedinPHR15 fatcat:o7lhgzqynnet7hmkc7ffbgp3j4

On the design of perturbation-resilient atomic commit protocols for mobile transactions

Brahim Ayari, Abdelmajid Khelil, Neeraj Suri
2011 ACM Transactions on Computer Systems  
On the other hand frequent node and link failures complicate the design of atomic commit protocols by increasing both the transaction abort rate and resource blocking time.  ...  Consolidating these sub-solutions, we develop a family of fault-tolerant atomic commit protocols that are tunable to meet the desired perturbation needs and provide minimized resource blocking times and  ...  On the Design of Perturbation-Resilient Atomic Commit Protocols • 33 Resource Blocking Time. Fig. 10 depicts the blocking time over the number of initiated transactions.  ... 
doi:10.1145/2003690.2003691 fatcat:frap5kgxzvaivm5ndhso6evjbm

Classification and Elimination of Conflicts in Hardware Transactional Memory Systems

Mridha-Mohammad Waliullah, Per Stenstrom
2011 2011 23rd International Symposium on Computer Architecture and High Performance Computing  
This paper analyzes the sources of performance losses in hardware transactional memory and investigates techniques to reduce the losses.  ...  These conflicts can cause performance and energy losses due to aborts and extra communication.  ...  ACKNOWLEDGEMENTS This research is partially sponsored by the SARC and the VELOX project funded by the EU. Most of the work is done when the first author was at Chalmers as a PhD student.  ... 
doi:10.1109/sbac-pad.2011.18 dblp:conf/sbac-pad/WaliullahS11 fatcat:rgdrgiqjszherjy7ebf6vgyhzy

Exploring Delay-Aware Transactions in Heterogeneous Mobile Environments

Brahim Ayari, Abdelmajid Khelil, Neeraj Suri
2009 Journal of Software  
Atomic commit distributed transactions is still a fundamental requirement protocols ensure strict atomicity of database transactions to achieve consistent decisions.  ...  Most existing atomic commit protocols show based on the assumption that node and link failures occur rarely.  ... 
doi:10.4304/jsw.4.7.634-643 fatcat:xzdhxt5csjblhma4r4uo6xoe2y

Resolving Executing-Committing Conflicts in Distributed Real-time Database Systems

K.-Y. Lam
1999 Computer journal  
In a distributed real-time database system (DRTDBS), a commit protocol is required to ensure transaction failure atomicity.  ...  the base protocol, which use priority inheritance and blocking to resolve the data conflicts.  ...  Note that our protocol can also be applied to other blocking-based commit protocols such as pre-assumed commit and pre-assumed abort [9] .  ... 
doi:10.1093/comjnl/42.8.674 fatcat:c3pelclaybavdclsr6txmnjpke

Delay-Aware Mobile Transactions [chapter]

Brahim Ayari, Abdelmajid Khelil, Neeraj Suri
2008 Lecture Notes in Computer Science  
In order to continue guaranteeing strict atomicity while providing for high efficiency (low resource blocking time and message overhead) and acceptable commit rate, transactional fault-tolerance techniques  ...  need to be revisited perhaps at the cost of transaction execution time.  ...  Atomic commit protocols ensure strict atomicity of database transactions and play therefore a major role for the design of these applications.  ... 
doi:10.1007/978-3-540-87785-1_25 fatcat:okkghau5xjec3evtv6jbunvxjq
« Previous Showing results 1 — 15 out of 1,482 results