lecture14

lecture14 - Segmentation (and Paged Segmentation)...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Segmentation (and Paged Segmentation) Segmentation Programs generally divide up their memory usage by function. Some memory holds instructions, some static data, some dynamically-llocated data, some execution frames. All of these memory types have different protection, growth, and sharing requirements. In the monolithic memory allocation of classic VM systems, this model isn’twell supported. A stack heap Segmentation addresses this by providing multiple sharable, protectable, growable address spaces that processes can access. code bss data stack heap (dynamic memory) In a pure segmentation architecture, segments are allocated likevariable partitions, although the memory management hardware is involved in decoding addresses. Pure segmentation addresses replace the page identifier in the virtual address with a segment identifier ,and find the proper segment (not page) to which to apply the offset.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/28/2008 for the course CS 402 taught by Professor Tedfaber during the Spring '05 term at USC.

Page1 / 2

lecture14 - Segmentation (and Paged Segmentation)...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online