Filters








9,938 Hits in 3.8 sec

Specifying Transaction Control to Serialize Concurrent Program Executions [chapter]

Egon Börger, Klaus-Dieter Schewe
2014 Lecture Notes in Computer Science  
We define a programming language independent transaction controller and an operator which when applied to concurrent programs with shared locations turns their behavior with respect to some abstract termination  ...  This makes TaCtl applicable to a wide range of programs and in particular provides the possibility to use it as a plug-in when specifying concurrent system components in terms of Abstract State Machines  ...  We thank Andrea Canciani and some of our referees for useful comments to improve the paper.  ... 
doi:10.1007/978-3-662-43652-3_13 fatcat:4xxpa35lvnarhglnlqjemt6r3m

Critical issues in multidatabase systems

Ahmed K. Elmagarmid, Marek Rusinkiewicz
1991 Information Sciences  
We identify the main issues related to supporting updAtes spanning across multiple autonomous database~and define an extended transaction model suitable for heterogeneous complltinK environments.  ...  <;e approach constitutes an attractive a1t.emative to a single, integrated data.ba.o;e.  ...  Other members of these projects have also contributed to the content and presentation of this paper.  ... 
doi:10.1016/0020-0255(91)90090-h fatcat:cpnvunzqsfclljfp325egs3a7m

Concurrent Transaction Frame Logic Formal Semantics for UML Activity and Class Diagrams

Franklin Ramalho, Jacques Robin, Ulrich Schiel
2004 Electronical Notes in Theoretical Computer Science  
the model as an executable, object-oriented logic program.  ...  We propose Concurrent Transaction Frame Logic (CTFL) as a language to provide formal semantics to UML activity and class diagrams.  ...  Concurrent Transaction Logic (CTL) Sequential Transaction Logic (STL) extends FOHL with two new transactional connectives: n-ary serial conjunction ⊗, and n-ary serial disjunction ⊕.  ... 
doi:10.1016/j.entcs.2004.04.007 fatcat:uun5aa6cynar7al4biudsjybtm

Using histories to implement atomic objects

Tony P. Ng
1989 ACM Transactions on Computer Systems  
_Serialized transactions" means that transactions appear to execute serially in a global serialization order, even though they may be overlapped in actual execution.  ...  Using these systems is relativelysimple: a programmer is only required to specify the boundaries of an atomic transaction. Concurrency control is performed transparently by the system.  ...  1 Introduction and Motivation lying concurrency control algorithm. An essential component of a concurrency control algorithm is its serialization protocol, which determines the serialization order.  ... 
doi:10.1145/75104.75106 fatcat:t2bjjk3reze2tdbgiaw2t6joie

On Analytical Performance Measurement of Concurrency Control Protocols in DBMS

Samir Kumar Ghosh, Md. Shohidul Islam, Md. Anisur Rahman
2009 International Journal of Computer and Electrical Engineering  
The objective of concurrency control is to ensure consistency when a shared database is updated by multiple concurrent transactions. It is also used to increase the database object utilization.  ...  In this paper some commonly used concurrency control protocols have been implemented through simulation.  ...  Here Table 1 and Table 2 are executed serially. When several Txns are executed concurrently, the corresponding schedule no longer needs to be serial.  ... 
doi:10.7763/ijcee.2009.v1.43 fatcat:4d22noza7vabffowewdb33zxai

Accessing extra-database information: Concurrency control and correctness

Narain Gehani, Krithi Ramamritham, Jayavel Shanmugasundaram, Oded Shmueli
1998 Information Systems  
We provide a formal treatment of concurrency control when transactions are allowed access to extra-data by discussing the inter-transaction dependencies that are induced when transactions access extra-data  ...  Traditional concurrency control theory views transactions in terms of read and write operations on database items.  ...  In this technique, a serialization graph is maintained in order to perform concurrency control.  ... 
doi:10.1016/s0306-4379(98)00022-2 fatcat:gx2qnsahdjcsrna3evduybh6cu

On-line consistent backup in transactional file systems

Lipika Deka, Gautam Barua
2010 Proceedings of the first ACM asia-pacific workshop on Workshop on systems - APSys '10  
We propose a scheme to take a consistent backup of an active file system assuming that the file system supports transactions.  ...  We intend to simulate the algorithms and run experiments to help tune the algorithms.  ...  transaction does not have to be aborted, and delaying a conflicting transaction in most cases resolves conflicts. An outline of an implementation has also been presented.  ... 
doi:10.1145/1851276.1851285 dblp:conf/sigcomm/DekaB10 fatcat:wz2tfw4fzvdx7nbpa5bvv7asr4

Pot

Tiago M. Vale, João A. Silva, Ricardo J. Dias, João M. Lourenço
2016 ACM Transactions on Architecture and Code Optimization (TACO)  
Pot uses a new concurrency control protocol that exploits the serialization order to distinguish between fast and speculative transaction execution modes in order to mitigate the overhead of imposing a  ...  This paper presents Pot, a system that leverages the concept of preordered transactions to achieve deterministic multithreaded execution of programs that use Transactional Memory.  ...  ACKNOWLEDGMENTS We are grateful to the anonymous reviewers for their helpful comments and suggestions, and to Koen De Bosschere for acting as a proxy for additional discussion with the reviewers.  ... 
doi:10.1145/3017993 fatcat:cv4b5vupofcijmvjx7bmykr4i4

Implicit parallelism with ordered transactions

Christoph von Praun, Luis Ceze, Calin Caşcaval
2007 Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '07  
The key idea is to specify opportunities for parallelization in a sequential program using annotations similar to transactions.  ...  We describe the programming model of IPOT and an online tool that recommends boundaries of ordered transactions by observing a sequential execution.  ...  Since we consider sequential programs in this section, the term 'transaction' refers to the execution principle and not to a mechanism for explicit concurrency control.  ... 
doi:10.1145/1229428.1229443 dblp:conf/ppopp/PraunCC07 fatcat:iycqb6uuvrfjfh4hq4asfsewim

Concurrent Transaction Frame Logic Formal Semantics for UML Activity and Class Diagrams

F RAMALHO
2004 Electronical Notes in Theoretical Computer Science  
capture temporal and concurrency constraints on updates and transactions.  ...  program.  ...  XMC verifies concurrent systems specified in a CCS-based modeling language with respect to desired temporal properties specified in the modal µ-calculus.  ... 
doi:10.1016/s1571-0661(04)05016-9 fatcat:e6lqe6jkqnhqdf76dl6dokcasq

AOP: Does It Make Sense? The Case of Concurrency and Failures [chapter]

Jörg Kienzle, Rachid Guerraoui
2002 Lecture Notes in Computer Science  
Except for simple academic examples, it is hard and even potentially dangerous to separate concurrency control and failure management from the actual application.  ...  ) concurrency and failures are particularly hard to aspectize because they are usually part of the phenomenon that objects should simulate.  ...  Acknowledgements We are very grateful to Andrew Black and Pierre Cointe for many fruitful discussions on AOP.  ... 
doi:10.1007/3-540-47993-7_2 fatcat:myqvekuvjjdhpdmduhajqmj5he

An efficient lock-aware transactional memory implementation

Justin E. Gottschlich, Jeremy G. Siek, Manish Vachharajani, Dwight Y. Winkler, Daniel A. Connors
2009 Proceedings of the 4th workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages and Programming Systems - ICOOOLPS '09  
Transactional memory (TM) is an emerging concurrency control mechanism that provides a simple and composable programming model.  ...  Unfortunately, transactions violate the semantics of mutual exclusion locks when they execute concurrently.  ...  Introduction Transactional memory (TM), as introduced by Herlihy and Moss, is an emerging concurrency control mechanism that provides a simple, efficient, and composable programming model [5, 7, 9, 10  ... 
doi:10.1145/1565824.1565826 dblp:conf/ecoop/GottschlichSVWC09 fatcat:56nufh72sra6bbviixn4gf5g4m

Chronological scheduling of transactions with temporal dependencies

Dimitrios Georgakopoulos, Marek Rusinkiewicz, Witold Litwin
1994 The VLDB journal  
transactions execute concurrently.  ...  The extant correctness criteria used to schedule the execution of concurrent transactions are either time independent or use strict, difficult to satisfy real-time constraints.  ...  A good estimate of di, is the time required to execute Ti in the absence of any concurrency control.  ... 
doi:10.1007/bf01231356 fatcat:424yig5shnhqxfbtvz2rw6d2lm

Consistency and orderability: semantics-based correctness criteria for databases

Divyakant Agrawal, Amr El Abbadi, Ambuj K. Singh
1993 ACM Transactions on Database Systems  
ACM Transactions on Database Systems, Vol. 1S, No, 3, September 1993.  ...  The database system ensures that the concurrent execution of a set of transactions is equivalent to a serial, and therefore correct, execution.  ...  In this model, entry and exit predicates specify the control flow among the primitive steps of a transaction.  ... 
doi:10.1145/155271.155276 fatcat:lhhihifepvdrpkcq4jzhbppxdi

Atomicity and isolation for transactional processes

Heiko Schuldt, Gustavo Alonso, Catriel Beeri, Hans-Jörg Schek
2002 ACM Transactions on Database Systems  
Regarding concurrency control, the flow of control of a process is more complex than in a flat transaction.  ...  Processes are increasingly being used to make complex application logic explicit.  ...  The concurrent execution of transactional processes is controlled by a transactional process manager (PM), which is responsible for scheduling the execution of the transaction programs.  ... 
doi:10.1145/507234.507236 fatcat:24b54w542zgobfpvgo5egbeukq
« Previous Showing results 1 — 15 out of 9,938 results