T. Kaneko Optimal Task Switching Policy for a Multilevel Storage System

Abstract: Capacity demands for computer memory are increasing. A multilevel storage system provides an economically feasible solution without seriously affecting the total response time. An M-level storage system is considered in this paper. The capability of a digital computer with a multilexel storage system is best enhanced in a multiprogramming environment. In a high level storage system, determination of a best task switching policy becomes an important consideration. In this paper a queuing network is introduced to de-scribe distribution and flow of tasks in the system. An optimal switching policy is determined in relation to the system’s overhead time. It is shown that in heavily CPU-limited cases the determination becomes a very simple one; namely, the best policy is given as the threshold level at which the accumulation of the average access time exceeds the overhead time. introduction The trend in the design of computer storage systems is toward multilevel storage hierarchies. The first level or cache has a small capacity but a very low access time, which can be realized with expensive technology. Storage devices at the lower levels are realized with slower and less expensive technology and have larger capacities. Our basic assumption, in this paper, is that with th