1. Урок 1.00:08:10
    Concept of Shared Memory
  2. Урок 2.00:17:16
    Need for Synchronization Mechanism - 1
  3. Урок 3.00:08:40
    Need for Synchronization Mechanism - 2
  4. Урок 4.00:11:03
    Critical Section and Race Condition Explained
  5. Урок 5.00:06:03
    Why Race Condition happens
  6. Урок 6.00:02:28
    More on Critical Section and Non Critical Section
  7. Урок 7.00:15:39
    Synchronization explained
  8. Урок 8.00:07:30
    Basic Idea of Mutual Exclusion
  9. Урок 9.00:04:26
    Basic Idea of Progress
  10. Урок 10.00:16:13
    Basic Idea of Bounded Waiting
  11. Урок 11.00:17:21
    Synchronization with Lock variable and its disadvantage
  12. Урок 12.00:02:44
    Progress Condition for Lock variable
  13. Урок 13.00:06:55
    Bounded Waiting Condition for Lock variable
  14. Урок 14.00:07:42
    Features of Lock Synchronization
  15. Урок 15.00:11:09
    Basics of Assembly Code
  16. Урок 16.00:15:02
    When Mutual Exclusion can be violated in Lock synchronization mechanism
  17. Урок 17.00:11:15
    Need for special instruction - TSL
  18. Урок 18.00:10:46
    TSL Synchronization Mechanism Explained
  19. Урок 19.00:08:56
    TSL - Mutual Exclusion, Progress, Bounded Waiting
  20. Урок 20.00:04:33
    Features of TSL Synchronization Mechanism
  21. Урок 21.00:17:30
    Checking of Starvation Problem
  22. Урок 22.00:06:42
    Checking of FIFO order
  23. Урок 23.00:09:30
    Checking of Mutual Exclusion and Deadlock
  24. Урок 24.00:16:24
    Strict Alternation Synchronization - Mutual Exclusion, Progress
  25. Урок 25.00:03:41
    Strict Alternation - Bounded Waiting
  26. Урок 26.00:03:42
    Features of Strict Alternation Synchronization Mechanism
  27. Урок 27.00:07:40
    Problem on Strict Alternation
  28. Урок 28.00:14:34
    Disabling Interrupts Synchronization Explained Completely
  29. Урок 29.00:05:51
    Features of Disabling Interrupts and its disadvantage
  30. Урок 30.00:17:36
    Interested Synchronization Mechanism Explained
  31. Урок 31.00:01:06
    Interested Synchronization - Mutual Exclusion
  32. Урок 32.00:09:13
    interested Synchronization - Deadlock
  33. Урок 33.00:16:54
    Interested Synchronization - Progress
  34. Урок 34.00:11:44
    Interested Synchronization - Progress Continued
  35. Урок 35.00:03:40
    Interested Synchronization - Bounded Waiting
  36. Урок 36.00:16:35
    Peterson Synchronization Mechanism intro
  37. Урок 37.00:06:35
    Difference between Local and Global Variables
  38. Урок 38.00:13:49
    Peterson Synchronization Mechanism Explained
  39. Урок 39.00:06:41
    Peterson Synchronization Mechanism Continued
  40. Урок 40.00:01:46
    Peterson Synchronization Mechanism - Mutual Exclusion
  41. Урок 41.00:06:29
    Peterson Synchronization Mechanism - Progress
  42. Урок 42.00:09:37
    Peterson Synchronization Mechanism - Bounded Waiting
  43. Урок 43.00:02:42
    Features of Peterson Synchronization Mechanism
  44. Урок 44.00:11:11
    Disadvantages of Busy Waiting Synchronization Techniques
  45. Урок 45.00:15:06
    Problem 1
  46. Урок 46.00:04:32
    Problem 2
  47. Урок 47.00:12:51
    Introduction to Non Busy Waiting Synchronization Techniques
  48. Урок 48.00:15:20
    Producer Consumer Problem
  49. Урок 49.00:12:20
    Producer Consumer Problem Continued
  50. Урок 50.00:13:40
    Producer Consumer Problem Continued
  51. Урок 51.00:13:21
    Basic idea of Structure in C programming
  52. Урок 52.00:11:38
    Binary Semaphores Explained 1
  53. Урок 53.00:12:36
    Binary Semaphores Explained 2
  54. Урок 54.00:02:18
    Wait () and Signal () System Calls
  55. Урок 55.00:07:14
    Wait and Signal synchronization mechanism - ME, Progress, Bounded Waiting
  56. Урок 56.00:01:49
    Features of Wait and Signal Synchronization
  57. Урок 57.00:01:24
    Other names for Wait and Signal System Calls
  58. Урок 58.00:11:27
    Problem 1
  59. Урок 59.00:09:33
    Problem 2
  60. Урок 60.00:14:25
    Problem 3
  61. Урок 61.00:09:01
    Problem 4
  62. Урок 62.00:15:06
    Problem 5
  63. Урок 63.00:15:47
    Problem 5 continued
  64. Урок 64.00:10:56
    Problem 6
  65. Урок 65.00:16:10
    Problem 7
  66. Урок 66.00:08:24
    Problem 8
  67. Урок 67.00:13:16
    Problem based on Dining Philosopher Problem
  68. Урок 68.00:04:05
    Trick to avoid Deadlock
  69. Урок 69.00:15:35
    Dining Philosopher Problem Explained
  70. Урок 70.00:06:24
    Another Variation of Dining Philosopher Problem
  71. Урок 71.00:04:47
    Introduction to Counting Semaphore
  72. Урок 72.00:15:57
    Down() System call for Counting Semaphore
  73. Урок 73.00:06:59
    Down System call for Counting Semaphore continued
  74. Урок 74.00:13:02
    Up() System call for Counting Semaphore
  75. Урок 75.00:05:42
    Example to illustrate Up() and Down()
  76. Урок 76.00:03:53
    Problem 1
  77. Урок 77.00:14:34
    Problem 2
  78. Урок 78.00:14:18
    Deadlock and Starvation
  79. Урок 79.00:04:15
    Necessary condition for Deadlock - Mutual Exclusion
  80. Урок 80.00:05:06
    Necessary condition for Deadlock - Hold and Wait
  81. Урок 81.00:05:01
    Necessary condition for Deadlock - No Preemption
  82. Урок 82.00:03:53
    Necessary condition for Deadlock - Circular Wait
  83. Урок 83.00:12:57
    Minimum Number of resources needed so that deadlock can never happen
  84. Урок 84.00:05:51
    Problems
  85. Урок 85.00:08:26
    Maximum number of processes that can be present so that deadlock can be avoided
  86. Урок 86.00:15:28
    Problems
  87. Урок 87.00:17:42
    4 ways of handling deadlock
  88. Урок 88.00:16:41
    Deadlock Prevention Techniques
  89. Урок 89.00:15:51
    Deadlock Avoidance using Banker's Algorithm
  90. Урок 90.00:10:21
    Deadlock Avoidance using Banker's Algorithm continued
  91. Урок 91.00:04:39
    Banker's Algorithm Example 1
  92. Урок 92.00:10:04
    Banker's Algorithm Example 2
  93. Урок 93.00:07:38
    Banker's Algorithm Example 3
  94. Урок 94.00:09:46
    Important Points to Note