Reader Writer Problem Solution using semaphore

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-5-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 the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js
  18. Unit 11 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…