OPERATING SYSTEM PART-A UNIT-1 INTRODUCTION TO OPERATING SYSTEMS, SYSTEM STRUCTURES

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "OPERATING SYSTEM PART-A UNIT-1 INTRODUCTION TO OPERATING SYSTEMS, SYSTEM STRUCTURES"

Transcription

1 OPERATING SYSTEM PART-A UNIT-1 INTRODUCTION TO OPERATING SYSTEMS, SYSTEM STRUCTURES 1. Define an operating system. Discuss its role with user and system viewpoints 2. Give the features of symmetric and asymmetric multiprocessing systems. (07Marks,Dec09,Dec08,June09) (04Marks,June09,Dec09) 3. Briefly explain the common classes of services provided by the various operating systems for helping the user and for ensuring the efficient operation of the systems for helping the user and for ensuring the efficient operation of the system. 4. List out the different services that an operating system provides. Explain. (10Marks,Dec09) (06Marks,Dec08) 5. Explain the concept of virtual machines. Bring out its advantages. (05Marks,Dec08) 6. Differentiate between a trap and an interrupt. (02Marks,Dec08) 7. Discuss the operating system function i) That helpful to user. ii) that are meant for ensuring the efficient operation of system. 8. Explain the following terms: i)bootstrap program (09Marks,June09) ii) Caching iii) Trap iv) Job pool v) Symmetric multiprocessing. (05Marks,May10) 9. Explain two sets of operating system services that are helpful to user as well as efficient operation of system. (10Marks,May10) 10. Write and explain the sequence of system calls for copying a file to another (new) file. (10Marks,May10) 11. What is an operating system? Explain the goals of an operating system. (06Marks,Dec10) 12. Define the essential properties of the following operating systems: i) Time sharing operating system ii) Batch operating system iii) Real time operating system iv) Distributed operating system. (10Marks,May10) 13. Mention the different system structures employed in a modern operating system. Explain the virtual machine approach. (06Marks,Dec10) 14. Define an operating system. Explain two view points of OS role. (05Marks,Dec10) 15. What are OS operations? Explain. (06Marks,Dec11) Dept of CSE, DSATM Page 20

2 16. Define a virtual machine (VM). With a neat diagram, explain the working of VM. What are the benefits of a VM? (09Marks,Dec10) 17. Distinguish among the following terminologies associated with the operating system and explain each of them in detail Multitasking systems, Multiprogramming systems,multi processors system (12Marks, June11) 18. With the help of an example explain the concept of virtual machines (08Marks, June11) 19. What is an operating system? Bring out the requirements of i) real time operating system ii) distributed operating system (10Marks,June12) 20. What are system calls? explain different categories of system calls (10Marks,June12) 21. Define operating systems. discuss its role with respect to user and system view points (06Marks,Dec12) 22. briefly explain clustered and real time system (04Marks,Dec12) 23. Define virtual machines. with a neat sketch explain its working and what are the benefits of virtual machines (10Marks,Dec12) 24. List the operating system responsibilities in connection, with a process management and memory management (08Marks,Dec11) 25. Explain graceful degradation and fault tolerance in multiprocessor system (06Marks,Dec11) 26. What is virtual machine? Explain just-in-time (JIT) compiler,used in java (06Marks,Dec11) UNIT-2 PROCESS MANAGEMENT 1. With a diagram, explain the different states of a process. (06Marks,Dec09) 2. Differentiate between long-term and short-term schedulers. (04Marks,Dec09) 3. Suppose the following jobs arrive for processing at the times indicated. Each job will run the listed amount of time. Job Arrival time Burst time i) Give a Gantt chart illustrating the execution of these jobs, using the non pre-emptive FCFS and SJF scheduling algorithms. ii) What is turnaround time and waiting time of each job for the above algorithms? Dept of CSE, DSATM Page 21

3 iii) Compute average turnaround time if CPU is left idle for the first 1 unit and then SJF is used. (Job1 and Job2 will wait during this time) (10Marks,Dec09) 4. What is a process? Draw and explain the process state diagram. (05Marks,Dec08) 5. Discuss the operations of process creation and process termination in UNIX. (07Marks,Dec08) 6. Describe the implementation of IPC using shared memory and message passing (08Marks,Dec08) 7. Describe the process states with the help of state diagram. (06Marks,June09) 8. Discuss various multithreading models with diagram. (06Marks,June09) 9. Consider the following set of processes. Process Burst time Arrival Time Priority P P P P Draw Grant charts and calculate average waiting time average turnaround time using following CPU scheduling algorithms. i) Preemptive shortest Job First. ii) Non preemptive priority (= HIGH Priority) (08 Marks,June09) 10. What PCB/ enumerate and explain various fields in PCB. (04Marks,May10) 11. What is multithreading? Explain the benefits of multithreaded programming. 12. Consider the following set of processes: Process Arrival time Burst time P P P P (05Marks, May10) i) Draw Gantt charts showing the execution of these processes using FCFS, preemptive ii) iii) SJF, non-preemptive SJF and RR (Quantum 1)scheduling schemes Compute the turnaround time and waiting time for each process for each of schemes above. Compute the average turnaround time and average waiting time in each scheme and above. (11Marks,May10) 13. Explain the process state, with the diagram. What is the need for a context switch? (07Marks,May10) Dept of CSE, DSATM Page 22

4 14. What are schedulers? Explain various schedulers, with diagrams. (07Marks,May10) 15. What is inter process communication? Explain. (07Marks,May10) 16. Define IPC (Inter process communication). What are the different methods used for logical implementation of a message passing system? Explain any one. (06Marks,Dec10) 17. Discuss three common ways of establishing relationship between the user thread and kernel thread. 18. Consider the following set of processes, with length of CPU burst in milliseconds. (06Marks,Dec10) Process P 1 P 2 P 3 P 4 P 5 Arrival time Burst time i) Draw a Gantt chart that illustrates the execution of these processes using the preemptive shortest job first (SJF) algorithm. Hence find the average waiting time. ii) Draw a Gantt chart that illustrate the execution of these processes using preemptive Priority scheduling algorithm. Given priority of each process P 1 + 4, P 2 + 3,P 3 +5, P 4 = 1 and P 5 =1. Also find the average waiting time. (08Marks,Dec10) 19. What is a process? with a state diagram explain the states of process.also write the structure of PCB (10Marks,June11) 20. Consider four jobs with (arrival time, burst time) as (0,5) (0.2,2) (0.6,8) (1.2,4) find the average turn around time and waiting time for the jobs using FCFS,SJF,and RP(q=1) scheduluing algorithm (10Marks,June11) 21. Explain the process states with a diagram. what is the need for context switch? (07Marks,June12) 22. What are the difference between user level threads and kernel supported threads (05Marks,June12) 23. For the following examples calculate average waiting time and average turn around time by FCFS, preemptive SJF, and RR( 1 time unit) CPU scheduling algorithm. Jobs Arrival time Burst time P P P P (08Marks,June12) Dept of CSE, DSATM Page 23

5 24. What is a process? with a state diagram explain the states of process.also write the structure of PCB (08Marks,Dec12) 25. Discuss three common ways of establishing relationship between user and kernel threads (06Marks,Dec12) 26. For the following set of processes. find the average waiting time and average turnaround time along with Gant chart illustration for i) Shortest remaining time first ii) preemptive priority scheduling algorithm Process Burst time Arrival time Priority P P P P P (06Marks,Dec12) 27. Explain process state with a suitable diagram (08Marks,Dec11) 28. Explain the benefits of multi threading programming (08Marks,Dec11) 29. Explain hard real time system (04Marks,Dec11) UNIT-3 PROCESS SYNCHRONIZATION 1. Discuss various multithreading models, with diagram. (06Marks,Dec09) 2. Explain the three requirements that solution to the critical-section problem, must satisfy. (04Marks,Dec09) 3. State the dining philosopher s problem and give a solution for the same, suing semaphores. Write the structure of philosopher. (10Marks,Dec09) 4. Consider the following data about processes Process Arrival time Burst time P P P Priority Dept of CSE, DSATM Page 24

6 P P i) Draw charts to illustrate execution using SRTF, preemptive priority and RR (TS = 1 ii) iii) msec). Compute waiting time in each of the cases. Which of them provide minimal average waiting time and turnaround time? Find out the time at which there are maximum numbers of processes in the ready queue in the scenario? (10Marks,Dec08) 5. Consider a system running 10 1/0 bound tasks and one cpu bound task. Assume 1/0 bound tasks issue an 1/0 once for every msecs of CPU computing and that each 1/0 Operation takes that all processes are long running tasks. Comment on the CPU utilization for a RR scheduler when TS = 1 msec and TS = 10msec. (04Marks,Dec08) 6. What are the three requirements to be met by a solution to the critical section Problem? Explain. (06Marks,June09) 7. Describe the Bounded buffer problem and give a solution for the same using semaphores. Write the structure of producer and consumer processes. 8. Describe the following: i) Semaphore ii) Wait () operation iii) Signal () operation. (08Marks,June09) (06Marks,June09) 9. Define race condition. List the requirements that a solution to critical section problem must satisfy. (05Marks,May10) 10. What are semaphores? Explain two primitive semaphore operations. What are the advantages of semaphore? (07Marks,May10) 11. Define the algorithms Test And Set () and swap (). Show that they satisfy mutual exclusion. (08Marks,May10) 12. Suppose four processes arrive for processing in the order P 1, P 2 P 3, and P 4 with burst times and priorities as given below: Process P 1 P 2 P 3 P 4 Burst time Priority Draw the Gantt charts and calculate the average waiting time for the following algorithms: i) First Come First Served ii) Shortest Job First iii) Priority scheduling (08Marks,Dec10) 13. What is a deadlock? List the necessary conditions for a deadlock to occur. Explain the Banker s algorithm. (12Marks,Dec10) 14. What do you mean by binary semaphore and a counting semaphore? Along with the necessary C struct, explain the implementation of wait 0 and signal 0 semaphore operations. (10Marks,Dec10) Dept of CSE, DSATM Page 25

7 15. With the necessary syntax, describe the term monitor. Explain the solution the classical dining philosopher s problem, using monitor. (10Marks,Dec10) 16. What is synchronization? Explain synchronization hardware (04Marks,June11) 17. What are semaphores? Explain the solution to procedure- consumer problem using semaphores (08Marks,June11) 18. What are monitor? Explain it (04Marks,June11) 19. What is critical section problem? How does a semaphores solve the crtical section problem? Discuss whether semaphores satisfy the three requirement for a solution to a critical section problem (08Marks,June12) 20. What are monitors? Explain with an example (08Marks,June12) 21. Define mutual exclusion and critical section problem. write the software solution for 2- process synchronization (07Marks,Dec12) 22. What is semaphores? explain how it can be used to solve producer consumer problem. (07Marks,Dec12) 23. Explain the solution for dining philosopher problem using monitors (06Marks,Dec12) 24. Explain test and set instruction and expalin mutual exclusion using test and set instructions (05Marks,Dec11) UNIT-4 DEADLOCKS 1. Define the hardware instructions test and set ( ) and swap ( ). And also give the algorithms for implementing mutual exclusion with these Instructions. 2. Describe the necessary conditions for a deadlock situation to arise, in a system. 3. Consider the following snapshot of a system: Allocation Maximum Available A B C D A B C D A B C D (06Marks,Dec09) (04Marks,Dec09) Answer the following questions using the Banker s algorithm; Dept of CSE, DSATM Page 26

8 i) What is the content of the matrix need? ii) Is the system in a safe state? iii)if a request from process P 1 arrives for (0, 4, 2, 0) (10Marks,Dec09) 4. Define race condition. List the requirements that solution to critical section problem must satisfy. (04Marks,Dec08) 5. Define the algorithms Test and Set ( ) and Swap (). Show that they satisfy mutual exclusion (06Marks,Dec08) 6. Consider the following snap shot of resource-allocation at time t 1 Allocation request Available A B C A B C A B C P P P P P i) Show that the system is not deadlocked by generating one safe sequence. ii) At instance 12, p2 makes one additional request for instance of type C, Show that the system is deadlocked if the request is granted. Write down the deadlocked processes. (10Marks,Dec08) 7. Consider the following snapshot of a system. Allocation Maximum Available A B C A B C A B C P P P P P Table Q4(a) Answer following questions using Bankers algorithm. i) Is the system in a safe state? ii) If a request from P1 arrives for (1,0,2), can the request be granted immediately? (09Marks,June09) 8. Discuss the various approaches, used for deadlock recovery. (06Marks,June09) Dept of CSE, DSATM Page 27

9 9. Consider the Resource allocation graphs given in fig.q4(c ) (i)and (ii), Check whether deadlock exists in the system, if yes, identify the processes involved in deadlock. (05Marks,June09) Fig. Q4(c) (i) fig. Q4(c) (ii) 10. Explain how resource-allocation graph is used to describe deadlocks. (05Marks,May10) 11. What are the different methods for handling deadlocks? Explain Banker s algorithm. 12. A safe state in not a deadlock state but a deadlock state is an unsafe state. Explain (11Marks,May10) (04Marks,May10) 13. Explain the terms: critical section and mutual exclusion. (05Marks,Dec10) 14. What is a semaphore? Explain the role of a semaphore in solving a critical section problem. (10Marks,Dec10) 15. What are monitors? Explain. (05Marks,Dec10) 16. Define the terms: safe state and safe sequence. Give an algorithm to find whether or not a system is in a safe state. (10Marks,Dec10) 17. What is dead lock? explain the necessary conditions for its occurrence (08Marks,June12,June11) 18. Consider the system Process Allocation Max Available A B C D A B C D A B C D P P P P P Answer the following questions using Bankers algorithm i) What is the content of matrix need? ii) Is the system in safe state? iii) If a request from process p arrives for ( 0, 4, 2, 0) can the request be granted immediately? (10Marks,June11,Dec10) 19. Explain with a example how a resource allocation graph is used to describe deadlocks (06Marks,June12) Dept of CSE, DSATM Page 28

10 20. System consists of five process (p 0, p 1,p 2,p 3,p 4 ) and three resources (R 1,R 2,R 3 ) resource type R 1 has 10 instances, resource type R 2 has 5 instances, resource type R 3 has 7 instances the following snap shot of the system has been taken Allocation Maximum Available jobs A B C P P P P P A B C A B C Calculate the content for matrix need and find out the safe sequence by using Bankers algorithm (08Marks,June12) 21. Define the necessary and sufficient conditions for dead lock to occur (04Marks,Dec12) 22. Consider the following snap shot of the system Process Allocated resources Maximum requirement Total resources R 1 R 2 R 3 R 1 R 2 R 3 R 1 R 2 R 3 P P P i) What is the content need matrix? ii) Is the system in safe state? iii) If the following requests are made, can they be satisfied / granted immediately in thr current state : P 1 requests for (1, 1, 0) P 3 requests for ( 0, 1, 0) resource additionality (10Marks,Dec12) 23. Given the three processes A,B and C, 3 resources X,Y and Z and the following events. i) A requests X ii) A requests Y iii) B requests Y iv) B requests Z v) C requests X vi) C requests Y vii) C requests Z Assume the requested resources is always allocated to requesting process if it is available.draw the resource allocation graph (RAG) for the sequence (2, 6, 3, 5, 1, 4 and 7).Also mention if deadlock occurs. If so, how do you recover from deadlock (06Marks,Dec12) 24. List any four examples of deadlock that are not related to computer systems. (08Marks,Dec11) 25. Explain safety algorithm used in Bankers algorithm, with a suitable example. (12Marks,Dec11) Dept of CSE, DSATM Page 29

11 PART-B UNIT-5 MEMORY MANAGEMENT 1. What is paging and swapping? (04Marks,Dec09) 2. With a diagram, discuss the steps involved in handling a page fault. (06Marks,Dec09) 3. Consider the following page reference string: For a memory with three frames. How many page faults would occur for LRU, FIFO and optimal page replacement algorithms? Which is the most efficient among them? (10Marks,Dec09) 4. Memory partitions of 100KB, 500KB, 200KB, 300KB, 600KB (in order) are available. How would first fit, best fit and worst fit algorithms place processes of 212KB, 417KB and 426KB (in order). Which algorithm makes the most efficient use of memory? (06Marks,Dec08) 5. Differentiate between internal and external fragmentations? How are they overcome? (04Marks,Dec08) 6. Consider the following page reference stream:1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7,6, 3,2,1, 2, 3, 3. How May page faults would occur for LRU, FIPO and Optimal replacement algorithms assuming 3 and 5 frames? Which one of the above is most efficient? (10Marks,Dec08) 7. Assume we have a paged memory system with associative registers (TLBs) to hold the most active page table entiries. If the page table is normally held in memory and memory access time is 1 micro second, What would be the effective access time if 85% of all memory references find their entires in the associative registers. Assume that associative registers access time is zero.give the differences between: i) internal and external fragmentation ii) paging and segmentation. (06Marks,June09) 8. Discuss the steps involved in handling page fault, with diagram. (06Marks,June09) 9. Consider the following page reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,1,7,0,1. How many page faults would occur for FIFO page replacement algorithm, assuming three frames? (04Marks,June09) 10. What do you mean by dynamic storage allocation problem? Explain possible solutions to this problem. (04Marks,May10) 11. Explain the concept of forward-mapped page table. (04Marks,May10) 12. consider the following reference string : 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. Assuming three frames, all initially empty, how many page faults would occur for i) LRU ii) FIFO iii) Optimal page replacement algorithms? Which of the algorithms is most efficient in this case? (12Marks,May10) Dept of CSE, DSATM Page 30

12 13. What do you mean by a address binding? Explain the necessary steps, the binding of instructions and data to memory addresses. (08Marks,Dec10) 14. On a system using demand paged memory it takes 0, 12 s to satisfy a memory request, if the page is in memory. If the page is ot in memory the request takes 5000 s. What would the page fault rate need to be to achieve an effective access time 1000 s? Assume the system is only running a single process and the CPU is idle during the page swaps. (08Marks,Dec10) 15. What do you mean by acopy-on-write? Where is it used? Explain in brief. (04Marks,Dec10) 16. What is paging? Explain it (07Marks,June11) 17. Explain internal and external fragmentation with a neat diagram (04Marks,June11) 18. Consider the following page reference string:1,2,3,5,2,3,5,7,2,1,2,3,8,6,4,3,2,2,3,6 How many page faults would occur in the case of i) LRU ii) FIFO iii) Optimal algorithm. assuming 3 frames note that initially all frames are empty (08Marks,June11) 19. Distinguish between i) Logical address space and physical address space ii) Internal and external fragmentation iii) Paging and segmentation (09Marks,June12) 20. Explain with the help of supporting hardware diagram how the TLB improves the performance of demand paging (10Marks,June12) 21. Given memory partitions of 100k,500k,200k, 300k and 600k( in order) how would each of first fit, best fit and worst fit algorithms work place process of 212k,417k,112k, and 426k ( in order)? Which algorithm makes the most efficient use of memory? (09Marks,June12) 22. Explain with illustrations, the external and internal fragmentation problem encountered in contiguous memory allocation. (09Marks,Dec12) 23. Explain the concept of forward mapped page table. (09Marks,Dec12) 24. Consider the following sequence of memory reference form a 460 word program. 10,11,104,170,73,309,185,245,246,434,458,364 show the reference string assuming page size of 100 words find page fault rate for the above reference string assuming 200 words of primary memory available and FIFO and LRU replacement algorithms. (10Marks, Dec12) 25. What is dynamic storage allocation? Explain the commonly used strategies for dynamic storage allocation (09Marks,Dec12) 26. Explain the buddy-system, used for managing free memory assigned to kernel process (06Marks, Dec11) 27. Explain the following page replacement algorithms : i) Optimal ii) LRU 28. To reference string 1,0,7,1,0,3,1,3,2,0,3,2,4,0,3,2,1,0,7 find how many page faults would occur for these algorithms, if number of frames is 3. (10Marks,Dec10) Dept of CSE, DSATM Page 31

13 29. Explain the segmentation memory management. Describe the hardware support that is required for its implementation (10Marks,Dec10) UNIT-6 FILE SYSTEM, IMPLEMENTATION OF FILE SYSTEM 1. Explain the following: i) File types ii) File operation. iii) File attributes (12Marks,Dec09) 2. Explain the methods used for implementing directories. (08Marks,Dec09) 3. What is file? Describe the different access methods on files. (07Marks,Dec08) 4. What is file mounting? Explain. (04Marks,Dec08) 5. Draw a neat diagram and explain finked file allocation. Is FAT linked allocation? Discuss. (09Marks,Dec08) Discuss the following in brief: i) File Attributes ii) File types iii) Sequential File Access iv) Tree structured Directories. (12Marks,Dec08) 6. Explain contiguous, linked and indexed methods of allocating disk space. (08Marks,Dec10) 7. What is meant by consistency semantics? Explain the consistency semantics as implemented in a modern O.S. (07Marks,May10) 8. With the help of neat diagram, describe: i) Tree-structured directory ii) Acylic- graph directory. (06Marks,May10) 9. Explain virtual file system (VFS) (09Marks,May10) 10. Explain any two file allocation methods with their merits and demerits. (08Marks,Dec10) 11. Explain the following disk scheduling algorithms: i) SSTF ii) SCAN iii) LOOK (10Marks,Dec10) 12. What are the different file access methods? Explain briefly. (05Marks,Dec10) 13. What do mean by a free space list? With suitable examples, explain any two methods of implementation of a free space list. (08Marks,Dec10) 14. What are the major methods used for allocating a disk space? Explain each, with suitable examples. (12Marks,Dec10) 15. Explain different file access methods. (05Marks,June11) 16. Explain various directory structures (07Marks,June11) 17. Explain different disk space allocation methods with an example. (08Marks,June11) 18. Explain different types of files. (05Marks,June12) 19. Name the different allocation methods. Explain the linked allocation of file implementation with merits and demerits (08Marks,June12) 20. Define file system explain different directory structure (07Marks,June12) 21. Describe the different access methods on files (09 Marks,Dec12) 22. Explain the concept of file mounting (05 Marks,Dec12) Dept of CSE, DSATM Page 32

14 23. With neat sketch, explain the linked file allocation and indexing file allocation methods. (05Marks,Dec11) 24. List the common file types along with its extension and functions (10Marks,Dec11) 25. How do the modern operating systems concurrently support multiplies types of file system? Explain its implementation (10Marks,Dec11) UNIT-7 SECONDARY STORAGE STRUCTURES, PROTECTION 1. A disk drive has 200 cylinders numbered from 0 to 199. The disk head is initially at cylinder 53. The queue of pending requests in FIFO order is: 98, 183, 37, 122, 14, 124, 65, 67. Starting from the current head position, what is the total distance traveled (in cylinders ) by Illustrate with figures in each case. (12Marks,Dec09) 2. Describe the access matrix model used for protection purpose. (08Marks,Dec09,Dec10,Dec08) A drive has 5000cylinders numbered 0 to The drive is currently serving a request at cylinder 143 and the previous request was at cylinder 125. The queue of pending requests in FIFO order is : 86, 1470, 913, 1773, 948, 1509, 1022, 1750, 130. Starting from the current head position, what is the total distance travelled (in cylinders) by the disk arm to satisfy the requests using algorithms FCFS, SSTF, SCAN, LOOK. Illustrate with figures in each case. (10Marks,Dec12,June11,Dec08,May11,June09) 3. Explain the following disk scheduling algorithms in brief with examples. i) FCFS Scheduling ii) S S T F Scheduling iii) S C A N Scheduling (12Marks,June11) 4. Suppose the position of cylinder is at 53. Sketch the graphical representation for the queue of pending requests in the order -98, 183, 37, 122, 14, 124, 65, 67, for FCFS, SSTF and LOOK scheduling schemes. Give your comment on this scenario for the above schemes. (12Marks,June09) 5. Explain briefly various types of program threats and system threats. (10Marks,Dec10) 6. Discuss the steps in handling a page fault, with the help of neat diagram. (10Marks,Dec10) 7. Given the page reference string: Three frames allocate for the program in the main memory. Determine the number of page faults using i) LRU policy ii) Optimal Replacement policy. (10Marks,Dec12) 8. Explain access matrix with an example (05Marks,June11) 9. Explain domain of protection (05Marks,June11) 10. What is disk scheduling? Explain any 3 disk Scheduling methods with examples. (10Marks,June12) 11. What is swap space management? explain. (05Marks,June12) 12. What is access matrix?explain access matrix with domain as objects (05Marks,June12) 13. Explain sector slipping. with an example (04Marks,Dec11) 14. Assume the disk queue, with request fun I/O to block on cylinders as 80, 30,15,100,125,90,45, and 10. If the disk head is initially at cylinder 35, illustrate the disk movements using the SSTF scheduling algorithm. Also calculate the total head movement (08Marks,Dec11) 15. Explain various questions that arise in revocation of access rights (08Marks,Dec11) Dept of CSE, DSATM Page 33

15 UNIT-8 CASE STUDY- THE LINUX OPERATING SYSTEM 1. Write short notes on : a. Components of Linux system. b. interprocess communication facility in Linux c. scan and c-scan disk scheduling d. Tree directory structure. (20Marks,Dec09) 2. Write notes on: a. Buddy system of memory management in UNIX. b. Thrashing c. Solution to bounded buffer problem using Semaphore. d. Bad blocks on disks. (20Marks,Dec08) 3. Write short notes on any FOUR of following: a. Components of LINUX system. b. Process management in LINUX. c. Inter process communication. d. Dynamic loading. e. Process Control Block. (PCB) (20Marks,June09) 4. Write short notes on: a. Components of Linux system b. Processes and threads c. Conflict resolution mechanism of Linux d. Linux file system. (20Marks,June09) 5. Write short notes on: a. System calls b. Threads c. Virtual memory d. Design principles of Linux system. (20Marks,Dec10) 6. Discuss the directory implementation using i) Linear list ii) Hash table (10Marks,Dec10) 7. What are the components that the kernel module support under Linux? Explain in detail (10Marks,Dec10) 8. write short notes on a. components of Linux system b. thrashing c. monitors d. inter process communication (20Marks,June11) 9. write short notes on the following i) process management in Linux (06Marks,June12) ii) page replacement algorithm (08Marks,June12) iii) steps in handling a page fault (06Marks,June12) 10. Explain different system components in LINUX operating system. (10Marks,Dec12) Dept of CSE, DSATM Page 34

16 11. Discuss interprocess communication in LINUX operation system. (10Marks,Dec12) 12. Distinguish between fork ( ) and clone ( ) system calls. Also customize clone() system call to fork functionality with suitable modification/settings (08Marks,Dec11) 13. Explain the LINUX device drive the block structure (12Marks,Dec11) Dept of CSE, DSATM Page 35

10CS53:Operating Systems

10CS53:Operating Systems CS53:Operating Systems Question Bank UNIT 1: INTRODUCTION TO OPERATING SYSTEMS & THEIR CLASSIFICATION Objective: The main objective of this chapter is to study the Operating system basics & Classifications.

More information

GOJAN SCHOOL OF BUSINESS AND TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY CS2411-OPERATING SYSTEM QUESTION BANK UNIT-I (PROCESSES AND THREADS)

GOJAN SCHOOL OF BUSINESS AND TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY CS2411-OPERATING SYSTEM QUESTION BANK UNIT-I (PROCESSES AND THREADS) GOJAN SCHOOL OF BUSINESS AND TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY CS2411-OPERATING SYSTEM QUESTION BANK UNIT-I (PROCESSES AND THREADS) 1. What is an Operating system? What are the various OS

More information

SUBJECT CODE /NAME : CS6401 OPERATING SYSTEMS YEAR/SEM: II/04 QUESTION BANK

SUBJECT CODE /NAME : CS6401 OPERATING SYSTEMS YEAR/SEM: II/04 QUESTION BANK SUBJECT CODE /NAME : CS6401 OPERATING SYSTEMS YEAR/SEM: II/04 QUESTION BANK Unit-I OPERATING SYSTEMS OVERVIEW 1. Differentiate between tightly coupled systems and loosely coupled systems. 2. Define OS

More information

J.B. INSTITUTE OF TECHNOLOGY,DEHRAUDN

J.B. INSTITUTE OF TECHNOLOGY,DEHRAUDN J.B. INSTITUTE OF TECHNOLOGY,DEHRAUDN Question Bank Subject Name: Operating system Subject Code: (TCS 601) Department: CS/IT Faculty Name: Kapil Joshi Year/Sem: 3 rd /6 th Designation: A.P Answer the following

More information

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur-603203 DEPARTMENT OF INFORMATION TECHNOLOGY Academic Year: 205-6 QUESTION BANK - EVEN SEMESTER NAME OF THE SUBJECT SUBJECT CODE SEMESTER YEAR DEPARTMENT

More information

UNIT-I (Introduction to OS)

UNIT-I (Introduction to OS) 1) Define the term OS. What is the need of OS? UNIT-I (Introduction to OS) 2) Write a short note on Distributed Operating System. 3) What are the services provided by operating system? 4) Differentiate

More information

CPU Scheduling. Multiprogrammed OS

CPU Scheduling. Multiprogrammed OS CPU Scheduling Multiprogrammed OS Efficient Use of Processor By switching between jobs Thread scheduling and process scheduling often used interchangeably Which is done depends on implementation of O/S.

More information

Chapter 6: CPU Scheduling. Previous Lectures. Basic Concepts. Alternating Sequence of CPU And I/O Bursts

Chapter 6: CPU Scheduling. Previous Lectures. Basic Concepts. Alternating Sequence of CPU And I/O Bursts Previous Lectures Multithreading Memory Layout Kernel vs User threads Representation in OS Difference between thread and process Thread scheduling Mapping between user and kernel threads Multithreading

More information

Sri vidya College of Engineering & Technology, Virudhunagar. CS6401- Operating System QUESTION BANK UNIT-IV

Sri vidya College of Engineering & Technology, Virudhunagar. CS6401- Operating System QUESTION BANK UNIT-IV Part-A QUESTION BANK UNIT-IV 1. What is a File? A file is a named collection of related information that is recorded on secondary storage. A file contains either programs or data. A file has certain structure

More information

III. Process Scheduling

III. Process Scheduling Intended Schedule III. Process Scheduling Date Lecture Hand out Submission 0 20.04. Introduction to Operating Systems Course registration 1 27.04. Systems Programming using C (File Subsystem) 1. Assignment

More information

III. Process Scheduling

III. Process Scheduling III. Process Scheduling 1 Intended Schedule Date Lecture Hand out Submission 0 20.04. Introduction to Operating Systems Course registration 1 27.04. Systems Programming using C (File Subsystem) 1. Assignment

More information

Chapter 6: CPU Scheduling

Chapter 6: CPU Scheduling 1 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 6.1 2 Basic Concepts Maximum CPU utilization

More information

END TERM Examination, May 2014 (Model Test Paper) B.Tech (IT) IV Semester

END TERM Examination, May 2014 (Model Test Paper) B.Tech (IT) IV Semester END TERM Examination, May 2014 (Model Test Paper) B.Tech (IT) IV Semester Paper Code: ETCS - 212 Subject: Operating Systems Time: 3 hrs Maximum Marks: 75 Note: Attempt five questions including Q. No. 1

More information

PES Institute Of Technology Bangalore South Campus

PES Institute Of Technology Bangalore South Campus PES Institute Of Technology Bangalore South Campus (Hosur Road, 1KM before Electronic City, Bangalore-560 102) Sem: V A and B Date: 27/8/1 Subject & Code: Operating Systems Marks: 50 Name of faculty: Y.

More information

Chapter 6: CPU Scheduling. Basic Concepts

Chapter 6: CPU Scheduling. Basic Concepts 1 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 6.1 Basic Concepts Maximum CPU utilization obtained

More information

5) One class of services provided by an operating system is to provide new functionality that is not supported directly by the underlying hardware.

5) One class of services provided by an operating system is to provide new functionality that is not supported directly by the underlying hardware. Benha University 2 nd Term (May 2014) Final Exam Class: 3 rd Year Students Subject: Operating Systems Faculty of Computers & Informatics Date: 17/5/2014 Time: 3 hours Answer the following questions:- Question

More information

END TERM Examination(Model Test Paper) Fourth Semester[B.Tech]

END TERM Examination(Model Test Paper) Fourth Semester[B.Tech] END TERM Examination(Model Test Paper) Fourth Semester[B.Tech] Paper Code: ETCS - 212 Subject: Operating System Time: 3 hrs Maximum Marks: 75 Note: Q.No.1 is compulsory. Attempt any four questions of remaining

More information

Chapter 6: CPU Scheduling. Basic Concepts Scheduling Criteria Scheduling Algorithms

Chapter 6: CPU Scheduling. Basic Concepts Scheduling Criteria Scheduling Algorithms Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Operating System Concepts 6.1 Basic Concepts Maximum CPU utilization obtained with multiprogramming. CPU I/O Burst Cycle

More information

CPU Scheduling. Chapter 5

CPU Scheduling. Chapter 5 CPU Scheduling Chapter 5 Basic Concepts Maximum CPU utilization obtained with multiprogramming CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait CPU burst distribution

More information

OPERATING SYSTEMS. IIIT-Hyderabad

OPERATING SYSTEMS. IIIT-Hyderabad OPERATING SYSTEMS IIIT-Hyderabad OVERVIEW Introduction What is an OS/Kernel? Bootstrap program Interrupts and exceptions Volatile and Non volatile storage!!! Process Management What is a process/system

More information

Chapter 5: CPU Scheduling

Chapter 5: CPU Scheduling Chapter 5: CPU Scheduling Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Thread Scheduling Operating Systems Examples

More information

Chapter 5: CPU Scheduling

Chapter 5: CPU Scheduling Chapter 5: CPU Scheduling Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Thread Scheduling Operating Systems Examples

More information

Process Management. Processes. CS 502 Spring 99 WPI MetroWest/Southboro Campus

Process Management. Processes. CS 502 Spring 99 WPI MetroWest/Southboro Campus Process Management CS 502 Spring 99 WPI MetroWest/Southboro Campus Processes Process Concept Process Scheduling Operations on Processes Cooperating Processes Threads Interprocess Communication 1 1 Process

More information

Chapter 5: Process Scheduling. Operating System Concepts 8 th Edition,

Chapter 5: Process Scheduling. Operating System Concepts 8 th Edition, Chapter 5: Process Scheduling, Silberschatz, Galvin and Gagne 2009 Chapter 5: Process Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling

More information

Introduction to process scheduling. Process scheduling and schedulers Process scheduling criteria Process scheduling algorithms

Introduction to process scheduling. Process scheduling and schedulers Process scheduling criteria Process scheduling algorithms Lecture Overview Introduction to process scheduling Process scheduling and schedulers Process scheduling criteria Process scheduling algorithms First-come, first-serve Shortest-job-first Priority Round-robin

More information

Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation

Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 1 Basic Concepts Maximum CPU utilization obtained

More information

CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait

CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait Unit II Process Scheduling and Synchronization Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Thread Scheduling Operating Systems Examples Java

More information

Chapter 5: CPU Scheduling

Chapter 5: CPU Scheduling Chapter 5: CPU Scheduling Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Thread Scheduling Operating Systems Examples

More information

Far-western University Central Office, Mahendranagar Operating System

Far-western University Central Office, Mahendranagar Operating System Far-western University Central Office, Mahendranagar Operating System Course Title: Operating Systems Credit: 3+1 Course No: B.Sc. CS OS 231 hour 45+15 Nature of the Course: Theory + Lab Year: 2 nd, Semester:

More information

CPU Scheduling. Date. 2/2/2004 Operating Systems 1

CPU Scheduling. Date. 2/2/2004 Operating Systems 1 CPU Scheduling Date 2/2/2004 Operating Systems 1 Basic concepts Maximize CPU utilization with multi programming. CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait.

More information

Basic Concepts. Chapter 6: CPU Scheduling. Histogram of CPU-burst Times. Dispatcher. CPU Scheduler. Alternating Sequence of CPU And I/O Bursts

Basic Concepts. Chapter 6: CPU Scheduling. Histogram of CPU-burst Times. Dispatcher. CPU Scheduler. Alternating Sequence of CPU And I/O Bursts Chapter 6: CPU Scheduling Basic Concepts Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation Maximum CPU utilization obtained

More information

CS720 - Operating Systems. CPU Scheduling

CS720 - Operating Systems. CPU Scheduling CS720 - Operating Systems CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Procesor Scheduling Real-Time Scheduling Algorithm Evaluation Slides derived from material in

More information

CPU Scheduling CS 571. CPU - I/O Burst Cycle. Bursts of CPU usage alternate with periods of I/O wait a CPU-bound process an I/O bound process

CPU Scheduling CS 571. CPU - I/O Burst Cycle. Bursts of CPU usage alternate with periods of I/O wait a CPU-bound process an I/O bound process CPU Scheduling CS 571 1 CPU - I/O Burst Cycle Bursts of CPU usage alternate with periods of I/O wait a CPU-bound process an I/O bound process 2 1 Basic Concepts CPU I/O Burst Cycle Process execution consists

More information

Chapter 6: CPU Scheduling

Chapter 6: CPU Scheduling Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation Oct-03 1 Basic Concepts Maximum CPU utilization

More information

Chapter 6: CPU Scheduling

Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation Chapter 6: 6.1 Basic Concepts Maximum CPU utilization obtained with multiprogramming.

More information

Chapter 5: Process Scheduling. Operating System Concepts with Java 8 th Edition

Chapter 5: Process Scheduling. Operating System Concepts with Java 8 th Edition Chapter 5: Process Scheduling Operating System Concepts with Java 8 th Edition 5.1 Silberschatz, Galvin and Gagne 2009 Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms

More information

Chapter 6: CPU Scheduling

Chapter 6: CPU Scheduling Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 6.1 Basic Concepts Maximum CPU utilization obtained

More information

Module 5: CPU Scheduling

Module 5: CPU Scheduling Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation Operating System Concepts 5.1 Silberschatz and

More information

Chapter 6: CPU Scheduling

Chapter 6: CPU Scheduling Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling 1.1 Maximum CPU utilization obtained with multiprogramming CPU I/O Burst

More information

Module 6: CPU Scheduling. Basic Concepts

Module 6: CPU Scheduling. Basic Concepts Module 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation Applied Operating System Concepts 6.1 Silberschatz,

More information

Module 6: CPU Scheduling. Basic Concepts. Alternating Sequence of CPU And I/O Bursts

Module 6: CPU Scheduling. Basic Concepts. Alternating Sequence of CPU And I/O Bursts Module 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation Applied Operating System Concepts 6.1 Basic Concepts

More information

CPU scheduling. Alternating Sequence of CPU And I/O Bursts. Histogram of CPU-burst Times. CPU Scheduler

CPU scheduling. Alternating Sequence of CPU And I/O Bursts. Histogram of CPU-burst Times. CPU Scheduler CPU scheduling Alternating Sequence of CPU And I/O Bursts Maximum CPU utilization is obtained by multiprogramming. CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait.

More information

CPU scheduling. CPU Scheduling. No.4. CPU burst vs. I/O burst. Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University

CPU scheduling. CPU Scheduling. No.4. CPU burst vs. I/O burst. Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University EECS 3221 Operating System Fundamentals No.4 CPU scheduling Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University CPU Scheduling CPU scheduling is the basis of multiprogramming

More information

CPU SCHEDULING. Scheduling Objectives. Outline. Basic Concepts. Enforcement of fairness in allocating resources to processes

CPU SCHEDULING. Scheduling Objectives. Outline. Basic Concepts. Enforcement of fairness in allocating resources to processes Scheduling Objectives CPU SCHEDULING Enforcement of fairness in allocating resources to processes Enforcement of priorities Make best use of available system resources Give preference to processes holding

More information

Chapter 5: Process Scheduling. Chapter 5: Process Scheduling

Chapter 5: Process Scheduling. Chapter 5: Process Scheduling Chapter 5: Process Scheduling Chapter 5: Process Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Operating Systems Examples Java Thread Scheduling Algorithm

More information

OS OBJECTIVE QUESTIONS

OS OBJECTIVE QUESTIONS OS OBJECTIVE QUESTIONS Which one of the following is Little s formula Where n is the average queue length, W is the time that a process waits 1)n=Lambda*W 2)n=Lambda/W 3)n=Lambda^W 4)n=Lambda*(W-n) Answer:1

More information

CPU Scheduling. Basic Concepts. Basic Concepts. CPU Scheduler. Histogram of CPU-burst Times CPU. Alternating Sequence of CPU and I/O Bursts

CPU Scheduling. Basic Concepts. Basic Concepts. CPU Scheduler. Histogram of CPU-burst Times CPU. Alternating Sequence of CPU and I/O Bursts Basic Concepts P CPU Scheduling CSCI 315 Operating Systems Design Department of Computer Science Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating

More information

Threads (Ch.4) ! Many software packages are multi-threaded. ! A thread is sometimes called a lightweight process

Threads (Ch.4) ! Many software packages are multi-threaded. ! A thread is sometimes called a lightweight process Threads (Ch.4)! Many software packages are multi-threaded l Web browser: one thread display images, another thread retrieves data from the network l Word processor: threads for displaying graphics, reading

More information

Lecture 8: Scheduling & Deadlock

Lecture 8: Scheduling & Deadlock Project 1 Due Thursday 10/20 Lecture 8: Scheduling & Deadlock CSE 120: Principles of Operating Systems Alex C. Snoeren Scheduling Overview In discussing process management and synchronization, we talked

More information

Introduction to Scheduling 1

Introduction to Scheduling 1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms FCFS, SJF, RR Exponential Averaging Multi-level Queue Scheduling Performance Evaluation Scheduling Terminology Scheduling Terminology

More information

Agenda. CPU Scheduling. Basic Concepts. CPU Scheduler. Histogram of CPU-burst Times. Alternating Sequence of CPU And I/O Bursts

Agenda. CPU Scheduling. Basic Concepts. CPU Scheduler. Histogram of CPU-burst Times. Alternating Sequence of CPU And I/O Bursts TDDB3: Concurrent programming and operating systems [SGG7] Chapter 5 Agenda CPU Scheduling Introduce CPU scheduling Describe various CPU scheduling algorithms Discuss evaluation criteria of CPU scheduling

More information

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time

More information

Scheduling. Scheduling. Scheduling levels. Decision to switch the running process can take place under the following circumstances:

Scheduling. Scheduling. Scheduling levels. Decision to switch the running process can take place under the following circumstances: Scheduling Scheduling Scheduling levels Long-term scheduling. Selects which jobs shall be allowed to enter the system. Only used in batch systems. Medium-term scheduling. Performs swapin-swapout operations

More information

Chapter 5: CPU Scheduling. Operating System Concepts 7 th Edition, Jan 14, 2005

Chapter 5: CPU Scheduling. Operating System Concepts 7 th Edition, Jan 14, 2005 Chapter 5: CPU Scheduling Operating System Concepts 7 th Edition, Jan 14, 2005 Silberschatz, Galvin and Gagne 2005 Outline Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling

More information

Chapter 5: CPU Scheduling. Operating System Concepts 8 th Edition,

Chapter 5: CPU Scheduling. Operating System Concepts 8 th Edition, Chapter 5: CPU Scheduling, Silberschatz, Galvin and Gagne 2009 Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Linux Example

More information

ACTS National Resource Center, Pune Question Bank Operating Systems (Unsolved)

ACTS National Resource Center, Pune Question Bank Operating Systems (Unsolved) Q.1 Fill in the blanks: (1 Mark each) 1. Single system image is obtained in case of 2. Turnaround Time refers to. 3. scheduler selects the process that is ready to execute to CPU. 4. Banker s algorithm

More information

Chapter 5: CPU Scheduling!

Chapter 5: CPU Scheduling! Chapter 5: CPU Scheduling Operating System Concepts 8 th Edition, Silberschatz, Galvin and Gagne 2009 Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling

More information

Scheduling. Reading: Silberschatz chapter 6 Additional Reading: Stallings chapter 9 EEL 358 1

Scheduling. Reading: Silberschatz chapter 6 Additional Reading: Stallings chapter 9 EEL 358 1 Scheduling Reading: Silberschatz chapter 6 Additional Reading: Stallings chapter 9 EEL 358 1 Outline Introduction Types of Scheduling Scheduling Criteria FCFS Scheduling Shortest-Job-First Scheduling Priority

More information

Process Scheduling. Minsoo Ryu. Real-Time Computing and Communications Lab. Hanyang University.

Process Scheduling. Minsoo Ryu. Real-Time Computing and Communications Lab. Hanyang University. Process Scheduling Minsoo Ryu Real-Time Computing and Communications Lab. Hanyang University msryu@hanyang.ac.kr Basic Concepts Scheduling Criteria Scheduling Algorithms Windows NT Scheduler Topics Covered

More information

CPU Scheduling. Operating System Concepts. Alternating Sequence of CPU And I/O Bursts. Basic Concepts. CPU Scheduler. Histogram of CPU-burst Times

CPU Scheduling. Operating System Concepts. Alternating Sequence of CPU And I/O Bursts. Basic Concepts. CPU Scheduler. Histogram of CPU-burst Times Operating System Concepts Module 5: CPU SCHEDULING Andrzej Bednarski, Ph.D. student Department of Computer and Information Science Linköping University, Sweden CPU Scheduling Basic Concepts Scheduling

More information

W4118 Operating Systems. Instructor: Junfeng Yang

W4118 Operating Systems. Instructor: Junfeng Yang W4118 Operating Systems Instructor: Junfeng Yang Outline Introduction to scheduling Scheduling algorithms 1 Direction within course Until now: interrupts, processes, threads, synchronization Mostly mechanisms

More information

CS2254-OPERATING SYSTEM TWO MARK QUESTIONS WITH ANSWERS UNIT -1 PROCESS AND THREADS

CS2254-OPERATING SYSTEM TWO MARK QUESTIONS WITH ANSWERS UNIT -1 PROCESS AND THREADS CS2254-OPERATING SYSTEM TWO MARK QUESTIONS WITH ANSWERS UNIT -1 PROCESS AND THREADS 1. What is meant by Mainframe Systems? Mainframe systems are the first computers developed to tackle many commercial

More information

II. Operating Systems and Processes!

II. Operating Systems and Processes! II. Operating Systems and Processes! Computer Architecture & Operating Systems: 725G84 Ahmed Rezine What is an Operating System? A program that acts as an intermediary between a user of a computer and

More information

Classification of Scheduling Activity Queuing Diagram for Scheduling

Classification of Scheduling Activity Queuing Diagram for Scheduling CPU Scheduling CPU Scheduling Chapter 6 We concentrate on the problem of scheduling the usage of a single processor among all the existing processes in the system The goal is to achieve High processor

More information

Objectives. Chapter 5: CPU Scheduling. CPU Scheduler. Alternating Sequence of CPU And I/O Bursts

Objectives. Chapter 5: CPU Scheduling. CPU Scheduler. Alternating Sequence of CPU And I/O Bursts Objectives Chapter 5: CPU Scheduling Introduce CPU scheduling, which is the basis for multiprogrammed operating systems Describe various CPU-scheduling algorithms Discuss evaluation criteria for selecting

More information

Objectives. 5.1 Basic Concepts. Scheduling Criteria. Multiple-Processor Scheduling. Algorithm Evaluation. Maximum CPU.

Objectives. 5.1 Basic Concepts. Scheduling Criteria. Multiple-Processor Scheduling. Algorithm Evaluation. Maximum CPU. Chapter 5: Process Scheduling Objectives To introduce CPU scheduling To describe various CPU-scheduling algorithms To discuss evaluation criteria for selecting the CPU-scheduling algorithm for a particular

More information

5.1 Basic Concepts. Chapter 5: Process Scheduling. Alternating Sequence of CPU And I/O Bursts. 5.1 Basic Concepts

5.1 Basic Concepts. Chapter 5: Process Scheduling. Alternating Sequence of CPU And I/O Bursts. 5.1 Basic Concepts 5.1 Basic Concepts Maximum CPU utilization obtained with multiprogramming CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait CPU burst distribution Chapter 5: Process

More information

Process boundness. Process scheduling. Alternating Sequence of CPU and I/O Bursts. Histogram of CPU-burst Times

Process boundness. Process scheduling. Alternating Sequence of CPU and I/O Bursts. Histogram of CPU-burst Times Process scheduling slide 1 Process boundness slide 2 See Silberschatz Chapter 5 Processes can be described as either: I/O-bound process - spends more time doing I/O than computations, many short bursts

More information

Types of jobs. CPU-bound vs. I/O-bound. Batch, Interactive, real time. Maximum CPU utilization obtained with multiprogramming

Types of jobs. CPU-bound vs. I/O-bound. Batch, Interactive, real time. Maximum CPU utilization obtained with multiprogramming CPU Scheduling Types of jobs CPU-bound vs. I/O-bound Maximum CPU utilization obtained with multiprogramming Batch, Interactive, real time Different goals, affects scheduling policies CPU Scheduler Selects

More information

CS 571 Operating Systems. CPU Scheduling. Angelos Stavrou, George Mason University

CS 571 Operating Systems. CPU Scheduling. Angelos Stavrou, George Mason University CS 571 Operating Systems CPU Scheduling Angelos Stavrou, George Mason University CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms First-Come-First-Served Shortest-Job-First, Shortest-remaining-Time-First

More information

Chapter 6: CPU Scheduling

Chapter 6: CPU Scheduling Chapter 6: CPU Scheduling Edited by Ghada Ahmed, PhD ghada@fcih.net Silberschatz, Galvin and Gagne 2013 Basic Concepts Maximum CPU utilization obtained with multiprogramming CPU I/O Burst Cycle Process

More information

Chapter 6: CPU Scheduling. Operating System Concepts Essentials 2 nd Edition

Chapter 6: CPU Scheduling. Operating System Concepts Essentials 2 nd Edition Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time

More information

Lecture 5- CPU Scheduling

Lecture 5- CPU Scheduling Lecture 5- CPU Scheduling Instructor : Bibhas Ghoshal (bibhas.ghoshal@iiita.ac.in) Autumn Semester, 2015 Bibhas Ghoshal IOSY 332C & IOPS 332C: OS Autumn Semester, 2015 1 / 17 Lecture Outline CPU Scheduling

More information

Chapter 6: CPU Scheduling

Chapter 6: CPU Scheduling Department of Electr rical Eng ineering, Chapter 6: CPU Scheduling 王振傑 (Chen-Chieh Wang) ccwang@mail.ee.ncku.edu.tw ncku edu Feng-Chia Unive ersity Outline Basic Concepts Scheduling Criteria Scheduling

More information

Announcements Project #2. Basic Concepts

Announcements Project #2. Basic Concepts Announcements Project #2 Is due at 6:00 PM on Friday Program #3 Posted tomorrow (implements scheduler) Reading Chapter 6 Basic Concepts CPU I/O burst cycle Process execution consists of a cycle of CPU

More information

CPU Scheduling. Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling

CPU Scheduling. Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Basic Concepts An OS must allocate resources amongst competing processes The resource

More information

CPU Scheduling. CS439: Principles of Computer Systems September 7, 2016

CPU Scheduling. CS439: Principles of Computer Systems September 7, 2016 CPU Scheduling CS439: Principles of Computer Systems September 7, 2016 Last Time A process is a unit of execution Defines an address space An abstraction for protection Processes are represented as Process

More information

CPU Scheduling Yi Shi Fall 2015 Xi an Jiaotong University

CPU Scheduling Yi Shi Fall 2015 Xi an Jiaotong University CPU Scheduling Yi Shi Fall 2015 Xi an Jiaotong University Goals for Today CPU Schedulers Scheduling Algorithms Algorithm Evaluation Metrics Algorithm details Thread Scheduling Multiple-Processor Scheduling

More information

CSC 539: Operating Systems Structure and Design. Spring 2006

CSC 539: Operating Systems Structure and Design. Spring 2006 CSC 539: Operating Systems Structure and Design Spring 2006 CPU scheduling historical perspective CPU-I/O bursts preemptive vs. nonpreemptive scheduling scheduling criteria scheduling algorithms: FCFS,

More information

Q. 1 Q. 1 Q. 1 Q. 1. Discuss how the following pairs of scheduling criteria conflict in certain settings.

Q. 1 Q. 1 Q. 1 Q. 1. Discuss how the following pairs of scheduling criteria conflict in certain settings. CPU and response time I/O device and CPU CPU and response time CPU and response time CPU and response time minimize context switching CPU minimize context switching CPU conflict tasks would need to wait

More information

Operating Systems OBJECTIVES 7.1 DEFINITION. Chapter 7. Note:

Operating Systems OBJECTIVES 7.1 DEFINITION. Chapter 7. Note: Chapter 7 OBJECTIVES Operating Systems Define the purpose and functions of an operating system. Understand the components of an operating system. Understand the concept of virtual memory. Understand the

More information

Objectives. Chapter 5: Process Scheduling. Chapter 5: Process Scheduling. 5.1 Basic Concepts. To introduce CPU scheduling

Objectives. Chapter 5: Process Scheduling. Chapter 5: Process Scheduling. 5.1 Basic Concepts. To introduce CPU scheduling Objectives To introduce CPU scheduling To describe various CPU-scheduling algorithms Chapter 5: Process Scheduling To discuss evaluation criteria for selecting the CPUscheduling algorithm for a particular

More information

ECE3055 Computer Architecture and Operating Systems

ECE3055 Computer Architecture and Operating Systems ECE3055 Computer Architecture and Operating Systems Lecture: CPU Scheduling Prof. Hsien-Hsin Hsin Sean Lee School of Electrical and Computer Engineering Georgia Institute of Technology H.-H. S. Lee 1 Overview

More information

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition,

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition, Chapter 6: CPU Scheduling, Silberschatz, Galvin and Gagne 2009 Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Operating

More information

Instituto de Ciências Matemáticas e de Computação Departamento de Sistemas de Computação

Instituto de Ciências Matemáticas e de Computação Departamento de Sistemas de Computação Instituto de Ciências Matemáticas e de Computação Departamento de Sistemas de Computação SSC-0541 Sistemas Operacionais I 2º Semestre 2014 1ª Lista de Exercícios Extraída da 9ª edição em Inglês do Livro

More information

Process and Thread Scheduling. Raju Pandey Department of Computer Sciences University of California, Davis Winter 2005

Process and Thread Scheduling. Raju Pandey Department of Computer Sciences University of California, Davis Winter 2005 Process and Thread Scheduling Raju Pandey Department of Computer Sciences University of California, Davis Winter 2005 Scheduling Context switching an interrupt occurs (device completion, timer interrupt)

More information

Operating System. Lecture Slides By Silberschatz, Galvin & Gagne (8 th Edition) Modified By: Prof. Mitul K. Patel

Operating System. Lecture Slides By Silberschatz, Galvin & Gagne (8 th Edition) Modified By: Prof. Mitul K. Patel Operating System Lecture Slides By Silberschatz, Galvin & Gagne (8 th Edition) Modified By: Prof. Mitul K. Patel Shree Swami Atmanand Saraswati Institute of Technology, Surat January 2012 Outline 1 Chapter

More information

OPERATING SYSTEMS (OPS)

OPERATING SYSTEMS (OPS) Computing Curricula - Computer Engineering Body of Knowledge 1 OPERATING SYSTEMS (OPS) OPS0. History and overview of operating systems [core] OPS1. Operating system function and design [core] OPS2. Operating

More information

Operating Systems, 6 th ed. Test Bank Chapter 7

Operating Systems, 6 th ed. Test Bank Chapter 7 True / False Questions: Chapter 7 Memory Management 1. T / F In a multiprogramming system, main memory is divided into multiple sections: one for the operating system (resident monitor, kernel) and one

More information

Department of Information Technology. Operating Systems III B.Tech -I Sem

Department of Information Technology. Operating Systems III B.Tech -I Sem Department of Information Technology Operating Systems III B.Tech -I Sem K.Roshan Assoc. Professor J.B.Institute of Engg & Technology Yenkapally, Moinabad(Mandal) Himathnagar(post),Hydreabad Results Target

More information

Chapter 6 Concurrency: Deadlock and Starvation

Chapter 6 Concurrency: Deadlock and Starvation Operating Systems: Internals and Design Principles, 6/E William Stallings Chapter 6 Concurrency: Deadlock and Starvation Dave Bremer Otago Polytechnic, N.Z. 2008, Prentice Hall Roadmap Principals of Deadlock

More information

Chapter 5: CPU Scheduling!

Chapter 5: CPU Scheduling! Chapter 5: CPU Scheduling! Basic Concepts! Scheduling Criteria! Scheduling Algorithms! Multiple-Processor Scheduling! Real-Time Scheduling! Algorithm Evaluation! 6.1! Basic Concepts! Long-term scheduler

More information

CS420: Operating Systems

CS420: Operating Systems CPU Scheduling James Moscola Department of Engineering & Computer Science York College of Pennsylvania Based on Operating System Concepts, 9th Edition by Silberschatz, Galvin, Gagne Scheduling Concepts

More information

Objectives. Chapter 5: CPU Scheduling. CPU Scheduler. Non-preemptive and preemptive. Dispatcher. Alternating Sequence of CPU And I/O Bursts

Objectives. Chapter 5: CPU Scheduling. CPU Scheduler. Non-preemptive and preemptive. Dispatcher. Alternating Sequence of CPU And I/O Bursts Objectives Chapter 5: CPU Scheduling Introduce CPU scheduling, which is the basis for multiprogrammed operating systems Describe various CPU-scheduling algorithms Discuss evaluation criteria for selecting

More information

Scheduling for uniprocessor systems Introduction

Scheduling for uniprocessor systems Introduction Politecnico di Milano Introduction Lecturer: William Fornaciari Politecnico di Milano william.fornaciari@elet.polimi.it Home.dei.polimi.it/fornacia SUMMARY Basic Concepts Scheduling Criteria Scheduling

More information

Lesson 3: Processes, Threads & CPU Scheduling

Lesson 3: Processes, Threads & CPU Scheduling Lesson 3: Processes, Threads & CPU Scheduling Contents The concept of computing Process Process states and life-cycle CPU Scheduling considerations Processes hierarchy Process creation and termination

More information

Threads & Introduction to CPU Scheduling

Threads & Introduction to CPU Scheduling Threads & Introduction to CPU Scheduling Mohammad S. Hasan Staffordshire University, UK Threads & Introduction to CPU Scheduling Slide 1 Lecture Outline Definition of a thread and types CPU -I/O burst

More information

CPU Scheduling: Basic Concepts

CPU Scheduling: Basic Concepts CPU Scheduling: Basic Concepts Idea: Maximum CPU utilization obtained with multiprogramming" CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait" Dispatcher grants CPU

More information

Chapter 5: CPU Scheduling

Chapter 5: CPU Scheduling Chapter 5: CPU Scheduling Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Thread Scheduling Operating Systems Examples

More information

Operating Systems Fall 2012 Lecture 4: CPU Scheduling

Operating Systems Fall 2012 Lecture 4: CPU Scheduling 482000000000357 Operating Systems Fall 2012 Lecture 4: CPU Scheduling Assist. Prof. Ediz ŞAYKOL ediz.saykol@beykent.edu.tr Operating System - Main Goals Interleave the execution of the number of processes

More information