Ordering Among Different Process Using Semaphore

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-06-operating-system/process-synchronization/semaphores-ordering/asset-ordering-among-different-process-using-semaphore after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | Computer Networks: 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, Physics
  19. GS Paper | 05 | Elementary Maths: Number System, Divisibility Rules, HCF LCM, Percentage, Profit and Loss, Simple Interest and Compound Interest, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Algebra, Mensuration and Geometry, Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), Mixture and Alligation, Calculus, Trigonometry, Vectors
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: GK- Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…