Reader Writer Problem Solution using semaphore

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/operating-system/process-synchronization/classical-problems/asset-reader-writer-problem-solution-using-semaphore after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, 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, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video provides a detailed lecture on solving the Readers-Writers synchronization problem using semaphores. The instructor defines shared variables (mutex, wrt, readcount) and constructs the logic for Writer and Reader processes. He explains the necessity of protecting the readcount variable with a mutex and using the wrt semaphore to block writers when readers are active. The lecture culminates in a complete code structure that implements a readers-preference solution, ensuring writers wait if readers are present.

Chapters

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

    The video begins with the instructor introducing the 'Solution using Semaphores' for the Readers-Writers problem. On the slide, he lists the shared data structures: semaphore mutex = 1, semaphore wrt = 1, and int readcount = 0. He explains that these variables are shared among all reader processes. He clarifies the role of mutex as a binary semaphore used to protect the readcount variable from race conditions, ensuring that only one process updates the count at a time. He also defines wrt as a semaphore used to manage access to the shared resource, specifically to block writers when readers are active. He points to the text on the screen to emphasize the initialization values.

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

    The instructor moves to the whiteboard to outline the logic for the Writer process. He writes Wait(wrt) before the Critical Section (CS) for writing and Signal(wrt) after. He explains that this simple structure ensures that only one writer can access the resource at a time and that writers are blocked if readers are currently reading. He then shifts focus to the Reader process, writing Readcount++ to increment the count when a reader enters and Readcount-- when it leaves. He emphasizes that these operations must be atomic to prevent data corruption and that a separate mechanism is needed to protect the counter.

  3. 5:00 – 10:00 05:00-10:00

    The instructor refines the Reader process logic by adding synchronization primitives. He writes Wait(mutex) before Readcount++ and Signal(mutex) after, ensuring the counter update is safe. He then introduces the critical logic for the first and last readers. He writes If(readcount == 1) followed by wait(wrt), explaining that the first reader must block writers. Conversely, he writes If(readcount == 0) followed by signal(wrt), explaining that the last reader must release the resource for waiting writers. He draws arrows to show the flow of execution and the conditions under which writers are blocked or unblocked. He also writes R1 and R2 to denote different readers.

  4. 10:00 – 12:11 10:00-12:11

    The instructor completes the solution by filling in the full table for both Writer and Reader processes. He writes the complete code sequence: Writer waits on wrt, enters CS, signals wrt. Reader waits on mutex, increments readcount, checks if it is the first reader (waits on wrt), signals mutex, enters CS, waits on mutex, decrements readcount, checks if it is the last reader (signals wrt), and signals mutex. He reviews the entire flow, pointing out how the wrt semaphore acts as a gatekeeper for writers, ensuring they wait if any readers are present, thus implementing a readers-preference solution. He highlights the specific lines of code on the board to reinforce the logic.

The lecture systematically builds a solution to the Readers-Writers problem. It starts with defining shared resources, then constructs the Writer process to ensure exclusive access. It then develops the Reader process, introducing a counter (readcount) protected by a mutex. The core logic involves the first reader blocking writers and the last reader releasing them. The final output is a complete, synchronized code structure that prioritizes readers.

Loading lesson…