Notes - MIECT
Sistemas De Operação
Notes - MIECT
Sistemas De Operação
  • Sistemas de Operação
  • Processes in Unix/Linux
    • Process
    • Multiprocessing vs. Multiprogramming
    • Processes in Unix
    • Execution of a C/C++ program
  • Introduction to operating systems
    • Global view
    • Evolution of computational systems
    • Key topics
  • Semaphores and Shared memory
    • Concepts
    • Semaphores
    • Shared memory
    • Unix IPC primitives
  • Threads, mutexes and condition variables in Unix/Linux
    • Threads
      • In linux
    • Monitors
    • Unix IPC primitives
  • Processes
    • Process
      • Diagrams
    • Process control table
    • Context switching
    • Threads
  • Processor Scheduling
    • Processor Scheduler
    • Short-term processor scheduler
    • Scheduling algorithms
    • Scheduling criteria
    • Priorities
    • Scheduling policies
      • In Linux
  • Interprocess communication
    • Concepts
    • Philosopher dinner
    • Access primitives
      • Software solutions
      • Hardware solutions
    • Semaphores
    • Monitors
    • Message-passing
    • Unix IPC primitives
  • Deadlock
    • Introduction
    • Philosopher dinner - Solution 1
      • Deadlock prevention
    • Philosopher dinner - Solution 2
      • Deadlock prevention
    • Philosopher dinner - Solution 3
      • Deadlock prevention
    • Philosopher dinner - Solution 4
    • Deadlock avoidance
    • Deadlock detection
  • Memory management
    • Introduction
    • Address space
    • Contiguous memory allocation
    • Memory partitioning
    • Virtual memory system
    • Paging
    • Segmentation
    • Combining segmentation and paging
    • Page replacement
      • Policies
    • Working set
    • Thrashing
    • Demand paging vs. preparing
Powered by GitBook
On this page
  • Introduction
  • Memory management unit (MMU)
  • Logical address to physical address translation
  1. Memory management

Combining segmentation and paging

PreviousSegmentationNextPage replacement

Last updated 2 years ago

Introduction

Segmentation, taken alone, can have some drawbacks:

  • It may result in external fragmentation.

  • A growing segment can impose a change in its location.

Merging segmentation and paging can solve these issues.

  • First, the logical address space of a process is partitioned into segments.

  • Then, each segment is divided into pages.

However, this introduces a growing complexity.

Memory management unit (MMU)

Logical address to physical address translation

The MMU must contain 3 base registers and 1 limit register.

  • 1 base register for the segmentation table.

  • 1 limit register for the segmentation table.

  • 1 base register for the page table.

  • 1 base register for the memory frame.

Access to memory unfolds into 3 steps:

  • Access to the segmentation table.

  • Access to the page table.

  • Access to the physical address.

Entry of the segmentation table.

Entry of the page table.

The perm field is now associated with the segment.