Memory and Virtual Memory Management

This activity will enable you to apply what you learn during this course. In this assignment, you will have to identify different approaches to memory management.

The following questions will help you to grasp the different approaches to memory management.

Consider a system in which a program can be separated into two parts: code and data. The CPU knows whether it wants an instruction (instruction fetch) or data (data fetch or store). Therefore, two base-limit register pairs are provided: one for instructions and one for data. The instruction base-limit register pair is automatically read-only, so programs can be shared among different users. Discuss the advantages and disadvantages of this scheme.
Why the page sizes are always powers of 2?
Under what circumstances do the page faults occur? Describe the actions taken by the operating system when a page fault occurs.
Assume that you have a page-reference string for a process with m frames (initially all empty). The page-reference string has length p, and n distinct page numbers occur in it. Answer these questions for any page-replacement algorithms:
a. What is a lower bound on the number of page faults?
b. What is an upper bound on the number of page faults?

Be sure to explain how you reached your answers. You can refer the book Operating System Concepts to script your responses.

Use APA format but do not structure your responses as an essay. Just answer the questions.

Length: 1–2 pages not including title page and references.

Reference:

Silberschatz, A., Galvin, P. B., & Gagne, G. (2013). Operating systems concepts (9th ed.). Hoboken, NJ: Wiley. pp. 390, 449.