Several cpu-scheduling algorithms, Operating System

Q. Several CPU-scheduling algorithms are parameterized for instance the RR algorithm requires a parameter to indicate the time slice. Multilevel response queues require parameters to define the number of queues the scheduling algorithms for every queue the criteria used to move processes between queues and so on. These algorithms are consequently really sets of algorithms for instance the set of RR algorithms for all time slices and so on. One set of algorithms may comprise another (for instance the FCFS algorithm is the RR algorithm with an infinite time quantum).What (if any) relation embraces between the following pairs of sets of algorithms?

1 Priority and SJF

2 Multilevel feedback queues and FCFS

3 Priority and FCFS

4 RR and SJF

Answer:

1 The shortest job has the highest priority

2 The lowest level of MLFQ is FCFS.

3 FCFS provides the highest priority to the job having been in existence the longest.

4 None.

Posted Date: 7/27/2013 2:43:06 AM | Location : United States







Related Discussions:- Several cpu-scheduling algorithms, Assignment Help, Ask Question on Several cpu-scheduling algorithms, Get Answer, Expert's Help, Several cpu-scheduling algorithms Discussions

Write discussion on Several cpu-scheduling algorithms
Your posts are moderated
Related Questions
Acyclic Graph Directories In this kind of directory structure the shared directories or files can exist in the file system in two or more places at once. A tree structure excl

my Operating System is windows trust but when the windows start say its windows xp. help pleaes

COMBINED ULT/KLT APPROACHES Idea is to merge the best of both approaches Solaris is an illustration of an OS that combines both ULT and KLT  Thread creation complete i

expalin about the design issues of network operating system

EXAMPLE FOR SEGMENTATION Consider an instance as given in the table and we have five segments numbered from 0 through 4 the segment is stock in the physical memory as shown. Th

Explain the basic method of paging method. Physical memory is divided into the fixed-sized blocks called frames. Logical memory is as well divided into blocks of the same size

Q. Explain the differences in terms of cost between the three storage types nonvolatile, volatile and stable. Answer: Volatile storage refers to main as well as cache memory an

Explain the Network protocols There are a wide variety of network protocols to choose from traditionally client - server developers were required to choose a communications pro

Briefly discuss on real-time scheduling? It is divided into two types.  Hard real-time systems are needed to complete a critical task within a guaranteed amount of time. T

Q. Is disk scheduling except FCFS scheduling useful in a single-user environment? describe your answer. Answer: In a single-user environment the I/O queue typically is empty.