CST334: Journal Entry Week 6
There was a lot of reading to do this week. We learned mainly about semaphores and common concurrency problems. Semaphores are a synchronization primitive that combines the uses of locks and condition variables to solve problems with concurrency. Semaphores are objects that contain an integer value that can be manipulated with two routines to increment and decrement the value to manage system resources. The common concurrency problems chapter goes over different types of bugs present in modern applications like non-deadlock bugs and order-violation bugs. Non-deadlock bugs are very common, but easy to fix because they are usually atomicity violations or order violations. Deadlock bugs are a little more complicated but they can be solved by proper scheduling.
Comments
Post a Comment