About

ALExSIM (USAS)

Thank you for coming and showing interest on using this tool.

ALExSIM (USAS) is an algorithm learning and experimenting simulator suite, which is targeted for anyone who are interested to study, or currently studying operating system subject/course. USAS or Uniprocessor Scheduling Algorithm Simulation is a package offered in ALExSIM, which allows the user to try and experiment with algorithms that have been used or studied for uniprocessor scheduling used in various operating systems.

ALExSI (USAS) is a desktop application and requires Java Runtime Environment or JRE to run. (better if JRE 1.8 or above). 

Currently ALExSIM (USAS) allows users to experiment with several algorithms including First-Come-First-Serve (FCFS), Round-Robin (RR), Shortest-Job-First (SJF) and High-Priority-Job-First (HPF). 

Features provided in ALExSIM (USAS) includes :

1. Simulating and comparing several scheduling algorithms.
• Allow user to run simulation on several algorithms at once and compare the results between the algorithms
2. Generating and test the algorithms using random data.
• Easy for user to prepare and study many cases/scenarios by just clicking buttons (instead of manually entering/typing data)
3. Generating the graphical Gantt chart (using the JFreeChart Java library).
• Simulation results can be visualized and easier to study or compare
4. Exporting generated results data into a CSV-formatted file.
• The simulation results can be exported to external file, and then easy to be imported into a spreadsheet application (e.g. MS-Excel or OpenOffice Calc) 
5. Importing prepared simulation data from a CSV-formatted file.
• Easy to automate and repeat the testing or simulation using the same data without manually entering / typing the required input data.

Below are some screenshots from the application:

The initial interface

Generating the random process data

Running the simulation

Comparing the Gantt charts from the results