In the S/370 architecture, a storage key is a control field associated with each page-sized frame of real memory. Two bits of that key that are relevant for page replacement are the reference bit and the change bit. The reference bit is set to 1 when any address within the frame is accessed for read or write, and is set to 0 when a new page is loaded into the frame. The change bit is set to 1 when a write operation is performed on any location within the frame. Suggest an approach for determining which page frames are least-recently-used, making use of only the reference bit.
Answer to relevant QuestionsConsider the following sequence of page references (each element in the sequence represents a page number): Define the mean working set size after the kth reference as And define the missing page probability after the kth ...Briefly describe the three types of processor scheduling. Assume the following burst-time pattern for a process: 6, 4, 6, 4, 13, 13, 13, and assume that the initial guess is 10. Produce a plot similar to those of Figure. An interactive system using round-robin scheduling and swapping tries to give guaranteed response to trivial requests as follows: After completing a round-robin cycle among all ready processes, the system determines the time ...What items of information about a task might be useful in real-time scheduling?
Post your question