This program assignment is provided to let the students understand how to the Operating Systems schedule all the processes on a multiprocessor or multicore environment.
Environment: Unix/Linux environment (VM Linux or Triton Server), Windows platform, Mac OS
Language: C, C++, and Java
Requirements:
i. We have learned many kinds of CPU scheduling methods:
1. First-Come, First-Served Scheduling
2. Shortest-Job-First Scheduling
3. Priority Scheduling
4. Round-Robin Scheduling
5. Multilevel Queue Scheduling
ii. Among the above scheduling scheme, I hope you would pick one method and simulate the CPU scheduling procedure.
iii. First, you are supposed to implement CPU scheduler.
iv. Next, you need to populate multiple processes. The processes should be managed by your system from the viewpoint of the Operating Systems. This requires that you maintain the corresponding PCBs. Before the creation of processes, it would be better to design the behavior scenario of each process.
v. The scheduler should show the (concurrent) sequence how the prcesses are selected to run their tasks and release (return) their turn to the other processes.
vi. Most importantly, you have to combine the CPU scheduler with the synchronization mechanism in order to prevent multiple processes from accessing the shared resources including system timer, counter on the queue, etc. The scenario should include a certain situation which show that you included the synchronization scheme on the CPU scheduler.
vii. Final result should be organized as a document which explains the overview and the structure of your program, real code, execution results (including captured image), and the conclusion including justification of your program, lessons you've learned, comments.