Đang chuẩn bị liên kết để tải về tài liệu:
Bài giảng Hệ điều hành nâng cao (Operating System-OS): Chương 2 - Phan Vĩnh Thuần2

Chương 2 - Operating system structures. Bài giảng gồm có những nội dung chính sau: Processes, threads, interprocess communication, classical IPC problems, scheduling. Invite you to refer. | Chapter 2. Memory Management The main purpose of a computer system is to execute programs. These programs, together with the data they access, must be in main memory (at least partially) during execution. Many memory-management schemes exist, reflecting various approaches, and the effectiveness of each algorithm depends on the situation. Selection of a memory-management scheme for a system depends on many factors, especially on the hardware design of the system. OBJECTIVES To provide a detailed description of various ways of organizing memory hardware. To discuss various memory-management techniques, including paging and segmentation. Main Memory 1.1.Background 1.1.1. Basic hardware Main memory and the registers built into the processor itself are the only storage that the CPU can access directly. There are machine instructions that take memory addresses as arguments, but none that take disk addresses. Registers that are built into the CPU are generally accessible within one cycle of the CPU clock. Most CPUs can decode instructions and perform simple operations on register contents at the rate of one or more operations per clock tick. Memory access may take many cycles of the CPU clock to complete, in which case the processor normally needs to stall, since it does not have the data required to complete the instruction that it is executing. The remedy is to add fast memory between the CPU and main memory-A memory buffer used to accommodate a speed differential, called a cache Each process has a separate memory space and to ensure that the process can access only these legal addresses. This protection by using two registers, usually a base and a limit Figure 2.1. A base and a limit register define a logical address space. 1.1.2. Address Binding Addresses in the source program are generally symbolic (such as count). A compiler will typically bind these symbolic addresses to relocatable addresses (such as “14 bytes from the beginning of this module''). The linkage . | Chapter 2. Memory Management The main purpose of a computer system is to execute programs. These programs, together with the data they access, must be in main memory (at least partially) during execution. Many memory-management schemes exist, reflecting various approaches, and the effectiveness of each algorithm depends on the situation. Selection of a memory-management scheme for a system depends on many factors, especially on the hardware design of the system. OBJECTIVES To provide a detailed description of various ways of organizing memory hardware. To discuss various memory-management techniques, including paging and segmentation. Main Memory 1.1.Background 1.1.1. Basic hardware Main memory and the registers built into the processor itself are the only storage that the CPU can access directly. There are machine instructions that take memory addresses as arguments, but none that take disk addresses. Registers that are built into the CPU are generally accessible within one cycle of