Blocking analysis of transaction processing queues

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)∪...

Full description

Saved in:
Bibliographic Details
Published in:Performance evaluation 2001-11, Vol.46 (4), p.235-254
Main Authors: Sanli, Tugrul, Kulkarni, Vidyadhar G.
Format: Article
Language:English
Subjects:
Blocking probabilities
Insensitivity
Performance evaluation
Transaction processing queues
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0166-5316
1872-745X
DOI:10.1016/S0166-5316(01)00040-2