CS 213 Spring '00
Lab 3

Lab Assignment L3

• Garbage Collection Statistics
• Lab 3 Handout(ps)

Revisions and Updates:

• NOTE: the due date for the assignment is now Monday, March 20th at 11:59pm.
• (3/12) Breakdown of points for performance are as follows:

Performance index         Score
 0 - 49                              1
50 - 69                             2
70 - 79                             3
80 - 89                             4
90 - 100                           5
• (3/12) You should pick up a new copy of splay_tree.c and driver.c from /afs/cs/academic/class/15213-s00/L3/src/

Here is a summary of the changes:
1. splay_tree.c: contains()

- previously returned the closest node with address less than the one given, leaving it up to you to check that the address actually falls within the data portion of that node.
- now returns the node which contains the address (if one exists) or NULL if the address is not within any allocated block. This was the intended behaviour, and the one implied by the name of the function. The commented description of contains() has also been updated to reflect this change.
2. driver.c: pgm_tests() and main()

- many of the actual program tests are designed to completely fill the heap area, making the memory utilization parameter for these tests less useful. The code has been modified to not include these tests in computing your average overall utilization for the performance metric. If you have made changes to driver.c to facilitate your own testing, you can continue using it. The new version will be used by the web script and for grading, however.
• (3/2) There are two (previously) undocumented options to the driver program for malloc:
1. -s: run the synthetic traces only (default is to run all tests)
2. -p: run the program tests only 

Back to CS213 home page.