Background and Overview
Storage and processing time are the two major resources of computer systems; it is in these terms that the performance of computers is most often evaluated. In many applications the individual requirements for these resources are interdepen dent. For example, by re-designing algorithms it is frequently possible to increase computing speeds by making more storage available. By the same token, depending on the application, either resource may appear as the chief limitation, or bottleneck, to the “size” of the problem that can be solved. Since these limitations promise to continue in spite of technological advances, we have an obvious motivation for the study of efficient processor and storage allocation techniques and the analysis of their performance.
KeywordsMain Memory Idle Period Replacement Rule Item Size Finite Capacity
Unable to display preview. Download preview PDF.