caleb531 / cpu-scheduling-des Goto Github PK

One thing I noticed when working on the scheduler logic is that First Come First Served and Shortest job first run would be running the exact same code for each method.

The only difference between the two would be one would has a priority queue where the other has a regular queue, but the way its currently structured has us write each method all over.

On top of that, if we do decide the extra credit, most of the methods would still be the same.

Preemptive Shortest Job First and Round Robin would only require some extra code in schedule(), but the rest of the methods would still be the same as FCFS's,

I feel like we can reorganize how we will do the separate types of schedulers without creating a new class for each type.