0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
Compute the average waiting time and average turnaround time for each what scheduling algorithms and determine which one gives the best results. a.FCFS b.SJN c.SRT d.round robin?
c program for shortest remaining time scheduling algo
What do you mean by scheduling algorithm in OS?
its the algorithm that tells the os what to process next.goes according to :shortest job firstshortest remaining time firstround robin- first in first out system
What are the disadvantages of FCFS scheduling?
in fcfs scheduling there is a shortcoming that is if any rocess of maximum brust time is first ome. and after that many short burst time process come. then smaller pocesses have to wait for a long time untill the max brust time process complete their execution. in case of shortest job first it applied the method to give shortest t\burst time job to processer first.
What is the ability to perform a movement in one direction in the shortest period of time?
speed
What is the ability to perform a task or move from one point to another in the shortest possible time?
speed
What would perform math calculations in the shortest amount of time?
It might help if "the following" actually followed!
How useful were the experiments that the Nazis perform on Jews?
Depends on what you call 'useful'. If it is useful to learn how to kill hundreds of people in the shortest amount of time, and to learn how to castrate hundreds of men in the shortest time, then, yeah, they were useful.
What relation between priority and shortest job first?
Priority scheduling is a CPU scheduling algorithm where each process has a priority associated with it. Shortest job first (SJF) is a scheduling algorithm where the process with the shortest burst time is scheduled first. The relationship between the two is that a priority scheduling algorithm can be used where the priority of a process is determined by its burst time, effectively making it similar to a shortest job first algorithm.
What is time complexity of assembly line scheduling?
time complexity for Assembly line scheduling is linear.i.e O(n)
What is disk scheduling?
>File systems must be accessed in an efficient manner >As a computer deals with multiple processors over a period of time, a list of request to access the disk build up >The operating system uses a disk scheduling technique to determine which request to satisfy. Disk scheduling techniques: (1)First-come, First-served (2)Shortest-seek-time-first(SSTF) (3)scan 4 c-scan 5
Dynamic job shop scheduling?
dynamic job shop scheduling is the scheduling of the machine it can processes different jobs at time. it switches from one job to another job. in real time process jobs are executed based on the time.
Is it possible to implement more than one CPU scheduling Algorithms on one OS?
Yes. For Example, many operating systems have two schedulers, one for high priority\realtime processes such as gui elements and another for low priority\background processes. The high priority\gui scheduler will usually use a scheme such as SRTF (shortest remaining time first) or SJF (shortest job first), while the low priority\background scheduler may use a scheme such as RR (round robin).
