L-3.12: Solution of Readers-writers Problem using Binary semaphore

630.6K views
•
March 1, 2018
by
Gate Smashers
YouTube video player
L-3.12: Solution of Readers-writers Problem using Binary semaphore

Transcript

Hello friends, welcome to Gate Smashers today we are going to discuss Readers-Writers Problem. Standard problem of process synchronization in operating system that is Readers and Writers Problem. Before discussing the problem, I want to tell a little base what the problem is. We have actually a database. Database is what? A collection of related da... Read More

Install to Summarize YouTube Videos and Get Transcripts

Explore YouTube Video Summarizer or Get YouTube Transcript Extractor

Read in Other Languages (beta)

English

Share This Summary 📚

Explore More Summaries from Gate Smashers 📚

What Is the Traveling Salesman Problem and How to Solve It? thumbnail
What Is the Traveling Salesman Problem and How to Solve It?
Gate Smashers
What Is Manchester Encoding and How Does It Work? thumbnail
What Is Manchester Encoding and How Does It Work?
Gate Smashers
What Is the Difference Between Multiprogramming and Multitasking? thumbnail
What Is the Difference Between Multiprogramming and Multitasking?
Gate Smashers
What Is Process Synchronization and Why Is It Important? thumbnail
What Is Process Synchronization and Why Is It Important?
Gate Smashers
Lec-15: What is Hypervisor | Types of Hypervisor thumbnail
Lec-15: What is Hypervisor | Types of Hypervisor
Gate Smashers
What Are Big O, Big Omega, and Theta Notations? thumbnail
What Are Big O, Big Omega, and Theta Notations?
Gate Smashers