Differences

This shows you the differences between two versions of the page.

--- faq [2021/03/12 14:26] – jxu
+++ faq [2021/03/16 15:10] – jxu
@@ Line 148: / Line 148: @@
 ...”
+**Question 18**: I am not quite sure what we have to code in java, is it the 6 scheduling
+algorithms from section 5.3? If yes then what should be the processes, arrival time and
+their priority process? There is no data set available on the assignment 2 pdf.
+**Answer to Question 18**: You need to not only carefully read and study the Assignment 2 specification in the 2011N_W21 Assignment_2.pdf file on eClass, but also need to carefully read and study all of the following which are posted on eClass:
+(1) The copy of Sections 5.1, 5.2, 5.3, and 5.8.1, of Chapter 5 of Silberschatz, Galvin, and
+Gagne’s book above can be found in the 2011N W21 eClass file
+Operating_System_Concepts_CPU_Scheduling.pdf;
+(2) The example provided in the file “2011N_W21_Assignment_2_Example.pdf”
+which is posted on 2011N W21 eClass.
+(3) The Wednesday March 3 Lecture 14 video recording which explains the 2011N W21 Assignment 2 Example posted on eClass.
+**Question 19**: We are having extreme difficulties
+implementing the preemptive algorithms. Implementing these algorithms to work in parallel with the IOScheduler FCFS
+algorithm is a greater challenge than we have the tools to solve.
+**Answer to Question 19**: You need to carefully read and study all the material listed
+in the Answer to Question 18 above. As shown in the Wednesday March 3 Lecture 14 video recording which explains the 2011N W21 Assignment 2 Example posted on eClass, the performance of each algorithm for any workload, that is, the Average Waiting Time, and the Average Turnaround Time, can all be calculated with pen and paper step-by-step.
+Note that, ANYTHING THAT CAN BE CALCULATED WITH PEN AND PAPER STEP-BY-STEP, CAN ALSO BE DONE BY A COMPUTER PROGRAM WRITTEN IN JAVA STEP-BY-STEP (in the same way that the Average Waiting Time, and the Average Turnaround Time was calculated with pen and paper step-by-step in the Wednesday March 3 Lecture 14). In other words,
+there is no need to get anything "to work in parallel", and there is no need to use any
+parallel programming tools such as "threads".