Scheduling Criteria

⏪Previous                                                          Next⏩

Different CPU scheduling algorithms has different properties. Selection decision depends on the properties of various algorithms.
There are many criteria need to be consider for comparing CPU scheduling algorithms.
This characteristic is used to determine the best algorithm. The criteria are as following:

1. CPU Utilization

• We want to keep the CPU as busy as possible. It may range from 0 to 100%. In real time system, it suits range from 40% (for a lightly loaded system ) to 90% ( for heavily loaded system ).

2. Throughput

• If the CPU is busy executing processes, then work is being done. One measure of work is the number of processes completed per time unit for throughput. For time processes, these may be a one process for one minute. For shorter transactions, throughput might be 10 processes per minute.

3. Turnaround Time

• From the submission time of a process to its completion time is turnaround time. It is the sum of total time period spends waiting to get into memory, waiting in the ready queue, executing in the CPU and doing input/output operations.

4. Waiting Time

• The CPU scheduling algorithm does not affect the amount of the time during which process execute or does input/output. It affects only the amount of time that a process spends waiting in the ready queue. Waiting time is the sum of period spends waiting in the ready queue.

5. Response Time

• In an interactive system, a process can produce some output early and can continue, computing new results. Previous results are being displayed the user. Thus another measure is the time from the submission to the request until the first response is produced. It is called Response time. The turnaround time is normally limited by speed of output device

⏪Previous                                                          Next⏩

1. What is an Operating System ?
2. Discuss the structure off OS ?
3. Explain type of OS?
4. Explain Function of OS?
5. Explain OS Services ?
6. What do mean by system call ?List different type ofsystem call available ?

1. what is process ? and Characteristics ?
2. What is different process state? explain the same in details?
3. write short note on user level and kernal level threads?
4. explain what is thread and its type ?
5. explain scheduler ? (short term,medium term,and long term)
6. state and explain scheduling criteria ?
7. Explain scheduling algorithm ? [ FCFS,SJF,PRIORITY,ROUND ROBINE.]    

1. What is process synchronization ? explain critical section problem and race condition ?
2. what is Race Condition ?
3. what is critical section problem?
4. explain classical problem of synchronization?
5. explain bounded - buffer problem?
6. explain reader - writer problem ?
7. explain Dining Philosophers Problem ?
8. explain semaphores ? its type ?

1.  What is deadlock ?
2. What are the 4 condition to produce deadlock ?
3. explain methods of handling deadlock ?
4. explain in detail deadlock prevention ?
5. write short note on deadlock avoidance ?
6. explain deadlock detection ? 
7. explain Banker algorithm with example ? 

1. What are memory management ?
2. what is contiguous memory allocation and non - contiguous memory allocation ?
3. explain concept of paging with neat diagram?
4. differentiate contiguous and non - contiguous memory allocation ?
5. explain in details various partitioning memory management?
6. explain the concept of Segmentation ?
7. what is Thrashing explain in details ?

1. explain virtual memory concept in details ? with advantages and disadvantages ?
2. explain page replacement algorithm ?
3. explain LRU , Optimal ,FIFO.