Results 221 to 230 of about 2,858 (267)
Some of the next articles are maybe not open access.
Cautious transaction schedulers with admission control
ACM Transactions on Database Systems, 1985We propose a new class of schedulers, called cautious schedulers , that grant an input request if it will not necessitate any rollback in the future. In particular, we investigate cautious WRW-schedulers that output schedules in class WRW only.
Naoki Katoh +2 more
openaire +1 more source
Advanced Concurrency Control for Transactional Memory Using Transaction Commit Rate
2008Concurrency control for Transactional Memory (TM) is investigated as a means for improving resource usage by adjusting dynamically the number of concurrently executing transactions. The proposed control system takes as feedback the measured Transaction Commit Rate to adjust the concurrency.
Mohammad Ansari +5 more
openaire +2 more sources
From Transactional Distance to Transactional Control
2007This book offers an exploration of the ways that a learning trajectory is determined, and, in particular, how an online learning environment can affect that trajectory. It provides suggestions about how, primarily through technologies that underlie what is vulgarly known as “Web 2.0,” networked learning environments should be constructed to give ...
openaire +1 more source
Concurrency Control for Transactional Composite Services
2009 Congress on Services - I, 2009A composite service can be built from Web Services, and, its workflow can be specified using BPEL4WS. Many composite services are long-running transactional processes. This paper proposes a concurrency control scheme for executing transactional composite services.
Xinfeng Ye, Yi Chen
openaire +1 more source
Intangible Controlled Transactions
SSRN Electronic Journal, 2018This paper is about the controlled transactions in the case of intangibles. The intangibles have characteristics which are similar with than of tangibles. Through transfer pricing we have rights which granted from some companies to other, to achieve the appropriate profits and to minimize the losses. The transfer of intangibles allows the allocation of
openaire +1 more source
Unifying concurrency control and recovery of transactions
Information Systems, 1994Abstract Transaction management in shared databases is generally viewed as a combination of two problems, concurrency control and recovery, which have been considered as orthogonal problems. Consequently, the correctness criteria derived for these problems are incomparable.
Gustavo Alonso +6 more
openaire +1 more source
Hybrid Transactional Memory with Pessimistic Concurrency Control
International Journal of Parallel Programming, 2010Transactional Memory (TM) intends to simplify the design and implementation of the shared-memory data structures used in parallel software. Many Software TM systems are based on writer-locks to protect the data being modified. Such implementations can suffer from the “privatization” problem, in which transactional and non-transactional accesses to the ...
Enrique Vallejo 0001 +7 more
openaire +2 more sources
TRANSACTION PROCESSING IN DISTRIBUTED CONTROL SYSTEMS
IFAC Proceedings Volumes, 1979Abstract While the flexibility of a process control system may be enhanced by modular design, the effectiveness of the system often depends upon coordination of the modules’ actions. The conflict between designing clearly bounded modules and providing for coupling between them gives rise to important design tradeoffs in two major areas: the ...
openaire +1 more source
Commit scope control in nested transactions
1996A common limitation of all the existing nested transaction models is that they only allow subtransactions to commit either to parent transactions or to databases. In order to adequately balance atomicity and concurrency at selected levels of a transaction hierarchy, the notion of scoped commitment is proposed, that allows a subtransaction to commit to ...
Qiming Chen, Umeshwar Dayal
openaire +1 more source
Concurrency control for resilient nested transactions
Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS '83, 1983A formal framework is developed for proving correctness of algorithms which implement nested transactions. In particular, a simple "action tree" data structure is defined, which describes the ancestor relationships among executing transactions and also describes the views which different transactions have of the data.
openaire +1 more source