 |
 |
 |
 |
 |
|||||||
Assignment 7: Lessons Learned & Synchronization (25 pts)
| Assignment Day | October 21, 2010 (Wednesday) |
| Due Date | November 02, 2010 (Tuesday before class) |
| Email (time stamp) and Typed Hardcopy is required. |
Read Chapter 2.2-2.3 on Synchronization & 3.3 on Deadlocks
Question 1 : Spill the beans: Post to the class email list your top 3 "lessons learned" and tricks that you learned (programmed) in the process of programming your MINIX scheduling algorithms. You can post more than tree if you wish [please print out you post and submit with your homework].
Question 2: Inquire: Ask the list something that you still are having problems with or that wish to have resolved (try to be concise when asking your question(s)) [print your post and submit with your homework]
Question 3: Enlighten: Post the answer to someone's question (See Q2) or give us a hint on how to proceed [print your post and submit with your homework].
Question 4: Textbook Question 15: Give a sketch of how an operating system that can disable interrupts could implement semaphores.
Question 5: Textbook Question 22: Consider the procedure put_forks in Fig 2-20. Suppose the variable state[i] was set to THINKING after the two calls to test, rather than before. How would this change affect the solution of the case of 3 philosophers? For 100 philosophers?