This project is a Java applet which runs a simulation of the several process scheduling algorithms. Currently, the algorithms supported are round robin, first-come/first-served, shortest job first, and a short job first approximation.
The applet allows the user to create processes with fairly general properties. Total running time, cpu burst time, I/O burst times, and interarrival times can be chosen from constant, uniform, or exponential distributions.
The applet keeps track of the entire history of each process and allows for logging of detailed or summary information. Graphs can also be produced and logged. The log file produced is in HTML format and can be viewed directly from a browser.
This applet is in the preliminary stages of development. A picture of the applet screen appears above.
You can view a sample log file here.