Ordering Among Different Process Using Semaphore

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/NIACL-AO-IT-SPECIALIST/operating-system-it-specialist/process-synchronization/semaphores-ordering/asset-ordering-among-different-process-using-semaphore after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Speed Mathematics and Basic Mathematics, Algebra, Percentage, Profit and Loss, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Partnership
  2. Reasoning Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Seating Arrangements, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Syllogisms, Blood Relations, Puzzle Solving (Puzzles), Inequality, Machine Input-Output
  3. English Language: Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Construction, Pronoun, Preposition, Conjunction, Adverb, Verb, Modals, Articles, Determiner, Interjection
  4. General Awareness: Evolution of Indian Banking (Banking & Financial Awareness), GK- Current Affairs, Static General Knowledge, Indian Economy
  5. C Concepts + MCQs (IT Specialist): C Programming by Yash Sir, C Language Core
  6. Java (IT Specialist): Java
  7. Python (IT Specialist): Python for Placements by Yash Sir, Python Basics
  8. OOPs (IT Specialist): Object Oriented Programming (OOPS)
  9. DBMS (IT Specialist): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  10. SQL (IT Specialist): SQL
  11. Software Engineering (IT Specialist): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Data Structure (IT Specialist): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  13. Operating System (IT Specialist): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  14. Compiler Design (IT Specialist): 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
  15. Computer Architecture (IT Specialist): Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  16. Data Communication & Networking (IT Specialist): Introduction to CN, Data Communication, 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, Network Security
  17. Descriptive Test (Main Exam): English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video is an educational lecture on Operating Systems, specifically focusing on the synchronization concept of "Ordering" concurrent processes using semaphores. The instructor begins by introducing the topic and uses a relatable real-world analogy involving a street food vendor making a sandwich to illustrate the necessity of sequential steps. He then transitions to a formal problem statement requiring the execution order P2 -> P3 -> P1. The lecture concludes with a step-by-step derivation of the semaphore code needed to enforce this specific ordering constraint. The instructor uses a digital whiteboard to write down the semaphore variables and operations. This approach helps students understand the abstract concept through a concrete example.

Chapters

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

    The session opens with the title "Ordering" clearly visible on the whiteboard. The instructor introduces the topic and immediately plays a video clip of a street food vendor preparing a sandwich. The vendor is shown cutting buns, spreading green chutney, and adding sliced tomatoes and onions. The instructor uses this visual to explain that just as ingredients must be added in a specific sequence to make the dish, processes in a computer system often need to execute in a defined order to function correctly. He points out that the vendor does not add the onion before the tomato, illustrating a strict ordering constraint. The video clip serves as a practical demonstration of the concept.

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

    The instructor continues to reference the sandwich video, emphasizing the sequential dependency of the actions. He then shifts focus to the academic problem displayed on the screen: "Q Using Semaphores ensure that the order of execution of there concurrent process p1, p2 and p3 must be p2 -> p3 -> p1?". A table is presented with three columns labeled P1(), P2(), and P3(), representing the code blocks for each process. The instructor explains that the goal is to fill in the semaphore operations to enforce the specific chain of execution starting with P2. He notes that the processes are concurrent but must follow a specific path. The problem requires careful placement of wait and signal operations.

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

    The instructor starts solving the problem by initializing two semaphores, writing `S1 = 0` and `S2 = 0` on the board. He explains that since P2 is the first process to run, it does not require a wait operation. He then places a `P(S1)` operation in the P3 column, indicating that P3 must wait for P2 to complete. He adds a `V(S1)` operation in the P2 column to signal P3. To handle the transition from P3 to P1, he adds a `P(S2)` operation in the P1 column and a `V(S2)` operation in the P3 column, effectively creating the chain P2 -> P3 -> P1. He writes the final code structure on the table, showing the P and V operations in their respective rows.

The lecture successfully connects a tangible real-world example with abstract computer science theory. By first visualizing the sequential steps of making a sandwich, the instructor clarifies the concept of process ordering. He then rigorously applies this logic to a standard Operating Systems problem, demonstrating the precise placement of P (wait) and V (signal) operations. The final solution shows how semaphores can be used to enforce a strict execution sequence of P2 -> P3 -> P1, ensuring that P3 waits for P2 and P1 waits for P3. This method ensures that the processes do not run in parallel but rather in a synchronized, ordered manner. The use of two semaphores allows for the chaining of three processes.

Loading lesson…