Final Presentation

C S 4/5113 Distributed OS

Operating Systems Theory (Fall 2022)

Below is the presentation schedule. We will need to queue up each talk in this order. Your video must be posted NO LATER than 1pm on the final exam day.

Name	Schedule
Sam Bird	1:30pm
Haven Smith	1:36pm
Oluwasijibomi Ajisegiri	1:42pm
Parker Brandt	1:48pm
Pradipkumar Rajasekaran	1:54pm
Marcos Bernier	2:00pm
Nimisha Agarwal	2:06pm
Deepti Rao	2:12pm
Kyle Weidner	2:18pm
Jonathan Smith	2:24pm
William Lu	2:30pm
Christopher Chhim	2:36pm
William Kersh	2:42pm
Benton Smith	2:48pm
Bryce Jackson	2:54pm
Lasya Narkimelli	3:00pm
Shivaram Myneni	3:06pm
Donkada Harsha Vardhan	3:12pm
James Norum	3:18pm
Sanjay Reddy Dodda	3:24pm
Aditya Rohan Singh	3:30pm
Rithsek Ngem	3:36pm

Rubric

For full credit, the presentation’s title should include the presenter’s name and contact information, and the description should include the goals of the project and the presenter’s primary focus. The presentation should also explicitly describe and cite at least two distributed system problems being addressed, and include a demonstration with logs of a complete run of the code and an explanation of what is happening in the run.

For partial credit, the presentation may be missing one of the required elements (e.g. the description may not include the presenter’s primary focus, or the demonstration may not include an explanation of what is happening in the run).

For low credit, the presentation may be missing multiple required elements (e.g. the title may not include the presenter’s name, the description may not include the goals of the project, and the demonstration may not include logs of a complete run of the code).

For no credit, the presentation may be missing multiple required elements and/or the elements that are included may not meet the criteria for partial credit.

Criteria	Full Credit	Partial Credit	Low Credit	No Credit
Title includes presenter's name and contact information	20 pts	10 pts	5 pts	0 pts
Description includes goals of the project and presenter's primary focus	20 pts	10 pts	5 pts	0 pts
DS Problem #1 is explicitly described and cited	20 pts	10 pts	5 pts	0 pts
DS Problem #2 is explicitly described and cited	20 pts	10 pts	5 pts	0 pts
DS Problem #3 is explicitly described and cited (if applicable)	20 pts	10 pts	5 pts	0 pts
Demonstration includes logs of a complete run of the code and explanation of what is happening in the run	20 pts	10 pts	5 pts	0 pts
Total	100 pts	50 pts	25 pts	0 pts

---

Back to CS 5113