Reader Writer Problem

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/operating-system/process-synchronization/classical-problems/asset-reader-writer-problem after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Programming, Data Structures, OOP & Java: 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, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  5. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  6. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  7. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  8. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  9. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: Data Interpretation
  18. Basis of Physics: Physics
  19. Previous Year Paper:
  20. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture introduces the classic Reader-Writer problem in the context of operating systems and concurrent processes. The instructor sets up a scenario where a database is shared among several processes. He distinguishes between 'readers,' which only read data, and 'writers,' which perform both read and write operations. The central challenge is managing concurrent access to prevent data inconsistency. The instructor explains that while multiple readers can access the shared data simultaneously without adverse effects, any interaction involving a writer (Reader-Writer, Writer-Reader, or Writer-Writer) can lead to 'chaos' or data corruption. Consequently, the lecture outlines the fundamental constraints required to generate a valid solution for this synchronization problem. The instructor uses a database table example to visualize the data being shared.

Chapters

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

    The instructor begins by defining the problem using a visual example of a database table containing movie titles and release years. He explains that some processes are readers (read-only) and others are writers (read/write). He states that if two readers access the shared data simultaneously, no adverse effects result. However, if a writer and another process access the database simultaneously, chaos may ensue. To illustrate permissible concurrency, he writes 'RR' on the whiteboard, indicating that Reader-Reader access is allowed. The visible database shows columns like 'title', 'release_year', 'length', and 'replacement_cost'. The slide text reads 'Suppose that a database is to be shared among several concurrent processes.' He gestures with his hands to emphasize the concept of sharing.

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

    The instructor continues by illustrating the problematic concurrency scenarios. He writes 'RW', 'WR', and 'WW' on the board, circling them to show that any combination involving a writer causes issues. He then transitions to a slide titled 'Points that needs to be taken care for generating a Solutions'. He reads and explains the first point: the solution may allow more than one reader at a time, but should not allow any writer. He underlines this text to emphasize the priority of allowing concurrent readers. The slide also states, 'To ensure that these difficulties do not arise, we require that the writers have exclusive access to the shared database while writing to the database.' He points to the text to guide the viewer's attention.

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

    The instructor focuses on the second constraint listed on the slide. He explains that the solution must strictly not allow any reader or writer while a writer is performing a write operation. He underlines 'write operation' and 'exclusive access' to highlight the critical nature of writer exclusivity. The slide text is clearly visible, providing the formal requirements for the synchronization algorithm that will likely be discussed next. He gestures towards the text to reinforce the point. The text 'The solution should strictly not allow any reader or writer, while a writer is performing a write operation' is highlighted.

The lecture progresses from defining the Reader-Writer problem and its constraints to outlining the specific requirements for a solution. It establishes that while readers can share data, writers require exclusive access to prevent data corruption. The instructor uses visual aids like a database table and whiteboard annotations to clarify the concepts of concurrent access and the resulting conflicts.

Loading lesson…