Multi Level Process Scheduling (revision 141014-r01KI)

Return to Lab 05

  1. Download the files needed today:
  2. Download the simulation file:
  3. Run Simulation Program:
    java -jar cpu.jar

  4. Open File -> Open Data Source -> Choose File jobQueue.dat
  5. Open Option -> Choose Show hidden
  6. Choose Process Scheduling Algorithm by clicking Options -> Algorithm -> Choose appropriate Algorithm
  7. For Shortest Job First and Priority Algorithm you can select Preemptive or not by clicking Options -> Preemption
  8. Do the Simulation by clicking Check Box which is in the bottom mid of the simulation window.
  9. Your task is to do the simulation for these algorithms:
    1. Students with even-ending student ID do FCFS Algorithm while students with odd-ending student ID do Round Robin Algorithm.
    2. Students with the last student ID digit less than 5 (means 5 is NOT included) do simulation with Normal Priority, while students with the last student ID digit more than or equal to 5 (means 5 is included) do simulation with Preemptive Algorithm.
    3. Student with the last digit student ID 0,1,3,4,7 do simulation with Normal Shortest Job First while student with the last digit 2,5,6,8,9 do simulation with Preemptive Shortest Job First.
  10. Each student will do three simulations above and write the result on WHAT-IS-THIS.txt file.
  11. In the end of each simulation, add your explanation about the algorithm that you used in the text file.
  12. This is the end of Multi Level Process Scheduling Task.

Return to Lab 05
Return to Wiki