ACM Transactions on Computer Systems (TOCS)
Limitations of concurrency in transaction processing
ACM Transactions on Database Systems (TODS)
Locking performance in centralized databases
ACM Transactions on Database Systems (TODS)
Integrated concurrency control and recovery mechanisms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
A measure of transaction processing power
Datamation
Exact performance estimates for multiprocessor memory and bus interference
IEEE Transactions on Computers
Modeling the software architecture of a prototype parallel machine
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
Process and dataflow control in distributed data-intensive systems
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A Queueing Network Model for a Distributed Database Testbed System
IEEE Transactions on Software Engineering
Modelling of centralized concurrency control in a multi-system environment
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
CSIM: a C-based process-oriented simulation language
WSC '86 Proceedings of the 18th conference on Winter simulation
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
Effects of locking granularity in a database management system
ACM Transactions on Database Systems (TODS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Advanced Database Machine Architecture
Advanced Database Machine Architecture
Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
Prototyping Bubba, A Highly Parallel Database System
IEEE Transactions on Knowledge and Data Engineering
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
IEEE Transactions on Knowledge and Data Engineering
Performance Modeling of Distributed and Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Distributed Concurrency Control Based on Limited Wait-Depth
IEEE Transactions on Parallel and Distributed Systems
Performance Studies of Shared-Nothing Parallel Transaction Processing Systems
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Performance Analysis of Concurrency Control Methods
Performance Evaluation: Origins and Directions
Performance modelling of database contention using queueing petri nets
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
| Hi-index | 0.00 |
A quantitative performance study of two-phase locking in a parallel database machine using a simulation-based methodology is described. The DBSIM simulation methodology uses models at two levels: a Petri net model at the higher level and a queuing network model at the lower level. The Petri net model captures the characteristics of parallelism and synchronization at the workload level, while the queuing network model captures queuing aspects of the system at the physical resource level. Transactions in a workload are specified using a performance-oriented specification language based on the transaction component graph, a data flow graph with database operators. The transaction specifications are translated into Petri net representations to derive the simulation experiments. The workload is a transaction taken from an order-entry application. A shared-nothing parallel machine architecture is assumed. Results of analysis of a two-phase locking strategy with machine sizes ranging from 4 to 256 processors are presented.