Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)

Custom Preemptive RTOS Kernel for ARM Cortex‑M4 (STM32F401VE), optimized for smart parking management systems

OS simulator showcasing scheduling algorithms, memory management, and IPC via a mini-kernel with diverse process scheduling and allocation techniques

This project uses Python to implement and simulate 4 process scheduling algorithms: FIFO, Preemptive SJF, Round Robin, and Lottery Scheduler. The script will read process data from an input file, execute the scheduling algorithms, calculate turnaround, waiting, and response times, and output the results to a file.

A Java implementation of First-Come, First-Served (FCFS) and Preemptive Shortest Job First (SJF) Scheduling Algorithms using linked lists. This project simulates CPU process scheduling, calculates waiting & turnaround times, and demonstrates dynamic job execution.

A comprehensive operating system simulation that demonstrates scheduling algorithms, memory management techniques, and inter-process communication where it simulates a mini-kernel implementing various process scheduling algorithms and memory allocation techniques

Preemptive multithreaded kernel for the Intel 8086, featuring time slicing, context switching, semaphores, and low-level interrupt-driven event handling.

A simple and rudimentary program written in C++ that simulates the operation of a CPU task scheduler using three distinct methodologies - namely FIFO, SJF and Priority scheduling algorithms.