CPU scheduling algorithms are used by operating systems to allocate CPU time to different processes. These algorithms are designed to ensure that processes are executed in a fair and efficient manner, while also optimizing the use of system resources. There are several Criteria that can be used to evaluate the effectiveness of CPU scheduling algorithms, and these criteria are important for determining which algorithm is best suited for a particular system.

CPU Utilization: This is a measure of how much time the CPU is being used to execute processes. A good scheduling algorithm should ensure that the CPU is utilized as much as possible, while also avoiding situations where the CPU is idle.

Throughput: This is a measure of how many processes can be executed in a given period of time. A good scheduling algorithm should maximize throughput by ensuring that as many processes as possible are executed during a given period of time.

Turnaround Time: This is a measure of the time it takes for a process to complete, from the time it is submitted to the time it is finished. A good scheduling algorithm should minimize turnaround time by ensuring that processes are executed in a timely and efficient manner.

Waiting Time: This is a measure of the time that a process spends waiting in the ready queue before it can be executed. A good scheduling algorithm should minimize waiting time by ensuring that processes are executed as soon as possible.

Response Time: This is a measure of the time it takes for a process to respond to a user request. A good scheduling algorithm should minimize response time by ensuring that processes are executed quickly and efficiently.

Its Need

We need CPU scheduling algorithms because they play a critical role in ensuring that operating systems can efficiently manage multiple processes and applications. Without these algorithms, it would be difficult to ensure that processes are executed in a fair and efficient manner, which could lead to poor system performance and reduced productivity. By using effective CPU scheduling algorithms, operating systems can ensure that resources are utilized in the most optimal way possible, resulting in better system performance and improved user experience.


OS-2022

Q-1.

(a) Write are the functions of operating systems? write a note on multi programmed operating systems ?

(b) Distinguish between client server and peer to peer model of distributed systems .

Q-2.

(a) With a Neat Sketch, Describe the services that an Operating System provides to users, processes and other systems.

(b) What is meant by Storage Structure? Discuss Storage Hierarchy.

(c) Write the Advantages and Disadvantages of using the same system call interface for manipulating both Files and Devices.

Q-3.

(a) What are the criteria for evaluating the CPU scheduling algorithms? Why do we need it?

(b) Define process. Explain various steps involved in change of a process state with process state neat transition diagram.

Q-4.

(a) What is synchronization? Explain how semaphores can be used to deal with n-process critical problem.

(b) Define a thread. Give the benefits of multithreading. What resources are used when a thread is created?

Q-5.

(a) How dose deadlock avoidance differ from deadlock prevention? Write about deadlock avoidance algorithm in detail.

(b) Different between external fragmentation and internal fragmentation. How to solve the fragmentation using paging?

Q-6.

(a) What is the purpose of paging the page table? Consider the following page reference string 1,2,3,4,5,1,2,3,4,5 for a memory with three frames. How many page faults would LRU and FIFO replacement algorithm?

(b) What are the disadvantages of single contiguous memory allocation? Explain.

Q-7.

(a) Briefly explain about single-level, two-level and three Structured directories.

(b) What is disk scheduling? Explain the C-SCAN scheduling by giving an example.

Q-8.

(a) Interrupt and spooling.

(b) UNIX file system.

(c) Program and system threats.

JOIN OUR NEWSLETTER
And get notified everytime we publish a new blog post.