Grad student presentations fulfill three objectives:
Presentations must take no more than 5 minutes. Practice your presentation before you make it in class to be sure that it occupies 4-5 minutes. During your presentation, Dr. Pancake will indicate when there are:
Prepare 1-2 overheads to help the students understand your presentation. Do not use any font smaller than 24 point bold (anything smaller is unreadable and will cause your audience to fall asleep).
Turn in a (paper) copy of your slides to Dr. Pancake on the day of your presentation, before you begin to speak.
Keep your presentation clear and understandable. If you do not understand some aspect yourself, dig deeper into related material until you do understand it. You cannot present something well if you don't understand it. It might help to practice with a couple of your classmates, so that they can give you advice about which portions are unclear.
This presentation counts as 1/2 of a programming assignment.
|10 points||Correctness of information presented|
|15 points||Development of results: depth of understanding, evidence of logic underlying presenter's conclusions|
|15 points||Presentation quality: clarity, adherence to time limit, effective use of overheads|
Each grad student should select a topic from the list below. To register your selection, send email to the class maillist, indicating:
your name topic you have selectedIn the event of "concurrency" (two students picking the same topic), the mail message with the earlier timestamp wins. The other student must pick a new topic.
Note that all grad students are responsible for reading all the sections listed below. This material will be included on tests.
|Topic||Date||Section in book||Presenter
||Interrupt handling in NT||Wed., 4/21||23.3.2
||DAT in Intel's virtual memory scheme||Mon., 4/26
||Fig. 8.28 and section 126.96.36.199
||Swapping and paging in LINUX||Wed., 4/28||22.6.2
||File system in NT||Mon., 5/3||23.5.1
||Proc file system in LINUX||Fri., 5/7||22.7.3
||Distributed clocks||Wed., 5/12||18.1 and 18.4.2
||The cigarette-smokers' problem and deadlock: if we impose
a total ordering on the resources, it still deadlocks. Why?
||Fri., 5/14||Problem 6.8 and section 7.4.4
||Block device I/O in LINUX||Mon., 5/17||22.8.1
||Fault-tolerant disk management in NT||Wed., 5/19||23.5.4
||Robustness in distributed systems||Fri., 5/21||16.4
||Agreement in distributed systems||Wed., 5/26||18.7
||Election algorithm (choose one) for controlling a print
server in a distributed system||Fri., 5/28||18.6