Scribd
Upload
45 views10 pages

Scheduling and Memory Management

The document discusses memory management, defining it as the process of managing computer memory, including allocation and protection. It covers types of memory such as physical, virtual, primary, secondary, and cache memory, along with memory allocation techniques like contiguous and non-contiguous allocation. Additionally, it explains concepts like paging, fragmentation, segmentation, and memory protection, providing real-world examples from operating systems like Windows, Linux, and macOS.

Uploaded by

balamuruganp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
45 views10 pages

Scheduling and Memory Management

The document discusses memory management, defining it as the process of managing computer memory, including allocation and protection. It covers types of memory such as physical, virtual, primary, secondary, and cache memory, along with memory allocation techniques like contiguous and non-contiguous allocation. Additionally, it explains concepts like paging, fragmentation, segmentation, and memory protection, providing real-world examples from operating systems like Windows, Linux, and macOS.

Uploaded by

balamuruganp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Scheduling and

memory management
BY:-
V.SRINADH
P.SANDEEP
Introduction to Memory
Management
• Definition: Memory management is the process of managing computer
memory, including allocation, deallocation, and protection.
• Why it's Important:
• Efficient memory usage improves system performance.
• Prevents crashes and memory leaks.
Types of Memory:-
• Physical Memory (RAM): Temporary storage for active data and
instructions.
• Virtual Memory: Allows programs to use more memory than
physically available by swapping data between RAM and disk.
• Primary vs. Secondary Memory:
• Primary: RAM (volatile)
• Secondary: Storage (non-volatile, e.g., HDD/SSD)
• Cache Memory: Fast memory used to store frequently accessed data.
Memory Allocation Techniques:-
• Contiguous Allocation: Memory is allocated in a single, continuous
block.
• Pro: Simple and efficient.
• Con: Leads to fragmentation.
• Non-contiguous Allocation: Memory is allocated in smaller, fixed-
sized blocks (paging/segmentation).
• Pro: No fragmentation.
• Con: More complex management.
Paging Concept:-
• What is Paging?: Divides memory into fixed-size pages.
• How It Works: Logical addresses are divided into page numbers and
offsets. The page number is mapped to a frame number in physical
memory using a page table.
• Page Fault: When a page is not in memory, it must be loaded from disk.
Fragmentation:-
• External Fragmentation: Free memory is scattered, making it difficult
to allocate large contiguous blocks.
• Internal Fragmentation: Wasted memory within allocated blocks
(common in paging).
• How Paging Reduces Fragmentation: Paging avoids external
fragmentation by using fixed-size blocks.
Segmentation:-

• What is Segmentation?: Divides memory into logical segments, such


as code, data, and stack.
• Segmentation vs. Paging:
• Segmentation: Variable-sized blocks.
• Paging: Fixed-sized blocks.
Memory Protection:-
•What is Memory Protection?: Mechanism to prevent one process from accessing another process's
memory.
•How It Works:
•Access Control: Set permissions for read, write, and execute on memory regions.
•Hardware Support: CPUs enforce memory protection using Memory Management Units (MMUs).
Real-World Examples:-
• Windows:
• Uses virtual memory and paging.
• Page file is used for swapping data.
• Linux:
• Supports swap space and multi-level page tables.
• macOS:
• Implements unified memory architecture combining RAM and GPU
memory.
Thank you…..

You might also like