A Memory Management technique in which memory is divided into variable sized chunks which can be allocated to processes. Each chunk is called a Segment.
- Base Address: It contains the starting physical address where the segments reside in memory.
- Limit: It specifies the length of the segment.
- Segment number (s): Number of bits required to represent the segment.
- Segment offset (d): Number of bits required to represent the size of the segment.
- No Internal fragmentation.
- Segment Table consumes less space in comparison to Page table in paging.
- As processes are loaded and removed from the memory, the free memory space is broken into little pieces, causing External fragmentation.
This article has been contributed by Vikash Kumar.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
- Operating System | Page Replacement Algorithms
- Operating System | Paging
- Static and Dynamic Libraries | Set 1
- Virtual Memory | Operating System
- Last Minute Notes – Operating Systems
- Types of computer memory (RAM and ROM)
- Operating System | File Directory | Path Name
- Different Types of RAM (Random Access Memory )
- Operating System | Types of Operating Systems
- Operating System | Microkernel