Operating Systems Part 3 : Synchronization and Deadlock

Learn the concepts of Operating Systems from scratch as Operating System forms the core of Computer Science

  • 0.0 (0 Reviews)
  • 0 Students
  • 95 Lessons
  • Vignesh Sekar

Course Overview

Welcome to the course Operating systems Part 3 : Synchronization and Deadlock

Mastering the concepts of Operating Systems is very important to get started with Computer Science because Operating System is the program which is responsible for the ease with which we are able to use computers today to solve our problems by writing application programs like Google Chrome. The concepts which we are going to study is going to give a very good understanding of Process Synchronization and Deadlocks - one of the toughest topics of Computer Science. But believe me I made it as simpler as possible in this course. Lot of examples has been discussed just to strenghten the understanding of concepts. Also the topics are covered in a pace where even an ordinary student can understand everything. 

Without using Operating Systems ,it is extremely difficult to communicate with the hardware devices of our computer. Every computer today has an Operating System installed in it. Through this course you will not only master synchronization in Operating Systems but also feel the real beauty of computer science.

In this course ,every concept of Operating Systems is taught in an easy-to-understand manner such that anybody who has covered my Operating Systems Part 1 course will be able to understand.

Come and join me, I assure you that you will have the best learning experience of not just Operating Systems but also the core of Computer Science in a different dimension.



See more

FAQ

FAQ area empty

Course curriculum

19 chương 95 bài học 15 giờ 21 phút 7 bài học thử miễn phí
Chương 1 Introduction
Chương 2 Critical Section and Non Critical Section
Chương 3 Various Conditions of a Synchronization Mechanism
Chương 4 Lock Synchronization Mechanism
Chương 5 TSL Synchronization Mechanism
  • Important : Basics of Assembly Code 11:08
  • When Mutual Exclusion can be violated in Lock synchronization mechanism 15:01
  • Need for special instruction - TSL 11:14
  • TSL Synchronization Mechanism Explained 10:45
  • TSL - Mutual Exclusion, Progress, Bounded Waiting 8:55
  • Features of TSL Synchronization Mechanism 4:32
Chương 6 Problems on TSL
  • Checking of Starvation Problem 17:29
  • Checking of FIFO order 6:41
  • Checking of Mutual Exclusion and Deadlock 9:29
Chương 7 Strict Alternation Synchronization Mechanism
  • Strict Alternation Synchronization - Mutual Exclusion, Progress 16:23
  • Strict Alternation - Bounded Waiting 3:40
  • Features of Strict Alternation Synchronization Mechanism 3:41
  • Problem on Strict Alternation 7:39
Chương 8 Disable Interrupts Synchronization Mechanism
  • Disabling Interrupts Synchronization Explained Completely 14:33
  • Features of Disabling Interrupts and its disadvantage 5:50
Chương 9 Interested Variables Synchronization Mechanism
  • Interested Synchronization Mechanism Explained 17:35
  • Interested Synchronization - Mutual Exclusion 1:05
  • Interested Synchronization - Deadlock 9:12
  • Interested Synchronization - Progress 16:53
  • Interested Synchronization - Progress Continued 11:43
  • Interested Synchronization - Bounded Waiting 3:39
Chương 10 Peterson Synchronization Mechanism
  • Peterson Synchronization Mechanism intro 16:34
  • Difference between Local and Global Variables 6:34
  • Peterson Synchronization Mechanism Explained 13:48
  • Peterson Synchronization Mechanism Continued 6:40
  • Peterson Synchronization Mechanism - Mutual Exclusion 1:45
  • Peterson Synchronization Mechanism - Progress 6:28
  • Peterson Synchronization Mechanism - Bounded Waiting 9:36
  • Features of Peterson Synchronization Mechanism 2:41
Chương 11 Problems on Non busy Waiting Synchronization Techniques
  • Disadvantages of Busy Waiting Synchronization Techniques 11:10
  • Problem 1 15:05
  • Problem 2 4:31
  • Introduction to Non Busy Waiting Synchronization Techniques 12:50
Chương 12 Producer Consumer Problem
  • Producer Consumer Problem 15:19
  • Producer Consumer Problem Continued 12:19
  • Producer Consumer Problem Continued 13:39
Chương 13 Binary Semaphores
  • Basic idea of Structure in C programming 13:20
  • Binary Semaphores Explained 1 11:37
  • Binary Semaphores Explained 2 12:35
  • Wait () and Signal () System Calls 2:17
  • Wait and Signal synchronization mechanism - ME, Progress, Bounded Waiting 7:13
  • Features of Wait and Signal Synchronization 1:48
  • Other names for Wait and Signal System Calls 1:23
Chương 14 Problems on Binary Semaphore
  • Problem 1 11:26
  • Problem 2 9:32
  • Problem 3 14:24
  • Problem 4 9:00
  • Problem 5 15:05
  • Problem 5 continued 15:46
  • Problem 6 10:55
  • Problem 7 16:09
  • Problem 8 8:23
Chương 15 Dining Philosopher Problem
  • Problem based on Dining Philosopher Problem 13:15
  • Trick to avoid Deadlock 4:04
  • Dining Philosopher Problem Explained 15:34
  • Another Variation of Dining Philosopher Problem 6:23
Chương 16 Counting Semaphore
  • Introduction to Counting Semaphore 4:46
  • Down() System call for Counting Semaphore 15:56
  • Down System call for Counting Semaphore continued 6:58
  • Up() System call for Counting Semaphore 13:01
  • Example to illustrate Up() and Down() 5:41
  • Problem 1 3:52
  • Problem 2 14:33
Chương 17 Deadlocks
  • Deadlock and Starvation 14:17
  • Necessary condition for Deadlock - Mutual Exclusion 4:14
  • Necessary condition for Deadlock - Hold and Wait 5:05
  • Necessary condition for Deadlock - No Preemption 5:00
  • Necessary condition for Deadlock - Circular Wait 3:52
  • Minimum Number of resources needed so that deadlock can never happen 12:56
  • Problems 5:50
  • Maximum number of processes that can be present so that deadlock can be avoided 8:25
  • Problems 15:27
Chương 18 Deadlock Handling Methods
  • 4 ways of handling deadlock 17:41
  • Deadlock Prevention Techniques 16:40
  • Deadlock Avoidance using Banker's Algorithm 15:50
  • Deadlock Avoidance using Banker's Algorithm continued 10:20
  • Banker's Algorithm Example 1 4:38
  • Banker's Algorithm Example 2 10:03
  • Banker's Algorithm Example 3 7:37
  • Important Points to Note 9:45
Chương 19 Bonus : How to proceed further
  • Bonus : How to proceed further

Requirment

  • Have a PC with internet connection

  • Basics of Operating systems is necessary - if you have watched my Operating Systems Part 1 course you are good to start this course

Outcomes

  • You will become very familiar with the core concepts of Operating Systems

  • You will be able to challenge the interviewer on questions related to Synchronization and Deadlock

  • You will view Computer Science in a different dimension

  • You will be able to answer all questions of exams like GATE,PGEE,ISRO (after completing all parts of OS course

  • You will be able to get a top grade in your Operating systems course in your Bachelor's degree

  • Understand how Operating Systems work

  • Understand how Process synchronization works

  • Understand about Deadlocks

  • Understand various synchronization mechanisms in Operating Systems

Instructor

...
Vignesh Sekar

0.0

  • ... 0 Student
  • ... 6 Courses
  • ... 0 review

View Details

Reviews

Rate this course :

Remove all