COMP 3500 Lecture Notes - Lecture 19: House Mouse, Concurrent Computing, Version Control
24 Oct 2018
School
Department
Course
Professor
Document Summary
4. 1 solving a synchronization problem using condition variables. This project offers you an opportunity to write a straightforward concurrent program and to get a more detailed understanding of how to use threads to solve synchronization problems. We have provided you with basic driver code that starts a predefined number of threads. You are responsible for what those threads do. Again, remember to specify a seed to use in the random number generator by editing your sys161. conf file. It is a lot easier to debug initial problems when the sequence of execution and context switches is reproducible. When you configure your kernel for asst1, the driver code and extra menu options for executing your solutions are automatically compiled in. You must implement a solution for the casts-and-mice problem using the cv mechanism developed in project 3. You should start your implementation by modifying the existing source code file named catlock. c, which is located in the src/kern/asst1 directory.
