diff --git a/pom.xml b/pom.xml index 2bf8874fa7d..0965eddecca 100644 --- a/pom.xml +++ b/pom.xml @@ -207,6 +207,7 @@ context-object thread-local-storage optimistic-offline-lock + scheduler diff --git a/scheduler/README.md b/scheduler/README.md new file mode 100644 index 00000000000..04b38a8256d --- /dev/null +++ b/scheduler/README.md @@ -0,0 +1,54 @@ +--- +title: Scheduler Pattern +category: Creational +language: en +tag: +--- + +## Name +Scheduler Design Pattern + +## Intent +The Scheduler Design Pattern is used to manage and coordinate the execution of tasks or jobs in a system. It provides a mechanism for scheduling and executing tasks at specific times, intervals, or in response to certain events. This pattern is especially useful when dealing with asynchronous operations, background processing, and resource allocation. + +## Explanation +The Scheduler Design Pattern is designed to decouple task scheduling from the actual execution of tasks. It abstracts the scheduling logic, making it possible to change or extend the scheduling behavior without affecting the tasks themselves. This pattern allows for efficient resource utilization, load balancing, and prioritization of tasks. + +## Class diagram +![Scheduler Pattern](etc/scheduler.png) + +## Applicability +The Scheduler Design Pattern is applicable in various scenarios, including but not limited to: + +- **Task Queue Management**: When you need to manage a queue of tasks to be executed, ensuring tasks are executed in a specific order, on specific resources, or with certain priorities. + +- **Background Processing**: In applications requiring background jobs, such as processing user requests asynchronously, sending emails, or performing periodic maintenance tasks. + +- **Resource Allocation**: For managing shared resources, like database connections or thread pools, to ensure fair allocation among competing tasks. + +- **Real-time Systems**: In systems where tasks need to be executed at precise times or in response to specific events, such as in real-time simulations or monitoring systems. + +## Known uses +The Scheduler Design Pattern is used in various software applications and frameworks, including: + +- Operating systems for managing processes. +- Java: The Java `ScheduledExecutorService` class is an implementation of the Scheduler Design Pattern, allowing the scheduling of tasks at fixed rate or with fixed delay. + +## Consequences +The Scheduler Design Pattern offers several advantages: +- **Flexibility**: It allows for dynamic scheduling of tasks, making it adaptable to changing requirements. +- **Efficiency**: Tasks can be optimized for resource utilization, and parallel execution can be managed effectively. +- **Maintainability**: Separating scheduling logic from task execution simplifies maintenance and debugging. + +However, it also has some potential drawbacks: +- **Complexity**: Implementing a scheduler can be complex, especially in systems with intricate scheduling requirements. +- **Overhead**: Maintaining a scheduler adds some overhead to the system. + + +## Related patterns +The Scheduler Design Pattern is related to other design patterns, including: +- **Observer Pattern**: When tasks need to be scheduled in response to specific events or changes in the system, the Observer Pattern can be used in conjunction with the Scheduler Pattern. +- **Command Pattern**: Tasks to be executed by the scheduler can often be encapsulated using the Command Pattern, allowing for easy parameterization and queuing. + +## Credits +- [Wikipedia: Scheduling (computing)](https://en.wikipedia.org/wiki/Scheduling_(computing)) diff --git a/scheduler/etc/scheduler.png b/scheduler/etc/scheduler.png new file mode 100644 index 00000000000..1a0b36060d1 Binary files /dev/null and b/scheduler/etc/scheduler.png differ diff --git a/scheduler/etc/scheduler.puml b/scheduler/etc/scheduler.puml new file mode 100644 index 00000000000..c6b3357bda6 --- /dev/null +++ b/scheduler/etc/scheduler.puml @@ -0,0 +1,41 @@ +@startuml + +class Task { + -id: int + -totalExecutionTime: int + -priority: int + -- + +Task(id: int, totalExecutionTime: int, priority: int) + +Task(id: int, totalExecutionTime: int) + +getId(): int + +getTotalExecutionTime(): int + +getPriority(): int +} + +interface TaskScheduler { + +scheduleTask(task: Task): void + +update(int deltaTime): void +} + +class FirstComeFirstServedScheduler extends TaskScheduler {} +class PriorityScheduler extends TaskScheduler {} +class RoundRobinScheduler extends TaskScheduler {} +class ShortestRemainingTimeFirstScheduler extends TaskScheduler {} + +class Simulator { + -scheduler: TaskScheduler + -Map> tasks + -deltaTime: int + -simulateTime: int + -LinkedHashMap taskCompletedOrder + -elapsedTime: int + -- + +Simulator(scheduler: TaskScheduler, tasks: Map>, deltaTime: int, simulateTime: int) + +simulate(): LinkedHashMap +} + +Task -- TaskScheduler : "1..*" +TaskScheduler -- Simulator : "1" +Simulator ..> Task : "1..*" + +@enduml diff --git a/scheduler/pom.xml b/scheduler/pom.xml new file mode 100644 index 00000000000..744f36ddc08 --- /dev/null +++ b/scheduler/pom.xml @@ -0,0 +1,28 @@ + + + 4.0.0 + + com.iluwatar + java-design-patterns + 1.26.0-SNAPSHOT + + + scheduler + + + 17 + 17 + UTF-8 + + + + org.junit.jupiter + junit-jupiter-api + 5.9.2 + test + + + + diff --git a/scheduler/src/main/java/com/iluwatar/scheduler/FirstComeFirstServedScheduler.java b/scheduler/src/main/java/com/iluwatar/scheduler/FirstComeFirstServedScheduler.java new file mode 100644 index 00000000000..b7a1d9a285d --- /dev/null +++ b/scheduler/src/main/java/com/iluwatar/scheduler/FirstComeFirstServedScheduler.java @@ -0,0 +1,35 @@ +package com.iluwatar.scheduler; + +import java.beans.PropertyChangeEvent; +import java.beans.PropertyChangeListener; +import java.util.LinkedList; +import java.util.Queue; + +public class FirstComeFirstServedScheduler implements TaskScheduler, PropertyChangeListener { + private final Queue taskQueue = new LinkedList<>(); + + @Override + public void scheduleTask(Task task) { + task.getSupport().addPropertyChangeListener(this); + taskQueue.add(task); + } + + @Override + public void update(int deltaTime) { + Task task = taskQueue.peek(); + if (task == null) return; + task.execute(deltaTime); + } + + @Override + public void propertyChange(PropertyChangeEvent evt) { + if (Task.COMPLETE_PROPERTY.equals(evt.getPropertyName())) { + onTaskComplete(evt); + } + } + + private void onTaskComplete(PropertyChangeEvent evt) { + Task task = (Task) evt.getSource(); + taskQueue.remove(task); + } +} diff --git a/scheduler/src/main/java/com/iluwatar/scheduler/PriorityScheduler.java b/scheduler/src/main/java/com/iluwatar/scheduler/PriorityScheduler.java new file mode 100644 index 00000000000..6d084350b20 --- /dev/null +++ b/scheduler/src/main/java/com/iluwatar/scheduler/PriorityScheduler.java @@ -0,0 +1,41 @@ +package com.iluwatar.scheduler; + +import java.beans.PropertyChangeEvent; +import java.beans.PropertyChangeListener; +import java.util.PriorityQueue; +import java.util.Queue; + +public class PriorityScheduler implements TaskScheduler, PropertyChangeListener { + private final Queue taskQueue = + new PriorityQueue<>( + (task1, task2) -> { + if (task2.getPriority() != task1.getPriority()) + return task2.getPriority() - task1.getPriority(); + return task1.getId() - task2.getId(); // lower id (earlier task) has higher priority + }); + + @Override + public void scheduleTask(Task task) { + task.getSupport().addPropertyChangeListener(this); + taskQueue.add(task); + } + + @Override + public void update(int deltaTime) { + Task task = taskQueue.peek(); + if (task == null) return; + task.execute(deltaTime); + } + + @Override + public void propertyChange(PropertyChangeEvent evt) { + if (Task.COMPLETE_PROPERTY.equals(evt.getPropertyName())) { + onTaskComplete(evt); + } + } + + private void onTaskComplete(PropertyChangeEvent evt) { + Task task = (Task) evt.getSource(); + taskQueue.remove(task); + } +} diff --git a/scheduler/src/main/java/com/iluwatar/scheduler/RoundRobinScheduler.java b/scheduler/src/main/java/com/iluwatar/scheduler/RoundRobinScheduler.java new file mode 100644 index 00000000000..20cd819ca3a --- /dev/null +++ b/scheduler/src/main/java/com/iluwatar/scheduler/RoundRobinScheduler.java @@ -0,0 +1,21 @@ +package com.iluwatar.scheduler; + +import java.util.LinkedList; +import java.util.Queue; + +public class RoundRobinScheduler implements TaskScheduler { + private final Queue taskQueue = new LinkedList<>(); + + @Override + public void scheduleTask(Task task) { + taskQueue.add(task); + } + + @Override + public void update(int deltaTime) { + Task task = taskQueue.poll(); + if (task == null) return; + task.execute(deltaTime); + if (!task.isComplete()) taskQueue.add(task); + } +} diff --git a/scheduler/src/main/java/com/iluwatar/scheduler/ShortestRemainingTimeFirstScheduler.java b/scheduler/src/main/java/com/iluwatar/scheduler/ShortestRemainingTimeFirstScheduler.java new file mode 100644 index 00000000000..fdfd55280ad --- /dev/null +++ b/scheduler/src/main/java/com/iluwatar/scheduler/ShortestRemainingTimeFirstScheduler.java @@ -0,0 +1,28 @@ +package com.iluwatar.scheduler; + +import java.util.Comparator; +import java.util.PriorityQueue; +import java.util.Queue; + +public class ShortestRemainingTimeFirstScheduler implements TaskScheduler { + private final Queue taskQueue = + new PriorityQueue<>( + (task1, task2) -> { + if (task2.getRemainingTime() != task1.getRemainingTime()) + return task1.getRemainingTime() - task2.getRemainingTime(); + return task1.getId() - task2.getId(); // lower id (earlier task) has higher priority + }); + + @Override + public void scheduleTask(Task task) { + taskQueue.add(task); + } + + @Override + public void update(int deltaTime) { + Task task = taskQueue.poll(); + if (task == null) return; + task.execute(deltaTime); + if (!task.isComplete()) taskQueue.add(task); + } +} diff --git a/scheduler/src/main/java/com/iluwatar/scheduler/Simulator.java b/scheduler/src/main/java/com/iluwatar/scheduler/Simulator.java new file mode 100644 index 00000000000..87f6830950e --- /dev/null +++ b/scheduler/src/main/java/com/iluwatar/scheduler/Simulator.java @@ -0,0 +1,52 @@ +package com.iluwatar.scheduler; + +import java.beans.PropertyChangeEvent; +import java.beans.PropertyChangeListener; +import java.util.LinkedHashMap; +import java.util.List; +import java.util.Map; +import lombok.RequiredArgsConstructor; + +/** Simulate scheduler schedule tasks. */ +@RequiredArgsConstructor +public class Simulator implements PropertyChangeListener { + private final TaskScheduler scheduler; + + /** Map time to tasks that need to be scheduled at that time. */ + private final Map> tasks; + + private final int deltaTime; + private final int simulateTime; + private final LinkedHashMap taskCompletedOrder = new LinkedHashMap<>(); + private int elapsedTime = 0; + + public LinkedHashMap simulate() { + while (elapsedTime < simulateTime) { + if (tasks.containsKey(elapsedTime)) { + for (Task task : tasks.get(elapsedTime)) { + task.getSupport().addPropertyChangeListener(this); + scheduler.scheduleTask(task); + } + } + scheduler.update(deltaTime); + elapsedTime += deltaTime; + } + return taskCompletedOrder; + } + + @Override + public void propertyChange(PropertyChangeEvent evt) { + if (Task.COMPLETE_PROPERTY.equals(evt.getPropertyName())) { + onTaskComplete(evt); + } + } + + private void onTaskComplete(PropertyChangeEvent evt) { + Task task = (Task) evt.getSource(); + /* + elapsedTime is updated after task dispatch complete event to simulator, + so we need to add deltaTime + */ + taskCompletedOrder.put(task.getId(), elapsedTime + deltaTime); + } +} diff --git a/scheduler/src/main/java/com/iluwatar/scheduler/Task.java b/scheduler/src/main/java/com/iluwatar/scheduler/Task.java new file mode 100644 index 00000000000..fcf8e7d7305 --- /dev/null +++ b/scheduler/src/main/java/com/iluwatar/scheduler/Task.java @@ -0,0 +1,44 @@ +package com.iluwatar.scheduler; + +import java.beans.PropertyChangeSupport; +import lombok.Getter; +import lombok.RequiredArgsConstructor; + +@Getter +@RequiredArgsConstructor +public class Task { + public static final String COMPLETE_PROPERTY = "complete"; + private final PropertyChangeSupport support = new PropertyChangeSupport(this); + private final int id; + private final int totalExecutionTime; + + /** The priority of the task. The higher the number, the higher the priority. */ + private int priority = 0; + + private int elapsedTime = 0; + private boolean complete = false; + + public Task(int id, int totalExecutionTime, int priority) { + this.id = id; + this.totalExecutionTime = totalExecutionTime; + this.priority = priority; + } + + public void execute(int seconds) { + if (complete) throw new IllegalStateException("Task already completed"); + + elapsedTime += seconds; + + // Uncomment the following line to see the execution of tasks + // System.out.printf("%d, %d/%d\n", id, elapsedTime, totalExecutionTime); + + if (elapsedTime >= totalExecutionTime) { + complete = true; + support.firePropertyChange(COMPLETE_PROPERTY, false, true); + } + } + + public int getRemainingTime() { + return totalExecutionTime - elapsedTime; + } +} diff --git a/scheduler/src/main/java/com/iluwatar/scheduler/TaskScheduler.java b/scheduler/src/main/java/com/iluwatar/scheduler/TaskScheduler.java new file mode 100644 index 00000000000..f353d56fb42 --- /dev/null +++ b/scheduler/src/main/java/com/iluwatar/scheduler/TaskScheduler.java @@ -0,0 +1,10 @@ +package com.iluwatar.scheduler; + + +public interface TaskScheduler { + /** Add task to the scheduler */ + void scheduleTask(Task task); + + /** Update to execute scheduled tasks */ + void update(int deltaTime); +} diff --git a/scheduler/src/test/java/com/iluwatar/scheduler/FirstComeFirstServedSchedulerTest.java b/scheduler/src/test/java/com/iluwatar/scheduler/FirstComeFirstServedSchedulerTest.java new file mode 100644 index 00000000000..f291f8db4fe --- /dev/null +++ b/scheduler/src/test/java/com/iluwatar/scheduler/FirstComeFirstServedSchedulerTest.java @@ -0,0 +1,49 @@ +package com.iluwatar.scheduler; + +import static org.junit.jupiter.api.Assertions.*; + +import java.util.HashMap; +import java.util.LinkedHashMap; +import java.util.List; +import java.util.Map; +import org.junit.jupiter.api.Test; + +class FirstComeFirstServedSchedulerTest { + @Test + void testExecuteTasksFromBeginning() { + Map> tasks = new HashMap<>(); + tasks.put(0, List.of(new Task(1, 3), new Task(2, 2), new Task(3, 4))); + + Simulator simulator = new Simulator(new FirstComeFirstServedScheduler(), tasks, 1, 100); + + LinkedHashMap taskCompletedOrder = simulator.simulate(); + + assertEquals(3, taskCompletedOrder.size()); + assertIterableEquals(List.of(1, 2, 3), taskCompletedOrder.keySet()); + assertEquals(3, taskCompletedOrder.get(1)); + assertEquals(5, taskCompletedOrder.get(2)); + assertEquals(9, taskCompletedOrder.get(3)); + } + + @Test + void testExecuteTasks() { + Map> tasks = new HashMap<>(); + tasks.put(0, List.of(new Task(1, 3))); + tasks.put(1, List.of(new Task(2, 2))); + tasks.put(6, List.of(new Task(3, 4))); + tasks.put(7, List.of(new Task(4, 2))); + tasks.put(8, List.of(new Task(5, 1))); + + Simulator simulator = new Simulator(new FirstComeFirstServedScheduler(), tasks, 1, 100); + + LinkedHashMap taskCompletedOrder = simulator.simulate(); + + assertEquals(5, taskCompletedOrder.size()); + assertIterableEquals(List.of(1, 2, 3, 4, 5), taskCompletedOrder.keySet()); + assertEquals(3, taskCompletedOrder.get(1)); + assertEquals(5, taskCompletedOrder.get(2)); + assertEquals(10, taskCompletedOrder.get(3)); + assertEquals(12, taskCompletedOrder.get(4)); + assertEquals(13, taskCompletedOrder.get(5)); + } +} diff --git a/scheduler/src/test/java/com/iluwatar/scheduler/PrioritySchedulerTest.java b/scheduler/src/test/java/com/iluwatar/scheduler/PrioritySchedulerTest.java new file mode 100644 index 00000000000..a98ac820203 --- /dev/null +++ b/scheduler/src/test/java/com/iluwatar/scheduler/PrioritySchedulerTest.java @@ -0,0 +1,49 @@ +package com.iluwatar.scheduler; + +import static org.junit.jupiter.api.Assertions.*; + +import java.util.HashMap; +import java.util.LinkedHashMap; +import java.util.List; +import java.util.Map; +import org.junit.jupiter.api.Test; + +class PrioritySchedulerTest { + @Test + void testExecuteTasksFromBeginning() { + Map> tasks = new HashMap<>(); + tasks.put(0, List.of(new Task(1, 3, 0), new Task(2, 2, 2), new Task(3, 1, 1))); + + Simulator simulator = new Simulator(new PriorityScheduler(), tasks, 1, 10); + + LinkedHashMap taskCompletedOrder = simulator.simulate(); + + assertEquals(3, taskCompletedOrder.size()); + assertIterableEquals(List.of(2, 3, 1), taskCompletedOrder.keySet()); + assertEquals(2, taskCompletedOrder.get(2)); + assertEquals(3, taskCompletedOrder.get(3)); + assertEquals(6, taskCompletedOrder.get(1)); + } + + @Test + void testExecuteTasks() { + Map> tasks = new HashMap<>(); + tasks.put(0, List.of(new Task(1, 3, 1))); + tasks.put(1, List.of(new Task(2, 2, 0))); + tasks.put(2, List.of(new Task(3, 4, 5))); + tasks.put(7, List.of(new Task(4, 2, 4))); + tasks.put(8, List.of(new Task(5, 1, 2))); + + Simulator simulator = new Simulator(new PriorityScheduler(), tasks, 1, 100); + + LinkedHashMap taskCompletedOrder = simulator.simulate(); + + assertEquals(5, taskCompletedOrder.size()); + assertIterableEquals(List.of(3, 1, 4, 5, 2), taskCompletedOrder.keySet()); + assertEquals(6, taskCompletedOrder.get(3)); + assertEquals(7, taskCompletedOrder.get(1)); + assertEquals(9, taskCompletedOrder.get(4)); + assertEquals(10, taskCompletedOrder.get(5)); + assertEquals(12, taskCompletedOrder.get(2)); + } +} diff --git a/scheduler/src/test/java/com/iluwatar/scheduler/RoundRobinSchedulerTest.java b/scheduler/src/test/java/com/iluwatar/scheduler/RoundRobinSchedulerTest.java new file mode 100644 index 00000000000..3be43346a7c --- /dev/null +++ b/scheduler/src/test/java/com/iluwatar/scheduler/RoundRobinSchedulerTest.java @@ -0,0 +1,45 @@ +package com.iluwatar.scheduler; + +import static org.junit.jupiter.api.Assertions.*; + +import java.util.*; +import org.junit.jupiter.api.Test; + +class RoundRobinSchedulerTest { + @Test + void testExecuteTasksFromBeginning() { + Map> tasks = new HashMap<>(); + tasks.put(0, List.of(new Task(1, 3), new Task(2, 2), new Task(3, 4))); + + Simulator simulator = new Simulator(new RoundRobinScheduler(), tasks, 1, 10); + + LinkedHashMap taskCompletedOrder = simulator.simulate(); + assertEquals(3, taskCompletedOrder.size()); + assertIterableEquals(List.of(2, 1, 3), taskCompletedOrder.keySet()); + assertEquals(5, taskCompletedOrder.get(2)); + assertEquals(7, taskCompletedOrder.get(1)); + assertEquals(9, taskCompletedOrder.get(3)); + } + + @Test + void testExecuteTasks() { + Map> tasks = new HashMap<>(); + tasks.put(0, List.of(new Task(1, 3))); + tasks.put(1, List.of(new Task(2, 2))); + tasks.put(2, List.of(new Task(3, 4))); + tasks.put(7, List.of(new Task(4, 2))); + tasks.put(8, List.of(new Task(5, 1))); + + Simulator simulator = new Simulator(new RoundRobinScheduler(), tasks, 1, 100); + + LinkedHashMap taskCompletedOrder = simulator.simulate(); + + assertEquals(5, taskCompletedOrder.size()); + assertIterableEquals(List.of(1, 2, 3, 5, 4), taskCompletedOrder.keySet()); + assertEquals(4, taskCompletedOrder.get(1)); + assertEquals(6, taskCompletedOrder.get(2)); + assertEquals(10, taskCompletedOrder.get(3)); + assertEquals(11, taskCompletedOrder.get(5)); + assertEquals(12, taskCompletedOrder.get(4)); + } +} diff --git a/scheduler/src/test/java/com/iluwatar/scheduler/ShortestRemainingTimeFirstSchedulerTest.java b/scheduler/src/test/java/com/iluwatar/scheduler/ShortestRemainingTimeFirstSchedulerTest.java new file mode 100644 index 00000000000..e50a3acae4f --- /dev/null +++ b/scheduler/src/test/java/com/iluwatar/scheduler/ShortestRemainingTimeFirstSchedulerTest.java @@ -0,0 +1,45 @@ +package com.iluwatar.scheduler; + +import static org.junit.jupiter.api.Assertions.*; + +import java.util.HashMap; +import java.util.LinkedHashMap; +import java.util.List; +import java.util.Map; +import org.junit.jupiter.api.Test; + +class ShortestRemainingTimeFirstSchedulerTest { + @Test + void testExecuteTasksFromBeginning() { + Map> tasks = new HashMap<>(); + tasks.put(0, List.of(new Task(1, 3), new Task(2, 2), new Task(3, 4))); + + Simulator simulator = new Simulator(new ShortestRemainingTimeFirstScheduler(), tasks, 1, 10); + + LinkedHashMap taskCompletedOrder = simulator.simulate(); + assertEquals(3, taskCompletedOrder.size()); + assertIterableEquals(List.of(2, 1, 3), taskCompletedOrder.keySet()); + } + + @Test + void testExecuteTasks() { + Map> tasks = new HashMap<>(); + tasks.put(0, List.of(new Task(1, 3))); + tasks.put(1, List.of(new Task(2, 2))); + tasks.put(2, List.of(new Task(3, 4))); + tasks.put(7, List.of(new Task(4, 2))); + tasks.put(8, List.of(new Task(5, 1))); + + Simulator simulator = new Simulator(new ShortestRemainingTimeFirstScheduler(), tasks, 1, 100); + + LinkedHashMap taskCompletedOrder = simulator.simulate(); + + assertEquals(5, taskCompletedOrder.size()); + assertIterableEquals(List.of(1, 2, 3, 5, 4), taskCompletedOrder.keySet()); + assertEquals(3, taskCompletedOrder.get(1)); + assertEquals(5, taskCompletedOrder.get(2)); + assertEquals(9, taskCompletedOrder.get(3)); + assertEquals(10, taskCompletedOrder.get(5)); + assertEquals(12, taskCompletedOrder.get(4)); + } +}