Coalescing and Compaction

Filter Course

OS Concepts

History of Operating Systems

Importance and Functions of OS

Types of Operating System

Operating System Structures

Operating System Services

Concepts of Multitasking, Multi-programming and Multiprocessing

Concepts of Uni-programming, Multi-programming, and Parallel Programming

Introduction to Process

Process states

Process Control Block

Threads

Process vs Thread

Scheduler and its types

Scheduling and its types

Process Scheduling Algorithms

Introduction to Inter Process Communication

Process Communication Mechanism

Process Deadlock

Causes (Conditions) of Deadlock

Deadlock detection and Recovery

Deadlock Prevention

Deadlock Ignorance or Ostrich Algorithm

Deadlock Avoidance or Banker's Algorithm

Issues related to deadlock

Concepts of Memory and Its Hierarchy

Memory Address

Concept of Swapping

Memory Allocation in OS

Coalescing and Compaction

Resident Monitor

Multi-programming with Fixed and Variable Partition

Paging

Segmentation

Paging VS Segmentation

Paging with Segmentation

Demand Paging

Virtual Memory Management

Page Replacement Algorithm

I/O Devices

I/O Techniques

Principles of I/O Hardware

Process Management Component of Linux Kernel | case study | 2016

Communication between the components of Linux Kernel | Case Study | 2016

Operating System || Fall 2022 || BCIS

Coalescing and Compaction

Published by: Zaya

Published date: 22 Jun 2021

Coalescing and Compaction Photo

Coalescing

The process of merging two adjacent holes to form a single larger hole is called coalescing.

coaleascing

Compaction

Even when holes coalesce, no individual hole may be large enough to hold the job, although the sum of holes is larger than the storage required for a process. It is possible to combine all the holes into one big one by moving all the processes downward as far as possible; this technique is called memory compaction.

compaction