Filters








12,216 Hits in 3.8 sec

An open and safe nested transaction model: concurrency and recovery

Sanjay Kumar Madria, S.N. Maheshwari, B. Chandra, Bharat Bhargava
2000 Journal of Systems and Software  
The systems restart and buer management operations are also modeled as nested transactions to exploit possible concurrency during restart.  ...  It incorporates a prewrite operation before each write operation to increase the potential concurrency.  ...  To increase concurrency during undo logging recovery, scheme allows some non-strict executions.  ... 
doi:10.1016/s0164-1212(00)00067-4 fatcat:dp56b6o4kvablk6tztklcbjose

Semantic multigranularity locking and its performance in object-oriented database systems

Kyoung-In Kwon, Songchun Moon
1998 Journal of systems architecture  
Concurrency control schemes for object-oriented database systems (OODBSs) used in the area of performance-critical applications should increase the degree of concurrency and decrease locking overhead in  ...  However, most commercially available OODBSs use conventional concurrency control schemes that never exploit the rich semantics of object-oriented data model, thus fail to offer better performance.  ...  Acknowledgements The authors wish to acknowledge the anonymous referees for their helpful comments.  ... 
doi:10.1016/s1383-7621(97)00069-6 fatcat:craquqibezg25myeyln65iwfi4

Reusable Concurrent Data Types [chapter]

Vincent Gramoli, Rachid Guerraoui
2014 Lecture Notes in Computer Science  
With PT, annotating sequential ADTs guarantee novice programmers to obtain an atomic and deadlock-free CDT and let an advanced programmer leverage the application semantics to get higher performance.  ...  This paper contributes to address the fundamental challenge of building Concurrent Data Types (CDT) that are reusable and scalable at the same time.  ...  NICTA is funded by the Australian Government through the Department of Communications and the Australian Research Council through the ICT Centre of Excellence Program.  ... 
doi:10.1007/978-3-662-44202-9_8 fatcat:tvorlee2bvasbbqjpnvnpkl3wm

Development of object-oriented database management system: OOIM

Kyuho Kim, Kyoungin Kwon, Songchun Moon
1994 Microprocessing and Microprogramming  
For concurrency control, the principles of modeling method hierarchy as a nested transaction, exploiting semantics of methods, and dynamic determination of conflicts resulting from referential sharing  ...  This paper describes two focal issues: visual query optimization and concurrency control in designing OOIM, which is an object-oriented database management system being developed at KAIST.  ...  CONCURRENCY CONTROL: ENHANCED SEMANTIC LOCKING To enhance the degree of concurrency with enforcing serializable execution of transactions, a semantic concurrency control mechanism is essential.  ... 
doi:10.1016/0165-6074(94)90028-0 fatcat:kynua4kkq5d6zfhcmkax7bycf4

Comparisons and Analysis of Object Locking , Field Locking and Commutativity Locking in Industrial Platform Environment

Dr. Jayeshkumar Madhubhai Patel
2019 Figshare  
We found that, in this application, semantic locking performs equally to, but no better than,object locking in reasonable mixes of real- world transactions, and that it only outperforms in a deliberately  ...  We compare object-based locking and commutativity- based semantic locking.  ...  For O2, an object-oriented database [9], the idea to exploit method commutativity is in Cart and Ferrie [5].  ... 
doi:10.6084/m9.figshare.7830650.v1 fatcat:lfebg42npvff3hpbklxqgjwalq

Consistency guarantees

Paul Dourish
1996 Proceedings of the 1996 ACM conference on Computer supported cooperative work - CSCW '96  
The reader is referred to [Dourish, 1995a] and [Dourish, 1995b] for more information and background on the techniques used.  ...  The underlying assumption is that toolkit components can be designed and implemented independently of the details of particular applications.  ...  Acknowledgments Dik Bentley, Jon Crowcroft, John Lamping, Ellen Siegel and Doug Terry made valuable contributions to the development of these ideas and their presentation here.  ... 
doi:10.1145/240080.240300 dblp:conf/cscw/Dourish96 fatcat:caloymzvavdnhb7dgmn6cegjsq

Semantics-based concurrency control: beyond commutativity

B. R. Badrinath, Krithi Ramamritham
1992 ACM Transactions on Database Systems  
and KRITHI RAMAMRITHAM University of Massachusetts the lower the resource contention, the higher the improvement.  ...  Object specifications contain semantic information that can be exploited to increase concurrency.  ...  Semantics-Based Concurrency Control . 167 Each object has a type, which defines a possible set of states of the object, and a set of primitive operations that provide the only means to create  ... 
doi:10.1145/128765.128771 fatcat:h5s3ubda2zhqzbsk4nk563xbra

Semantics-based concurrency control: Beyond commutativity

B. R. Badrinath, Krithi Ramamritham
1987 1987 IEEE Third International Conference on Data Engineering  
and KRITHI RAMAMRITHAM University of Massachusetts the lower the resource contention, the higher the improvement.  ...  Object specifications contain semantic information that can be exploited to increase concurrency.  ...  Semantics-Based Concurrency Control . 167 Each object has a type, which defines a possible set of states of the object, and a set of primitive operations that provide the only means to create  ... 
doi:10.1109/icde.1987.7272395 dblp:conf/icde/BadrinathR87 fatcat:q5r2n4cqhrep3ocq2yplph4q2i

Pre-serialization of long running transactions to improve concurrency in mobile environments

Angelo Chianese, A. d'Acierno, V. Moscato, A. Picariello
2008 2008 IEEE 24th International Conference on Data Engineering Workshop  
exploited in order to increase the concurrency reconcilable operations on the same resources.  ...  In this paper we propose a novel method in order to improve concurrency of particular kind of transaction, known as long running transactions.  ...  [15] provide a flexible concurrency control mechanisms for nested transactions that exploits semantics of transaction operations.  ... 
doi:10.1109/icdew.2008.4498304 dblp:conf/icde/ChianesedMP08 fatcat:tynzdbc3hfcn3efk3o467vv66u

Transactions

Alfred Z. Spector, Peter M. Schwarz
1983 ACM SIGOPS Operating Systems Review  
To exploit transactions in a general purpose distributed system, each node can execute a transaction kernel that provides services necessary to support transactions at higher system levels.  ...  Communication efficiency can be increased by simplifying protocols, reducing cross-level context switching, and increasing hardware support for the communication system.  ...  Acknowledgments We gratefully acknowledge the contributions of Dean Daniels and Cynthia Hibbard, who helped us organize and present the ideas in this paper.  ... 
doi:10.1145/1041478.1041481 fatcat:p5movi7acnc25g3q6f7pzcaho4

Application-Aware Byzantine Fault Tolerance

Wenbing Zhao
2014 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing  
One way of increasing the practicality of Byzantine fault tolerance is to exploit the application semantics, which we refer to as application-aware Byzantine fault tolerance.  ...  Application-aware Byzantine fault tolerance makes it possible to facilitate concurrent processing of requests, to minimize the use of Byzantine agreement, and to identify and control replica nondeterminism  ...  , that it is essential to exploit the application semantics.  ... 
doi:10.1109/dasc.2014.17 dblp:conf/dasc/Zhao14 fatcat:vf6qbzcmijgwba7dc5dvqqja2q

Application-Aware Byzantine Fault Tolerance [chapter]

2014 Building Dependable Distributed Systems  
One way of increasing the practicality of Byzantine fault tolerance is to exploit the application semantics, which we refer to as application-aware Byzantine fault tolerance.  ...  Application-aware Byzantine fault tolerance makes it possible to facilitate concurrent processing of requests, to minimize the use of Byzantine agreement, and to identify and control replica nondeterminism  ...  , that it is essential to exploit the application semantics.  ... 
doi:10.1002/9781118912744.ch8 fatcat:gr27j7cw3zghtispqqotzbfg4u

Concurrent Byzantine Fault Tolerance for Software-Transaction-Memory Based Applications

Honglei Zhang
2012 International Journal of Future Computer and Communication  
The approach is based on the idea of committing concurrent transactions according to the total order of the requests that triggered the transactions.  ...  In this paper, we present the design and implementation of a Byzantine fault tolerance framework for software-transactional-memory based applications that aims to maximize concurrent processing while preserving  ...  ACKNOWLEDGMENTS This work was supported in part by NSF grant CNS 0821319, by a CSUSI grant, and by a Doctoral Dissertation Research Expense Award (for the first author) from Cleveland State University.  ... 
doi:10.7763/ijfcc.2012.v1.14 fatcat:y6o3p2xuyfdx5j34expptclwgm

Transactions on Mergeable Objects [chapter]

Deepthi Devaki Akkoorath, Annette Bieniusa
2015 Lecture Notes in Computer Science  
Instead of aborting and re-executing, object versions from conflicting updates on shared objects are merged using data-type specific semantics.  ...  Paradigms such as Transactional Memory support the programmer in correctly synchronizing access to mutable shared data by serializing the transactional reads and writes.  ...  Semantic Mergeability: Exploiting object semantics to define the merge function has been successfully applied in Conflict-free Replicated Data Types (CRDTs) [23] in the context of distributed database  ... 
doi:10.1007/978-3-319-26529-2_23 fatcat:x5d62pshifhefhqwlcemjjk37u

Lazy State Determination: More concurrency for contending linearizable transactions [article]

Tiago M. Vale, João Leitão, Nuno Preguiça, Rodrigo Rodrigues, Ricardo J. Dias, João M. Lourenço
2020 arXiv   pre-print
To this end, we introduce the lazy state determination API to easily expose the semantics of application transactions to the database, and propose new optimistic and pessimistic concurrency control algorithms  ...  We show that by leveraging semantic information associated with the transactional programs to increase concurrency, it is possible to significantly improve performance while maintaining linearizability  ...  By allowing transactions to execute their logic over an abstract state and specifying their intent more clearly to the database, the concurrency control protocol can make more informed.  ... 
arXiv:2007.09733v1 fatcat:zvfniayo3zefraxo7gnpv34aie
« Previous Showing results 1 — 15 out of 12,216 results