HOMEWORK 4: AUTOGRADING SCHEDULER


NAME:  < insert name >


COLLABORATORS AND OTHER RESOURCES:
List the names of everyone you talked to about this assignment
(classmates, TAs, ALAC tutors, upperclassmen, students/instructor via
the forum, etc.), and all of the specific resources (books, online
reference material, etc.) you consulted in completing this assignment.
This should not be "none"!

< insert collaborators / resources >

Remember: Your implementation for this assignment must be done on your
own, as described in "Academic Integrity for Homework" handout.



ESTIMATE OF # OF HOURS SPENT ON THIS ASSIGNMENT:  < insert # hours >



BIG O NOTATION

j = number of student autograding submissions/jobs
p = number of processors on the Submitty system
n = average or maximum number of processors needed by a single job
r = average or maximum runtime of a single job
q = maximum number of jobs in the queue at any time
t = number of timesteps to empty the queue and complete all autograding

HOW ARE THESE VARIABLES RELATED TO EACH OTHER?

< write a few sentences >


ANALYSIS OF SINGLE FILE ALGORITHM

< don't forget to justify your answer >


ANALYSIS OF FIRST AVAILABLE ALGORITHM

< don't forget to justify your answer >


ANALYSIS OF KEEP BUSY ALGORITHM

< don't forget to justify your answer >


ANALYSIS OF CUSTOM ALGORITHM

< don't forget to justify your answer >


SIMULATION DATA

< include neatly organized and formatted data from your testing >


DISCUSSION

< how do the simulation results compare with your Big O Notation analysis? >



MISC. COMMENTS TO GRADER:  
Optional, please be concise!