Algorithms for on-the-fly garbage collection
ACM Transactions on Programming Languages and Systems (TOPLAS)
Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
Data structures using Pascal
Dynamic storage fragmentation and file deterioration
IEEE Transactions on Software Engineering
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
IEEE Transactions on Software Engineering
Optimum checkpoints with age dependent failures
Acta Informatica
A model for the stability analysis of maintenance strategies for linear list
The Computer Journal - Special issue on term rewriting
On the Optimum Checkpoint Interval
Journal of the ACM (JACM)
A hierarchial, combinatorial-Markov model of solving complex reliability models
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
On the modeling of parallel access to shared data
Communications of the ACM
Performance analysis of on-the-fly garbage collection
Communications of the ACM
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
Optimal reorganization of distributed space disk files
Communications of the ACM
Multilevel Data Structures: Models and Performance
IEEE Transactions on Software Engineering
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Online reorganization of databases
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
We present a state reduction method that effectively reduces a two-dimensional Markov model to a one-dimensional Markov model for the performance analysis of a class of concurrent data structure maintenance policies. The reduced model allows the derivation of a closed form expression for the average service time per operation and facilitates the identification of priority allocation functions under which: the system is stable; and the service time per operation is minimized. The applicability of the model is exemplified with a binary tree data structure and the conditions under which concurrent maintenance strategies are better than a conventional incremental maintenance strategy are determined.