Types of Semaphores

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/operating-system/process-synchronization/types-of-semaphores/asset-types-of-semaphores after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
  13. Paper 2 | Compiler Design: Intro to Compilers Lexical Analysis Grammar & CFG Syntax Analysis: Top-Down Syntax Analysis: Bottom-Up Semantic Analysis & SDT Intermediate Code Gen Code Optimization Run Time Environment
  14. Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
  16. Paper 2 | Computer Networks: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control DLL: Framing Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed lecture on the implementation of semaphores in operating systems, specifically focusing on the "Modified Wait" and "Modified Signal" operations designed to eliminate busy waiting. The instructor, Sanchit Jain, begins by introducing the topic and setting up a conceptual framework involving multiple processes. The core of the lesson transitions into a slide-based explanation of how to modify standard semaphore definitions. The lecture details the logic where a process executing a wait operation blocks itself rather than looping if the resource is unavailable. It further explains the corresponding signal operation that wakes up blocked processes. The instructor uses whiteboard diagrams to visualize the state of the semaphore value and the waiting queues, demonstrating how the value changes from positive to negative as processes wait and back towards zero as they are signaled. This approach ensures efficient CPU usage by preventing processes from consuming cycles while waiting for resources.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a title slide reading "Types of Semaphore" and identifying the instructor as "SANCHIT JAIN SIR" from "KNOWLEDGE GATE EDUCATOR". The lecturer begins drawing on a digital whiteboard to illustrate a scenario. He writes the labels P1, P2, P3 and draws a horizontal line, eventually labeling the end of the line P100. He performs a calculation on the board, writing 1/10 x 10 = 1, which appears to be a preliminary example or a setup for a probability problem related to the semaphore context. This initial segment sets the stage for discussing how processes interact with shared resources.

  2. 2:00 – 5:00 02:00-05:00

    The presentation moves to a slide titled "Modified Wait". The text explains that to overcome busy waiting, the wait() operation is modified so that if the semaphore value is not greater than zero, the process blocks itself. The code snippet wait(semaphore *S) is displayed, showing the logic: S->value-- followed by an if statement checking if S->value < 0. If true, the process is added to S->list and block() is called. The instructor draws a diagram showing processes P1, P2, P3 queuing up. He writes S = -3 to indicate that three processes are currently waiting in the blocked state, illustrating the concept of a negative semaphore value representing the number of waiting processes.

  3. 5:00 – 7:39 05:00-07:39

    The final section covers "Modified Signal". The slide text states that a blocked process should be restarted when another process executes a signal() operation. The code Signal(semaphore *S) is shown, which increments S->value++. If the new value is less than or equal to zero, a process P is removed from S->list and wakeup(P) is called. The instructor draws a diagram showing the semaphore value changing from S = -2 to -1 and finally to 0. He illustrates how processes P2, P3, P4 are removed from the waiting list and moved to the ready state, effectively demonstrating the mechanism of releasing resources and waking up waiting threads.

The lecture effectively bridges the gap between theoretical semaphore definitions and practical implementation by addressing the inefficiency of busy waiting. By modifying the wait and signal operations to include blocking and waking mechanisms, the system ensures that CPU time is not wasted on processes that cannot proceed. The visual progression from a simple calculation to complex queue management and state changes in the semaphore value provides a clear, step-by-step understanding of how operating systems manage concurrent access to shared resources. This method is crucial for maintaining system stability and performance in multi-threaded environments.

Loading lesson…