Loads a pre-set "Starvation Scenario" (1 Long Job vs. 5 Short Jobs). Use this to instantly visualize how WDS prevents the long job from being blocked forever.
Enter your own Arrival Times, Burst Times, and Priorities. Use this mode to test specific homework problems or stress-test the algorithm.
Why was this built? Standard operating system schedulers like FCFS and SJF are rigid. They optimize for either speed or fairness, but never both.
The goal of this project is to demonstrate a Hybrid Heuristic Algorithm (WDS) that uses a weighted formula to dynamically adapt its behavior. It proves that we can achieve high throughput (Speed) without sacrificing user experience (Fairness) in Cloud and 5G environments.
Instead of a rigid rule, WDS calculates a real-time score for every waiting process. The highest score wins.
| Component | Why we need it? (The Logic) |
|---|---|
| W_wait (Aging) | Ensures that if a task waits for a long time, its score grows massive, forcing the CPU to pick it. (Solves Starvation). |
| W_burst (Efficiency) | Gives a bonus to short jobs. This clears the queue quickly and lowers average system latency. |
| W_prio (Urgency) | Allows critical tasks (e.g., "System Crash Alert") to override the math and run immediately. |
If you are looking to find flaws or verify stability, try these specific edge cases in Custom Mode:
FCFS: Causes "Convoy Effect" (UI freezes behind background tasks).
SJF: Causes "Starvation" (Long videos never process if short texts keep coming).
Hybrid Approach: Acts like SJF when the system is busy to clear traffic, but switches to Fairness mode for old tasks.
Cooperative: Uses "Yield Points" to allow high-priority interruptions.