Operating Systems Concepts Overview

Binary Semaphore: Has a value of either 0 or 1.
Counting Semaphore: Can have an integer value, useful for controlling access to a resource with multiple instances.

Improved responsiveness: Multiple threads can handle multiple tasks concurrently.
Efficient use of resources: Threads share the same memory space, reducing resource overhead.
Better utilization of multi-core processors: Threads can run on different cores, improving overall performance.
Simplified programming: Threads can be used to structure complex tasks.

System call: is a request from a process to a service provided by an operating system kernel.
Purpose: allows a running program to access and execute system-level functions.

Pre-emptive scheduling: A process can be interrupted by a higher-priority process.
- Advantages: prevents starvation; ensures fair usage for processes.
- Disadvantages: context switching overhead.
Non-preemptive scheduling: A process runs until it completes or yields the CPU voluntarily.
- Advantages: less overhead, simple to implement.
- Disadvantages: can lead to starvation; a long-running process can block other processes.

The process of initializing a computer system when it starts up.
The boot process loads the operating system's kernel into memory and starts the operating system.

Responsible for managing processes and allocating CPU time to them.
Selects a ready process from the process waiting queue and loads it onto the CPU for execution.

Process: A program in execution, an independent unit of activity.
Process states:
- New: A process that is being created.
- Ready: A process that is waiting to be run on the CPU.
- Running: A process that is currently executing on the CPU.
- Waiting: A process that is waiting for an event to occur, such as I/O completion.
- Terminated: A process that has finished execution.

A synchronization problem that arises when multiple processes compete for access to shared resources.
Solution: Peterson's Algorithm
- Algorithm: uses two flags (flag[0] and flag[1]) and a turn variable to ensure mutual exclusion.

Operating System: is a software that manages a computer's resources, acts as an intermediary between hardware and application programs.
Tasks:
- Resource management: Handles memory, CPU, I/O devices, and files allocation and allocation.
- User interface: Provides a way for users to interact with the computer.

Optimal page replacement algorithm selects the page that will not be used for the longest time in the future.
This algorithm eliminates all unnecessary page faults, but is not practical as it requires future knowledge of page references.

A memory management technique where processes are moved between main memory and secondary storage.
Involves moving a whole process or part of a process to improve efficiency.
Advantages:
- Increases the degree of multiprogramming.
- Reduces the need for large physical memory.
Disadvantages:
- Slows down execution due to the time needed to swap processes.
- Can be inefficient for processes that don't stay long enough to benefit from swapping.

User Interface: Provides a way for users to interact with the computer.
Resource management: Manages CPU, memory, I/O devices, and files.
Protection and security: Prevents unauthorized access to system resources and protects user data.
Process management: Creates, terminates, and manages processes.
Memory management: Allocates and manages memory between processes.
File management: Creates, deletes, and manages files.
Communication: Enables communication between processes and users.

MVT (Multiple Variable Tables):
- A dynamic memory allocation technique that allocates memory to processes based on their needs.
- Improves memory utilization but might leave large fragmented spaces.
MFT (Multiple Fixed Tables):
- A static memory allocation technique. Divides memory into fixed-size partitions in advance.
- Easier to implement but can lead to internal fragmentation.
- Suited to situations with fixed memory requirements.

Classifies processes into different queues based on their characteristics, such as priority or I/O needs.
Offers individual scheduling algorithms within each queue.
Promotes efficiency and fairness by handling different process requirements independently.

Counting Semaphore (S): initialized to 10.
Page operations: Six processes perform a P operation on S, decreasing the semaphore value by 1 each time.
V operations: Four processes perform a V operation, increasing the semaphore value by 1 each time.
Final value: The final value of S is 10 - 6 + 4 = 8.

Segment Table: Stores base addresses and lengths of segments.
Logical Address: A pair of (Segment, Offset) values representing the desired location within a segment.
Physical Address: Absolute memory address within the main memory.
Example:
- Logical Address: (0, 125)
  - Segment 0: Base = 600, Length = 120
  - Physical Address: 600 + 125 = 725
- Logical Address: (1, 310)
  - Segment 1: Base = 1200, Length = 350
  - Physical Address: 1200 + 310 = 1510
- Logical Address: (3, 88)
  - Segment 3: Base = 2700, Length = 90.
  - Physical Address: 2700 + 88 = 2788
- Logical Address: (2, 77)
  - Segment 2: Base = 750, Length = 85.
  - Physical Address: 750 + 77 = 827