Name
Abstract | ||
|---|---|---|
A transaction processing queue manages a database which is partitioned into N items. Each arriving class- i customer requests to read and write a certain subset of the N items (called the shared and exclusive access sets R i and W i ). Classes i and j are said to conflict if ( W i ∩ W j )∪( W i ∩ R j )∪( R i ∩ W j )≠∅ . No two conflicting classes of customers can be processed simultaneously. All classes arrive according to independent Poisson processes and have general i.i.d. service times. In this paper, we discuss database systems without queuing. We show the insensitivity property of the system, and derive analytical expressions for performance measures such as blocking probabilities, throughput, etc. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0166-5316(01)00040-2 | Perform. Eval. |
Keywords | Field | DocType |
transaction processing queue,databases,blocking probabilities,performance evaluation,transaction processing queues,blocking analysis,insensitivity,poisson process,transaction processing,queue management,database system | Transaction processing,Expression (mathematics),Computer science,Queue,Real-time computing,Queueing theory,Throughput,Poisson distribution,Distributed computing | Journal |
Volume | Issue | ISSN |
46 | 4 | Performance Evaluation |
Citations | PageRank | References |
1 | 0.38 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tugrul Sanli | 1 | 1 | 0.72 |
| Vidyadhar G. Kulkarni | 2 | 539 | 60.15 |