Scribd
Upload
2 views5 pages

Os Architecture

The document provides a comprehensive overview of Operating Systems (OS), covering definitions, architectures, functions, booting processes, types, and process management. It explains key concepts such as multiprogramming, multitasking, multithreading, and various CPU scheduling algorithms. Additionally, it details process states and transitions, emphasizing the importance of threads in efficient CPU execution.

Uploaded by

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

Os Architecture

The document provides a comprehensive overview of Operating Systems (OS), covering definitions, architectures, functions, booting processes, types, and process management. It explains key concepts such as multiprogramming, multitasking, multithreading, and various CPU scheduling algorithms. Additionally, it details process states and transitions, emphasizing the importance of threads in efficient CPU execution.

Uploaded by

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

Sure!

Here's a more detailed explanation of the topics you mentioned for your Operating System
with Linux internal exam. I've kept it clear and exam-friendly:

🔷 1. What is an Operating System (OS)?


An Operating System (OS) is a system software that manages hardware resources and provides
an interface for users to interact with the computer.
It controls and coordinates the use of hardware among various application programs for various
users.

🔷 2. OS Architecture
Different types of OS architectures define how the system is organized internally:
1. Monolithic Kernel
• All OS services run in kernel space (e.g., memory, I/O, process management).
• Example: Linux
• Fast but harder to maintain/debug.
2. Microkernel
• Only essential services (like IPC and scheduling) are in the kernel; others are in user
space.
• More secure and modular but may be slower.
• Example: Minix
3. Layered Architecture
• OS is built in layers; each layer uses services of the lower one.
• Easy to debug and maintain.
4. Modular Architecture
• Loadable kernel modules provide flexibility.
• Combines monolithic performance with microkernel flexibility.

🔷 3. Functions of Operating System


• Process Management: Handles creation, scheduling, and termination of processes.
• Memory Management: Manages RAM; allocates/deallocates memory to processes.
• File System Management: Manages files and directories (creation, deletion, access).
• Device Management: Controls hardware devices using device drivers.
• Security and Protection: Protects data and resources from unauthorized access.
• User Interface: Provides CLI (e.g., Bash) or GUI (e.g., GNOME) for user interaction.

🔷 4. Booting Process
The steps your computer follows when it turns on:
1. Power ON: Hardware receives power.
2. POST: Power-On Self-Test checks basic hardware.
3. Bootloader (e.g., GRUB): Loaded from MBR; loads the OS kernel.
4. Kernel Loading: Initializes system and hardware.
5. Init/Systemd: Starts background services and user interface.

🔷 5. Types of Operating Systems


Type Description
Batch OS Jobs are grouped and executed without user interaction.
Time Sharing OS Multiple users can use the system at once via time slicing.
Distributed OS Runs on multiple machines but appears as one system.
Network OS Allows computers to communicate over a network.
Real-Time OS Provides quick and predictable responses (e.g., in medical systems).
Mobile OS Designed for smartphones and tablets (e.g., Android, iOS).

🔷 6. Multiprogramming
• Multiple programs are loaded into memory.
• CPU switches between them when one is waiting (e.g., for I/O).
• Increases CPU utilization and system efficiency.

🔷 7. Multitasking
• The OS allows execution of multiple tasks (programs) at the same time.
• Two types:
• Preemptive: OS decides when to switch tasks (used in modern OS).
• Non-Preemptive: Task runs until it completes or voluntarily gives up CPU.
🔷 8. Multithreading
• A single process can have multiple threads (lightweight processes).
• Threads share the same memory but run independently.
• Helps in better CPU utilization and faster processing (e.g., in browsers, games).

🔷 9. OS Classifications
Classification Description
Users submit jobs to the computer operator; jobs run one after another
Simple Batch System
without interaction.
Multiprogrammed Batch OS keeps several jobs in memory; CPU switches among them to keep
System busy.
Users interact with the system simultaneously; each gets a short time
Time Sharing System
slice.
Parallel OS Multiple processors work together to execute jobs faster.
OS manages a group of computers, appearing to users as a single
Distributed OS
system. Useful in cloud systems and networks.

Let me know if you’d like a PDF version, Hindi explanation, or some practice questions!
Great! Here’s a detailed and student-friendly explanation of Unit-2: Process Management for
your Operating Systems with Linux internal exam:

🔷 1. Process Management
🔹 What is a Process?
A process is a program in execution. It is an active entity, unlike a program which is a passive set
of instructions.
Each process has:
• Program code
• Program counter (PC)
• Stack
• Data section
• Process Control Block (PCB) — contains information about the process (state, ID, registers,
etc.)
🔷 2. Process States and Transitions
A process goes through the following states during its lifetime:

📊 Process States:
1. New – Process is being created.
2. Ready – Process is waiting to be assigned to CPU.
3. Running – Instructions are being executed.
4. Waiting (Blocked) – Waiting for I/O or event.
5. Terminated – Process has finished execution.

🔁 State Transitions:
• New → Ready: After creation
• Ready → Running: CPU scheduler picks the process
• Running → Waiting: Process requests I/O
• Waiting → Ready: I/O complete, process is ready again
• Running → Ready: Preempted by OS (e.g., time slice over)
• Running → Terminated: Process finishes execution
📌 Diagram available on request!

🔷 3. CPU Scheduling Algorithms


When multiple processes are in the Ready state, the CPU Scheduler decides which one to execute
next.

📌 Key Scheduling Algorithms:


Algorithm Description Features
FCFS (First Come Processes are scheduled in the Simple, but may cause long waiting
First Serve) order they arrive. times.
SJF (Shortest Job Process with the shortest burst time Minimizes average waiting time, but
First) is executed first. can cause starvation.
Each process has a priority; highest
Priority Scheduling Starvation possible (solved by aging).
priority runs first.
Each process gets a fixed time slice Fair for all, good for time-sharing
Round Robin (RR)
(quantum). systems.
Different queues for different types Each queue has its own scheduling
Multilevel Queue
of processes. algorithm.
🔷 4. Threads
🔹 What is a Thread?
A thread is the smallest unit of CPU execution within a process.
A single process can have multiple threads (called multithreading).

🔹 Benefits:
• Faster context switching than processes
• Efficient CPU utilization
• Threads share memory, files, etc., reducing overhead

🔹 Types of Threads:
• User-level Threads: Managed by user-level libraries.
• Kernel-level Threads: Managed directly by the OS.

✅ Summary:
• A process is a running program; it has multiple states.
• CPU Scheduling Algorithms decide the order of execution.
• Threads are lightweight units inside a process, used for parallel tasks.

Would you like a diagram of process states, or a table comparing the scheduling algorithms in
PDF or image form?

You might also like