mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-26 14:04:17 +08:00
48 lines
1.3 KiB
Java
48 lines
1.3 KiB
Java
package com.thealgorithms.scheduling;
|
|
|
|
import com.thealgorithms.devutils.entities.ProcessDetails;
|
|
import java.util.List;
|
|
|
|
/**
|
|
* Non-pre-emptive First Come First Serve scheduling. This can be understood here -
|
|
* https://www.scaler.com/topics/first-come-first-serve/
|
|
*/
|
|
public class FCFSScheduling {
|
|
|
|
private List<ProcessDetails> processes;
|
|
|
|
FCFSScheduling(final List<ProcessDetails> processes) {
|
|
this.processes = processes;
|
|
}
|
|
|
|
public void scheduleProcesses() {
|
|
evaluateWaitingTime();
|
|
evaluateTurnAroundTime();
|
|
}
|
|
|
|
private void evaluateWaitingTime() {
|
|
int processesNumber = processes.size();
|
|
|
|
if (processesNumber == 0) {
|
|
return;
|
|
}
|
|
|
|
int waitingTime = 0;
|
|
int burstTime = processes.get(0).getBurstTime();
|
|
|
|
processes.get(0).setWaitingTime(waitingTime); // for the first process, waiting time will be 0.
|
|
|
|
for (int i = 1; i < processesNumber; i++) {
|
|
processes.get(i).setWaitingTime(waitingTime + burstTime);
|
|
waitingTime = processes.get(i).getWaitingTime();
|
|
burstTime = processes.get(i).getBurstTime();
|
|
}
|
|
}
|
|
|
|
private void evaluateTurnAroundTime() {
|
|
for (final var process : processes) {
|
|
process.setTurnAroundTimeTime(process.getBurstTime() + process.getWaitingTime());
|
|
}
|
|
}
|
|
}
|