© 1991 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
A Model for the Stability Analysis of Maintenance Strategies for Linear List

1 Department of Computer Science, University of Houston, Houston, TX 77004, USA, 2 Department of Computer & Information Science, University of Mississippi, Weir Hall 302, MS 38677, USA, 3 Digital Equipment Corporation, CXN16, Colorado Springs, CO 80920, USA
In this paper, we present a fluid approximation model to analyse the stability of two frequeently used data structure maintenance strategies in client-server distributed environments, namely, concurrent and periodic maintenance strategies. We give a detailed analysis for a linear list data structure and derive the maximum allowable value of the input arrival rate under which a stable system can be obtained when these maintenance strategies are used. Conditions under which one strategy may be more preferable than the other in terms of the system throughput and the variance of the service time distribution are identified. The stability behaviour of these two maintenance strategies under high traffic situation is also investigated.
Received August 1989. revised February 1990.
* Department of Computer Science, University of Houston, Houston, TX 77004, USA
Department of Computer & Information Science, University of Mississippi, Weir Hall 302, MS 38677, USA
¶ Digital Equipment Corporation, CXN16, Colorado Springs, CO 80920, USA
To whom correspondence should be addressed.