A Performance Model for Computer Data-Base Reorganization Performed Concurrently with Usage

Published Online:https://doi.org/10.1287/opre.26.5.789

Characteristics of data bases, reorganization, concurrent reorganization, and data-storage devices are described briefly. We present a two-priority queuing model for concurrent reorganization and usage and derive and solve equations for steady-state expectations of user response time and the time required to perform reorganization. Numerical results are obtained, and performance characteristics of such a system are predicted quantitatively. We discuss the effect of parameter values on performance and predict that for typical values of the model's parameters, system performance will be at an acceptable level.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.