segmentation

segmentation - Operating Systems Simple/Basic Segmentation...

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

View Full Document Right Arrow Icon
Operating Systems Simple/Basic Segmentation
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Real Memory Management Background Memory Management Requirements Fixed/Static Partitioning Variable/Dynamic Partitioning Simple/Basic Paging Simple/Basic Segmentation Segmentation with Paging
Background image of page 2
3 Simple/Basic Segmentation Paging division is arbitrary; No natural/logical boundaries for protection/sharing. Segmentation supports user’s view of a program. A user’s program is a collection of segments - logical units - such as: main program, subprogram, class procedure, function, object, method, local variables, global variables, common block, stack, symbol table, arrays
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 Some basics Because segments are based on logical, rather than physical, divisions, they have no fixed size , although there is usually an upper limit imposed by the hardware. Segmentation has no internal fragmentation , but there can be external fragmentation. Since a program can be segmented into smaller parts, which don’t have to be contiguous, the fragmentation is generally less than in a system where the entire address space is stored contiguously. Since segmentation is based on logical structure , the programmer may be responsible for organizing the program into segments.
Background image of page 4
5 User’s View of a Program
Background image of page 5

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

View Full DocumentRight Arrow Icon
6 ?Without segmentation Without segmentation (equivalently said with just one segment) all procedures are packed together so if one changes in size all the virtual addresses following are changed and the program must be re-linked.
Background image of page 6
7 (Dynamics of Simple Segmentation (1 Each program is subdivided into blocks of non- equal size called segments. When a process gets loaded into main memory, its different segments can be located anywhere. Each segment is fully packed with instructions/ data; no internal fragmentation. There is external fragmentation; it is reduced when using small segments.
Background image of page 7

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

View Full DocumentRight Arrow Icon
8 Logical view of simple segmentation 1 3 2 4 1 4 2 3 user space physical memory space
Background image of page 8
9 (Dynamics of Simple Segmentation (2 In contrast with paging, segmentation is visible to the programmer: provided as a convenience to organize logically programs (example: data in one segment, code in another segment). must be aware of segment size limit.
Background image of page 9

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

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

This note was uploaded on 07/15/2011 for the course ECO 2023 taught by Professor Mr.raza during the Summer '10 term at FAU.

Page1 / 33

segmentation - Operating Systems Simple/Basic Segmentation...

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

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