Abstract
Given a particular computer system the extension problem concerns the prediction of performance when the size of main memory is increased. In this paper a specific approach to this problem is formulated for demand paging systems. A necessary and sufficient condition on the nature of page replacement rules which leads to solutions of the extension problem is a major result of the paper. As the other principal result we show that the class of replacement rules so defined is precisely that class of rules having the wellknown inclusion property. The paper concludes with a general discussion of topics related to the extension problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
