代写 algorithm operating system There is a total of 100 marks.

There is a total of 100 marks.
4. Your Implementation
1. Performance metrics • Turnaround time • Waiting time
• Response time
[45/100] [9/45]
[3/9] [3/9] [3/9]
[36/45] [6/36]
[55/100] [7/55]
[16/55] [5/16]
[4/16] [3/16] [4/16]
[16/55] [5/16]
[4/16] [3/16] [4/16]
[16/55] [5/16]
[4/16] [3/16] [4/16]
Evaluation of CPU Scheduling Algorithms
5. Your Experiments and 6. Your Report
General form of report Experiment 1
• Scope and objectives well-defined • Parameters and setup explained • Results visualised
• Results discussed
Experiment 2
• Scope and objectives well-defined • Parameters and setup explained • Results visualised
• Results discussed
Experiment 3
• Scope and objectives well-defined • Parameters and setup explained • Results visualised
• Results discussed
Operating Systems Coursework 1 – Marking Criteria
2. Scheduling algorithms
• Round Robin
• Ideal Shortest Job First
• Multi-level feedback queue with Round Robin
• Shortest Job First using exponential averaging
You get zero marks for your implementation if your code does not compile or files are missing.
You get zero marks for your experiments and report if your input files and output files are not in the submission archive or your output files cannot be reproduced from your input files by running your run script using your implementation.
Note that by the character of the assignment it is very unlikely that any two submissions use the same set of input files.
1
[8/36] [10/36] [12/36]