Analysis of a replicated data base
Performance Evaluation
Locking performance in centralized databases
ACM Transactions on Database Systems (TODS)
A framework for the performance analysis of concurrent B-tree algorithms
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the modeling of parallel access to shared data
Communications of the ACM
Performance of Concurrency Control Algorithms with Nonexclusive Access
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
A data base replication analysis using an M/M/m queue with service interruptions
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Performance analysis of concurrent-read exclusive-write
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The performance of current B-tree algorithms
ACM Transactions on Database Systems (TODS)
Approximate Analysis of Reader/Writer Queues
IEEE Transactions on Software Engineering
A framework for the performance analysis of concurrent B-tree algorithms
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Characterizing the Performance of Algorithms for Lock-Free Objects
IEEE Transactions on Computers
Performance analysis of five interprocess communication mechanisms across UNIX operating systems
Journal of Systems and Software
Snapshots and software transactional memory
Science of Computer Programming - Special issue: Concurrency and synchronization in Java programs
| Hi-index | 0.00 |
In this paper we present a queue that has two classes of customers: readers and writers. Readers access the resource concurrently and writers access the resource serially. The queue discipline is FCFS: readers must wait until all writers that arrived earlier have completed service, and vice versa. The approximation can predict both the expected waiting times for readers and writers and the capacity of the queue. The queue can be used for the analysis of operating system and software resources that can be accessed both serially and concurrently, such as shared files. We have used the queue to analyze the performance of concurrent B-tree algorithms.