README - when do you test them? Part2: OBL_Table Q1: Prove...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Name (both partners): UT EID (both partners): Slip days used (this project): Slip days used (total): Part 1: OBLBasic_Table Q1: Prove that your solution avoids deadlock Q2: Prove that your solution avoids starvation. Note: you must not make any assumtions about the order that the lock and condition variable primitives enable waiting threads. If you like, you may assume a <I>random scheduler</I> as described in the assignment. Q3: Explain your testing strategy including a discussion of the assertions you include in your code. What invariants must hold and
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: when do you test them? Part2: OBL_Table Q1: Prove that your solution avoids deadlock Q2: Prove that your solution ensures fairness while avoiding starvation (even if some philosophers are not hungry). Note: you must not make any assumtions about the order that the lock and condition variable primitives enable waiting threads. Q3: Explain your testing strategy including a discussion of the assertions you include in your code. What invariants must hold and when do you test them?...
View Full Document

Ask a homework question - tutors are online