Java Simulation Of Cpu Scheduling Algorithm

Urgent!!

I need java simulation to calculate turnaround time for different CPU scheduling algorithms.

First come first serve ( non-preempt)

Round robin( with quantam of 2 and 5)

Shortest job first( non-preempt and preempt)

Non-preempt-longest job first

Fair Pre-­‐emption–
Job priority is dynamic and equals time since job arrived minus time spent on CPU already

The idea is that assuming 1 tick is the minimum amount of time on cpu,
the probabiliy of a job arriving between any two ticks is 0.2 or 20%.

The amount of ticks a job requires is between 1 and 15(inclusive).

Need totally 100 jobs.

The output of this is to simply output every job’s turnaround time and calculate average time.

Try do as much as possible, i got only 18 more hours to hand in.

Price for doing this is negotiable.