Chapter 8: Memory Management Essay

1448 Words 6 Pages
In the previous chapter, we discussed deadlocks, resource allocation graphs, and strategies for handling deadlocks. Deadlock is a situation where some processes wait for each other's actions indefinitely, which happens in process synchronization. Operating systems use resource allocation policies to prevent and avoid deadlocks. In this chapter, we’ll discuss the various memory management techniques such as main memory, swapping, memory allocation, paging, and segmentation.
(1)Objectives
In this chapter, the student will:
1. Explain what memory management is and why it is important.
2. Be able to identify different memory management schemes and the processes they use to manage memory.
(1)Basic Concepts
Operating systems manage the
…show more content…
The solution to this issue is to move the information in random access memory (RAM) to hard disk, which is called virtual memory management.
The types of memory in a computer system are: high speed cache, main memory (also known as physical memory), and secondary memory. High speed cache is relatively small amounts of memory that is available to the central processing unit (CPU) through the fastest connections. Cache controllers predict which pieces of data the CPU will need next and move it from main memory into high-speed cache in order to speed up system performance. Main memory is RAM and is measured in megabytes (MB). Secondary memory is where programs and data are kept on a long-term basis. A common secondary memory device is the hard disk. Secondary storage is only one of the memory types that must be managed by the operating system; it is also the slowest.
(2)Address Binding
In order for a program to execute, it must be moved into main memory at a particular location and placed inside a process. This process moves between disk and memory during execution. The input queue is used to place the processes that are ready to be moved into the memory. The instructions that use addresses in a program must have address space in the main memory. Many instructions use fixed addresses that must be bound to fixed locations in the memory. With this in mind, address binding can be thought of as a mapping from one address space to another.

Related Documents