SelfAdjustingScheduling.java

packagecom.thealgorithms.scheduling;

importjava.util.PriorityQueue;

/**
 * SelfAdjustingScheduling is an algorithm where tasks dynamically adjust
 * their priority based on real-time feedback, such as wait time and CPU usage.
 * Tasks that wait longer will automatically increase their priority,
 * allowing for better responsiveness and fairness in task handling.
 *
 * Use Case: Real-time systems that require dynamic prioritization
 * of tasks to maintain system responsiveness and fairness.
 *
 * @author Hardvan
 */
publicfinalclassSelfAdjustingScheduling {

privatestaticclassTaskimplementsComparable<Task> {
Stringname;
intwaitTime;
intpriority;

Task(Stringname, intpriority) {
this.name = name;
this.waitTime = 0;
this.priority = priority;
 }

voidincrementWaitTime() {
waitTime++;
priority = priority + waitTime;
 }

@Override
publicintcompareTo(Taskother) {
returnInteger.compare(this.priority, other.priority);
 }
 }

privatefinalPriorityQueue<Task> taskQueue;

publicSelfAdjustingScheduling() {
taskQueue = newPriorityQueue<>();
 }

publicvoidaddTask(Stringname, intpriority) {
taskQueue.offer(newTask(name, priority));
 }

publicStringscheduleNext() {
if (taskQueue.isEmpty()) {
returnnull;
 }
TasknextTask = taskQueue.poll();
nextTask.incrementWaitTime();
taskQueue.offer(nextTask);
returnnextTask.name;
 }

publicbooleanisEmpty() {
returntaskQueue.isEmpty();
 }
}