Clarify description to avoid unjustly nailing students.
authorBen Pfaff <blp@cs.stanford.edu>
Fri, 8 Dec 2006 16:03:50 +0000 (16:03 +0000)
committerBen Pfaff <blp@cs.stanford.edu>
Fri, 8 Dec 2006 16:03:50 +0000 (16:03 +0000)
From Vincenzo Di Nicola <dinicola@stanford.edu>.

ta-advice/hw1.txt

index 39e3f79937918a915a11c4a5b8153785b016c3e7..784c5f101ab33825714dc39e3e9e3cad96c12594 100644 (file)
@@ -86,7 +86,8 @@ PROBLEM 2: PRIORITY SCHEDULING
   DESIGN
     -30 Not implemented
     -15 Malfunctions in corner case (e.g. when malloc() returns NULL)
-    -15 Fixed limit on total number of donations, donees, donor locks, etc.
+    -15 Grossly simplified design egregiously limits generality, e.g. small,
+        fixed limit on total number of donations, donees, donor locks, etc.
      -5 Global list of donations is unnecessary and inefficient
      -3 sema_up() yields regardless of whether a higher-priority
         thread was unblocked