Queueing models of secondary storage devices

Queueing theory has occupied an important role in the analysis of computer storage structures and algorithms. In this survey we focus on secondary or auxiliary storage devices, which often comprise the principal bottleneck in the overall performance of computer systems. We begin with descriptions of the more important devices, such as disks and drums, and a general discussion of related queueing models. Server motion and dependent successive services are salient features of these models. Widely used, generic results are presented and then applied to specific devices. The paper concludes with a discussion of open problems.