The flower that blooms in adversity… is the most rare and beautiful of them all.
Mulan
Only 2 more weeks to go! Woot woot.
This week definitely has flown quickly, I never realized how fast the week can go by.
This week we learned, at least I learned a ton about semaphores.
Semaphores were invented in 1965 by Dijkstra. A semaphore is a mechanism that allows contending process or thread to alter, monitor queries, and control shared system resources. A semaphore is a solution to race condition in multiprocessing system.
A semaphore is an object with an integer value that we can manipulate
with two routines; in the POSIX standard, these routines are sem wait()
and sem post().
Semaphores can be used to set order of execution between threads like CV.
That’s all for now. Looking forward to next week! 🙂
jeanniecodes 