Mohamed Amine Hajji / Projects

Multitasking Scheduling Algorithm Simulation System

A C/Raylib desktop app that animates 8 classic CPU scheduling algorithms in a live Gantt chart — with each algorithm loaded at runtime as a dynamic plugin.

GitHub

MSASS simulates and animates 8 classic CPU scheduling algorithms — FIFO, Round Robin, SJF, SRT, preemptive/non-preemptive Priority, and two Multilevel Queue variants — against a configurable random workload, with a real-time animated Gantt chart built on Raylib/Raygui. Its most distinctive piece of engineering is a plugin-style architecture: each algorithm compiles into its own shared library and loads at runtime via dlopen/dlsym, so the algorithm menu grows with zero core-code changes — everything underneath, from the ready-queue to the binary-heap priority queue, is hand-implemented in C with no container library.

Highlights

• 8 scheduling algorithms sharing one interface, each compiled to a .so and dynamically loaded via dlopen/dlsym — new algorithms need zero core changes.
• Hand-implemented data structures: linked-list queues, a binary max-heap priority queue, and a linked-list execution trace replayed frame by frame.
• Animated, not static — the Gantt chart plays back the scheduling trace over time via a UI-adjustable speed slider rather than a finished chart.

Stack: C, Raylib, CMake, Linux