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 03:51] – jxu | faq [2021/03/17 04:34] – jxu | ||
---|---|---|---|
Line 204: | Line 204: | ||
- 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. | ||
- Then try using some of the Preemptive CPU Scheduling Algorithms C3, C5, C6. (In this case, whenever a process which is currently executing on the CPU is preempted by a process with higher priority, that preempted process which has lower priority is put back into the ready queue.) | - Then try using some of the Preemptive CPU Scheduling Algorithms C3, C5, C6. (In this case, whenever a process which is currently executing on the CPU is preempted by a process with higher priority, that preempted process which has lower priority is put back into the ready queue.) | ||
- | - Then try to allow each process to perform | + | - Then try to allow each process to make one single |
- Then try to allow each process to perform one single I/O on one single I/O device while for CPU Scheduling use one of the Preemptive CPU Scheduling Algorithms C3, C5, C6 … | - Then try to allow each process to perform one single I/O on one single I/O device while for CPU Scheduling use one of the Preemptive CPU Scheduling Algorithms C3, C5, C6 … | ||
(Add additional features one-by-one in this gradualist fashion, and just try to add as many features as possible before the assignment deadline.) | (Add additional features one-by-one in this gradualist fashion, and just try to add as many features as possible before the assignment deadline.) | ||
- | | + | Write the code so that the program allows the user to enter as input parameters the following: |
+ | - the number of processes; | ||
+ | - the Arrival Time of each process; | ||
+ | - the Priority of each process; | ||
+ | - the Sequence of CPU Computation Time and I/O Time Requirements for each process; | ||
+ | |||
+ | Then try to write code which computes the Average Waiting Times and Average Turnaround Times for | ||
+ | any set of input parameters above. |
faq.txt · Last modified: 2021/04/26 22:20 by jxu