Petri-Net-Based Modeling and Evaluation of Pipelined Processing of Concurrent Database Queries
IEEE Transactions on Software Engineering
Parallelism and concurrency control performance in distributed database machines
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Concurrency Control in Distributed Databases Through Time Intervals and Short-Term Locks
IEEE Transactions on Software Engineering
An Optimistic Locking Technique for Concurrency Control in Distributed Databases
IEEE Transactions on Software Engineering
Conflict detection tradeoffs for replicated data
ACM Transactions on Database Systems (TODS)
On generation of state space for timed Petri nets
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
An approach towards distributed simulation of timed petri nets
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
GA optimization of Petri net-modeled concurrent service systems
Applied Soft Computing
Analyzing stability of algorithmic systems using algebraic constructs
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
| Hi-index | 0.00 |
Distributed database systems (DDBS) have received considerable attention in recent years. Being a relatively young research field, there are still many problems associated with DDB systems that need solution. Concurrency control is one of these problems and, probably, the most extensively studied. However, most of the work has concentrated on the development of alternative solutions and the field seems to be ready for some comparative analysis work. This paper reports the results of a performance evaluation study on distributed database concurrency control algorithms. The research has resulted in the development of a formalism, based on Petri nets, for modeling and analysis purposes. The formalism, called the Extended Place/Transition Nets (EPTN), is both descriptively powerful in that it can be used to model various algorithms precisely and succinctly and to communicate them in a clear manner, while at the same time lending itself to be used as a performance evaluation tool. An EPTN simulator is implemented and various algorithms are studied using this tool. This paper describes both the formalism and the performance results that have been obtained.