CPU Scheduling Solver (CSS)

CPU Scheduling Solver (CSS) is an android application target the students to help them solving any CPU scheduling problem using the existing scheduling algorithms:

• First Come First Served (FCFS).

• non-preemptive Shortest Job First (SJF).

• preemptive SJF.

• Round Robin (RR).

The main features that will be provided by our CSS application are as follow:

1. CSS solves the scheduling problems using the most famous four CPU scheduling algorithms which are: FCFS, SJF (preemptive and non-preemptive), and RR.

2. CSS computes the evaluation metrices Average Waiting Time (AWT) and Average Turnaround Time (ATT) for any solving algorithm. While compute Waiting Time (WT), Turnaround Time (TT), and Completion Time (CT) for any scheduled process.

3. CSS provides a Gantt Chart with any solving algorithm of the scheduled processes or tasks.

4. CSS have no limits in the number of scheduled processes, arrival time, or burst time assigned to the scheduled processes.

5. CSS available all the time and does not require internet connection.

For more details, please see the paper “CSS: An Android Application for Solving the CPU Process Scheduling Problems” which have been accepted for publication in The Third International Conference on Computer and Information Sciences 2021 (ICCIS 2021) that is the joint effort of Jouf University College of Computer and information sciences and IEEE (Saudi Arabia section).