Several cpu-scheduling algorithms, Operating System

Assignment Help:

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.


Related Discussions:- Several cpu-scheduling algorithms

What effect would updating a few byte on the one page, Q. What is the effe...

Q. What is the effect of permitting two entries in a page table to point to the same page frame in memory? Describe how this effect could be used to decrease the amount of time ne

Distinguish among a streams driver and a streams module, Q. Distinguish amo...

Q. Distinguish among a STREAMS driver and a STREAMS module? Answer: The STREAMS driver controls the physical device that could be involved in a STREAMS operation. The STREAMS

Briefly explain about file system implementation, Briefly explain about fil...

Briefly explain about file system implementation? Several on-disk and in-memory structures are used to execute a file system. On disk, the file system may have information abou

Explain the types of system calls, Explain the Types of System Calls Th...

Explain the Types of System Calls The major types of system calls are like this: a. Process Control: These types of system calls are employed to control the processes.

Explain banker''s algorithm, Banker's Algorithm In this analogy ...

Banker's Algorithm In this analogy Customers ≡ processes Units ≡ resources, say, tape drive Ba

Android, Which android version is available till now

Which android version is available till now

What is turnaround time, What is turnaround time? Turnaround time is th...

What is turnaround time? Turnaround time is the interval from the time of submission to the time of completion of a process. It is the sum of the periods exhausted waiting to g

Cosled loop, What are the two principles in Hungarian method?

What are the two principles in Hungarian method?

Benefits of dynamic linkage of libraries, Q. What are three benefits of dyn...

Q. What are three benefits of dynamic (shared) linkage of libraries compared to static linkage? What are two situations where static linkage is preferable? Answer: The

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd