Questions from Operating Systems

Q: Assuming a page size of 4 kB and that a page table

Assuming a page size of 4 kB and that a page table entry takes 4 bytes, how many levels of page tables would be required to map a 64-bit address space, if the top-level page table fits into a single p...

Q: What is multithreading?

What is multithreading?

Q: Consider a system with memory mapping done on a page basis and

Consider a system with memory mapping done on a page basis and using a single-level page table. Assume the necessary page table is always in memory. a. If a memory reference takes 200 ns, how long do...

Q: Consider a page reference string for a process with a working set

Consider a page reference string for a process with a working set of M frames, initially all empty. The page reference string is of length P with N distinct page numbers in it. For any page replacemen...

Q: In discussing a page replacement algorithm, one author makes an analogy

In discussing a page replacement algorithm, one author makes an analogy with a snowplow moving around a circular track. Snow is falling uniformly on the track, and a lone snowplow continually circles...

Q: In the S/370 architecture, a storage key is a

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...

Q: Consider the following sequence of page references (each element in the

Consider the following sequence of page references (each element in the sequence represents a page number): 1 2 3 4 5 2 1 3 3 2 3 4 5 4 5 1 1 3 2 5 Define the mean working set size after the kth refer...

Q: A key to the performance of the VSWS resident set management policy

A key to the performance of the VSWS resident set management policy is the value of Q. Experience has shown that with a fixed value of Q for a process, there are considerable differences in page fault...

Q: Consider the following program. / Assume the program

Consider the following program. Assume the program is running on a system using demand paging, and the page size is 1 kB. Each integer is 4 bytes long. It is clear that each array requires a 16-page...

Q: a. How much memory space is needed for the user page

a. How much memory space is needed for the user page table of Figure 8.3 ? b. Assume you want to implement a hashed inverted page table for the same addressing scheme as depicted in Figure 8.3 , using...