clementbowe14 / osnotes

Code snippets and exercises done in COP4610

OSNotes

Code snippets and exercises done in COP4610

osnotes's Issues

Add sorting method for shortest job first scheduling algorithm

For this scheduling algorithm, the process with the lowest total CPU time goes first.

Refactor Kianoush code to use the process structs for the PriorityScheduler and the Regular Scheduler.

Change the circular queue and heap code to use the process struct implementation you create

Add sorting method for round-robin scheduling algorithm

• Create sort linked lists using the round-robin algorithm.
• (first in first out) The processes with the lowest arrivalTimes comes first.

Create Scheduler Structs

CPU scheduler Preemptive MLF scheduling

1. List of linked lists for active processes
2. Queue of processes for new processes
3. Queue for terminated processes.

CPU scheduler SRT SJF

1. Heap for active processes
2. Queue for new processes
3. Queue for terminated processes

CPU scheduler RR

1. Queue for active processes
2. Queue for new processes
3. Queue for terminated processes

Add method for the shortest remaining time algorithm.

The shortest time remaining algorithm sorts the processes by the least remaining time left among the active processes to run next in the list.

Create a method to activate processes

create a method activateProcess that searches for the processes in the new process list of the CPU scheduler and changes their process status to active.