Models and performance of real-time disk access policies

  • Authors:
  • James C Yee;Pravin Varaiya

  • Affiliations:
  • Electrical Engineering and Computer Sciences Department, University of California at Berkeley, Berkeley, CA 94720, USA;Electrical Engineering and Computer Sciences Department, University of California at Berkeley, Berkeley, CA 94720, USA

  • Venue:
  • Computer Communications
  • Year:
  • 1995

Quantified Score

Hi-index 0.24

Visualization

Abstract

Multimedia systems may experience contention for resources under tight temporal constraints. The disk storage system is one such system. It may create a bottleneck due to its relatively limited throughput and large delay. Previous work on real-time disk scheduling is largely based on simulation or on combinatorial optimization results applicable to a limited class of scheduling policies. This paper presents new models for analysing access policies of a single disk system, and numerical and simulation results to illustrate and validate the anlysis. Our approach to synchronizing disk allocation uses fluid approximations and analytical techniques from manufacturing system scheduling problems and the theory of dynamical systems. The approach allows us to examine both the steady state and transient (in terms of stability and convergence rate) behaviour of the system under a variety of policies. Some results can also be extended to the study of disk array systems.