CST334: Week 6 Learning Journal
The topics that were extensively covered this week were rendezvous synchronization, semaphores as signaling mechanisms, and as locks, counting threads in a shared state, barrier synchronization problem, differences between semaphores and condition locks, and practical debugging using the topics mentioned earlier. Rendezvous synchronization is when two threads do not continue any further until both of the threads are at the meeting point. Semaphores as signaling mechanisms work by using a numerical signal, waiting until the other threads see the signal before continuing. Using a semaphore as a lock, or mutexes, set to a numerical 1, only lets a single thread inside at a time. Counting threads in a shared state means sharing a count variable, counting how many threads are at the barrier. This will be using a mutex in order to protect the hookup. The synchronization barrier problem is a generalization of rendezvous synchronization, where it wor...