Trying to implement various preemptive and non-preemptive algorithms in Java
Preemptive algorithms - allow the interruption of an ongoing process if a shorter/better process arrives
Examples: First Come First Serve (FCFS), Shortest Job First (SJF), Priority Algorithm (PA), Multilevel Queue, Future Knowledge
Non-preemptive algorithms - if a process is ongoing, it is NOT interrupted in any case and the new processes arriving have to wait
Examples: Round Robin (RR), Shortest Time Remaining First (STRF), Preemptive Priority, Multilevel Feedback Algorithm