FOR FREE CONTENT
- Introduction: OS
- Booting Process
- Command Interpreter
- Dual mode of operation
- System Calls
- Difference between system call and library call
- Interrupt and Trap
- Introduction
- Scheduling Criteria, Terms and Concepts
- Different Type Scheduling Algorithms
- Longest Job First
- Longest Remaining Time First
- Highest Response Ratio Next (HRRN)
- Priority Scheduling
- Least Completed Next (LCN) Scheduling
- Multi-Level Queue Scheduling
- Multilevel Feedback Queue Scheduling
- Guaranteed Scheduling
- Fair Share Scheduling
- Lottery Scheduling
- Multi-Processor Scheduling
- Deadline Scheduling
- Rate-Monotonic Scheduling
- POSIX Real-Time Scheduling
- Priority Inversion
- Proportional Share Scheduling
- Comparison table of Scheduling Algorithm
- Algorithm Evaluation for Scheduling
- Important concept of MM
- Memory Representation as Address
- Memory layout for a Process
- Logical and Physical Address Space
- Necessity of Memory Management
- Introduction
- Concept of Non-contiguous memory allocation
- Basic concept of Paging
- Address Translation
- Process of Paging Method
- Calculation of Offset for paging
- Calculation of Logical Address Bit and number of Pages
- Calculation of Physical Address Bit and number of Frames
- Calculation of Page Table Size
- Organization of MMU
- Why Page size power of 2
- Paging Address Calculation: example1
- Paging Numeric Problem: Example2
- Paging Address Calculation: Example3
- Paging Address Calculation: Question1
- Some Important Question 2
- Paging Address Translation: Question3
- UGC NET Paging Question
- GATE Paging Question
- Number of information at Page Entry
- Exams Question on Page Entry Information
- Exam Question: Page Entry Information
- Calculates Page Table Entry Size
- Calculates Page Size
- Calculation of Optimal Page Size
- Question on Optimal Page Size
- Hashed Page Table with Example
- Inverted Page Table with Gate Question
- Question on Inverted Page Table
- Multi-Level Paging
- Multi-level paging: Example1
- Multi-level paging: Example2
- Allocation of Frames
- Subject Mock
Booting Process:
Booting process is starting up the computer and loads the operating system. It is initiated by a power button or by a reads software command. After the power button is on, the computer only read a part of Read Only Memory (ROM) and a small program begins executing from ROM called firmware. In older machines, this firmware was known as the BIOS (Basic Input/Output System).
But more modern systems use UEFI (Unified Extensible Firmware Interface), which is more faster and makes better use of the facilities in contemporary processors. The firmware runs power-on self-test (POST) to diagnostic, identifies many of the devices attached to the system and initializes them, and then builds the description used by the advanced configuration and power interface (ACPI). It initializes the CPU register, device controller, and content of the main memory after that it loads the operating system.
Now boots manager gives an option to the user which operating system to run and set complex parameters for it. Now boot loader (Bootstrap loader) initialize (load) into memory and runs it by firmware or boot manager. This set of programs is placed in the operating system kernel like Linux or windows into RAM (main memory) and run it.
The kernel initializes itself and cremates two processes. The system process contains all the internal kernel threads which never executes in user mode. The first user-mode process cremated is session manager subsystems (SMSS) in WINDOWS and INIT (initialization) process in UNIX.
Now it performs further initializations of the system, including establishing the paging file, loading more device drivers, and managing the operating system sessions to represent a logged-on user.
