faq
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
| faq [2021/03/17 13:47] – jxu | faq [2021/03/17 13:51] – jxu | ||
|---|---|---|---|
| Line 194: | Line 194: | ||
| Write the code so that the program allows the user to enter as input parameters the following: | Write the code so that the program allows the user to enter as input parameters the following: | ||
| - the number of processes; | - the number of processes; | ||
| - | - (the Arrival Time of each process; | + | - the Arrival Time of each process; |
| - | - (the CPU Computation Time for each process; | + | - the CPU Computation Time for each process; |
| Then try to write code which computes the Average Waiting Times and Average Turnaround Times for any set of user input parameters above. | Then try to write code which computes the Average Waiting Times and Average Turnaround Times for any set of user input parameters above. | ||
| Once you have got the code for the very basic and simple Java program described above working, then try to gradually add additional features, in order of difficulty, to the code. For example: | Once you have got the code for the very basic and simple Java program described above working, then try to gradually add additional features, in order of difficulty, to the code. For example: | ||
| - | - First try allowing | + | - First try to allow processes to have different CPU Computation Times. |
| - Then try using C2. Nonpreemptive Shortest-Job-First (SJF) Scheduling. (The only difference in this case, is that, whenever the CPU becomes available, the Nonpremptive SJF CPU Scheduler always removes from the ready queue the process which has the smallest CPU Computation Time among all processes in the ready queue, and allows that process to start executing on the CPU. | - Then try using C2. Nonpreemptive Shortest-Job-First (SJF) Scheduling. (The only difference in this case, is that, whenever the CPU becomes available, the Nonpremptive SJF CPU Scheduler always removes from the ready queue the process which has the smallest CPU Computation Time among all processes in the ready queue, and allows that process to start executing on the CPU. | ||
| - Then try using C4. Nonpreemptive Priority Scheduling. (The only difference in this case, is that, whenever the CPU becomes available, the Nonpremptive Priority CPU Scheduler always removes from the ready queue the process which has the smallest Priority Number among all processes in the ready queue, and allows that process to start executing on the CPU. | - Then try using C4. Nonpreemptive Priority Scheduling. (The only difference in this case, is that, whenever the CPU becomes available, the Nonpremptive Priority CPU Scheduler always removes from the ready queue the process which has the smallest Priority Number among all processes in the ready queue, and allows that process to start executing on the CPU. | ||
faq.txt · Last modified: 2021/04/26 22:20 by jxu