GangScheduling.java

packagecom.thealgorithms.scheduling;

importjava.util.ArrayList;
importjava.util.HashMap;
importjava.util.List;
importjava.util.Map;

/**
 * GangScheduling groups related tasks (gangs) to run simultaneously on multiple processors.
 * All tasks in a gang are executed together or not at all.
 *
 * Use Case: Parallel computing environments where multiple threads of a program
 * need to run concurrently for optimal performance.
 *
 * @author Hardvan
 */
publicfinalclassGangScheduling {

staticclassGang {
Stringname;
List<String> tasks;

Gang(Stringname) {
this.name = name;
this.tasks = newArrayList<>();
 }

voidaddTask(Stringtask) {
tasks.add(task);
 }

List<String> getTasks() {
returntasks;
 }
 }

privatefinalMap<String, Gang> gangs;

publicGangScheduling() {
gangs = newHashMap<>();
 }

publicvoidaddGang(StringgangName) {
gangs.putIfAbsent(gangName, newGang(gangName));
 }

publicvoidaddTaskToGang(StringgangName, Stringtask) {
Ganggang = gangs.get(gangName);
if (gang != null) {
gang.addTask(task);
 }
 }

publicMap<String, List<String>> getGangSchedules() {
Map<String, List<String>> schedules = newHashMap<>();
for (Ganggang : gangs.values()) {
schedules.put(gang.name, gang.getTasks());
 }
returnschedules;
 }
}