Computer Hardware and System Software Concepts

Size: px
Start display at page:

Download "Computer Hardware and System Software Concepts"

Transcription

1 Computer Hardware and System Software Concepts Introduction to concepts of Operating System (Process & File Management) Welcome to this course on Computer Hardware and System Software Concepts 1

2 RoadMap Introduction to Process Management Introduction to File Management 2 Day3 Introduce Process Management To introduce the following: Process Process state transition Scheduling Introduce File Management Illustrate the concept of storage structure with respect to DOS and Unix file system ( elementary) 2

3 Operating System Process Management The job of process management is to take care of issues like life-cycle of a process (creation, control and termination), scheduling, timing the process etc. 3

4 Process Management Functions: To keep track of the status of each process To suspend and choose some processes based on some criteria To coordinate interprocess communication 4 We are going to focus on what are processes, what is the state of a process and how are processes scheduled in the next few slides. 4

5 Some concepts Processor Hardware component that is capable of executing instructions Process An instance of a program in execution Is an active entity whereas a program is a passive entity Needs certain resources for execution in which a processor is one of them 5 The computer system today allows multiple programs to be loaded into memory and to be executed concurrently but at one point of time only one program is in execution or rather at most one instruction is executed on behalf of the process. A program is a passive entity. For e.g. the contents of a file stored on a disk. A process is an active entity it has a PC (program counter) which specifies the next instruction to execute. There may be two processes associated with the same program but they are considered to be two different execution processes. For e.g one user invoking many copies of the editor program. 5

6 Structure of a process Code Region : Contains the executable instructions of the process Data Region : Holds the data areas used by the process Stack Region : Holds the dynamic data such as local data in a procedure,arguments to a procedure/function etc. Program Counter (PC): The PC gives the address of the next instruction to be executed by the process. 6 We all know that the executable code is a sequence of binary stuff. This is a passive code and and has no life. However, the moment it becomes a process it has life in it. There are three logical components in it. Code Region It contains the executable instructions of the process i.e it contains the current activity as represented by the value of the program counter and the contents of the processor s registers. Data Region Contains the data areas used by the process which is again divided into initialized and un-initialized part. For e.g all global variables are stored in data region Stack Region A process also includes process stack which contains temporary data such as subroutine parameters, return addresses and temporary variables. 6

7 States of a process New : Created Ready : Assign a process to a processor Run : Instruction execution Blocked : For an event to occur (Eg.I/O) Terminated : Finished execution 7 Here, the instructor must draw the state diagram in a piecemeal fashion slowly adding the complexity and inviting more questions. New Here the operating system recognizes the process but does not assign resources to it. Ready The process is ready/waiting to be assigned to a processor. Run When a process is selected by the CPU for execution, it moves to the run state. Blocked When a process is waiting for some event to occur, say for e.g I/O completion or reception of a signal then it is in the blocked state i.e. when a running process does not have immediate access to a resource it is said to be in the blocked state. Terminated This is the state reached when the process finishes execution. 7

8 State transitions of a process Batch job enters system interactive job enters system dispatch INPUT READY scheduler Remove wakeup BLOCKED terminate RUN OUTPUT Interactive job leaves system Batch job leaves system 8 The states are shown in boxes and the state transitions are indicated on the edges. When a job enters the system, it is in the INPUT stage. Thereafter, resources are assigned to it and it moves to the READY state. The moment the processor picks its up for execution, then it goes to the RUN state. If it finishes execution then it goes to the OUTPUT or FINISHED state. In the RUN state, if the process requires I/O or has to wait for some other resource, then it goes to the BLOCKED state. Once it has got the required resource or I/O is over, then it goes to the READY state again from the BLOCKED state and has to wait for the processor to pick it up to go to the RUN state and the same cycle follows. There can be more than one processes in the READY state where as there can be only one process in the RUN state. 8

9 Context switching The task of switching the CPU to another process by saving the state of the old process and loading the saved state of the new process is known as context switching Context switching Keeps the CPU busy all the time Occurs when any of the following situations is encountered An I/O operation is initiated An interrupt occurs An I/O is completed A process terminates 9 Context switching is a overhead as the system does not do any useful work while switching. Its speed varies from machine to machine depends upon the memory speed, the no. of registers to be copied etc. Since at any point of time there could be more than one process waiting to be serviced by the CPU, these have to be put in hold at some place. A queue is a place where the IN and OUT of the process is controlled. There are different queues for different purposes. Example: I/O Queue If the process is waiting for an I/O operation to complete, then it goes to the I/O queue. Job queue A process entering the system for the first time goes into the Job queue. 9

10 Concurrent processes Concurrent processes execute in operating systems and can be of two types viz., Independent Co-operating Independent process - are those processes which cannot affect or be affected by other processes executing in the system. 10 Independent process are those processes which cannot affect or be affected by other processes executing in the system. They do not share any data with any other process. Co-operating process are those processes which can affect or be affected by other processes executing in the system. They can share data with any other process. 10

11 Co-operating processes Benefits Sharing of information Computation speed-up Modularity Convenience Communication Message passing Shared memory 11 Information sharing - Several users may be wanting to use the same file. In such cases, it is ideal to provide an environment to allow concurrent access to such resources. Computation speed-up To speed-up a particular task, we can break it into several sub-tasks each of which would be executing in parallel with the others. NOTE: This would require multiple CPUs and I/O channels. Modularity The user might want to construct the system in a modular fashion by dividing the system s functions into separate processes. Convenience A user too might have many tasks to do at the same time say for e.g. User X might be compiling, printing and editing at the same time. Communication: Message Passing In order to exchange messages, there must be at least two operations available with the processes such as send and receive. The two processes communicating with each other should agree with certain logical issues such as how to establish links, can the same link be associated with more than one process, is the link unidirectional or bi-directional etc. Shared Memory Processes also can communicate by sharing memory. In these cases, the computers are usually in close proximity. 11

12 Some concepts Uniprogramming Multiprogramming Multiprocessing Multitasking 12 Uniprogramming There is only one processor that processes only one job at a time. Multiprogramming - There is only one processor but can be multiple processes running Multiprocessing - There is only one processor but can be multiple processes running Multitasking Systems execute many programs concurrently Residence of many programs in the memory One program runs at any point of time Other programs potentially can run 12

13 Scheduling Policy to decide which ready process is to be picked up next. Criteria which lets a particular policy to be chosen are the following: CPU Utilisation Throughput Turnaround time Waiting time Response time 13 How is it different from context switching? Context-switching + some more information = Scheduling. Context switching merely states that CPU makes a transition to another process. The question as which another process is decided by a policy and that is all about scheduling CPU Utilisation - What percentage of CPU is being under utilization Throughput - Indicates how many processes have been through per unit time Turnaround time - Time span between submission of a job till it gets completed Waiting time - Sum of all the individual times spent in the ready queue Response time - Time from submission of the request until the first response is produced. Mainly useful in an interactive environment 13

14 Scheduling policy Scheduling policies are of two categories Non-Preemptive scheduling Preemptive scheduling 14 The CPU scheduling decisions usually takes place under the following conditions: 1. When a process switches from the RUN state to the BLOCKED state. 2. When a process switches from the RUN state to the READY state. 3. When a process switches from the BLOCKED state to the READY state. 4. When a process terminates The scheduling scheme is non-preemptive for case 1 and 4 else it is preemptive. 14

15 Non-preemptive scheduling CPU is allocated to a process till the job is over or incurs an I/O wait Example FCFS ( First Come First Serve ) Disadvantage Monopoly of the process 15 In non-preemptive scheduling, the process cannot forcibly loose the processor. The CPU is allocated to a processor till it gets over or incurs an I/O wait. The main disadvantage is monopoly of a process as a single process can draw all the attention of the CPU maliciously or otherwise. 15

16 Example Find the average waiting time for FCFS for the following processes whose CPU time is given below: P1 6 ms P2 8 ms P3 7 ms P4 3 ms 16 Solution: Waiting time for P1 = 0ms Waiting time for P2 = 6ms Waiting time for P3 = 14ms Waiting time for P4 = 21ms Average waiting time = 41/4 = 10.25ms 16

17 Preemptive scheduling Fixed time slice is specified during which a process gets attention If the process gets terminated before the time slice then CPU makes a context switch Example Round Robin Shortest Job First(SJF) 17 Round Robin: It is similar to FCFS scheduling only pre-emption is added to switch between processes. In this scheme, a time quantum (say 1 ms) is defined. A ready queue is treated as a circular queue and the CPU scheduler goes around the ready queue, allocating the CPU to each process for a time interval upto 1 ms. To implement RR scheduling the ready queue is kept as a FIFO queue of processes. New processes are added to the tail of the queue. The CPU scheduler picks the first process from the ready queue, sets the timer to interrupt after 1 ms and dispatches the process. If the process has a CPU burst of time less than 1 ms, the process itself will release the CPU voluntarily and the scheduler will pick up the next process in the ready queue. If the CPU burst of the current process is more than the allocated time quantum, then the timer associated with the process will be off and will cause an interrupt to the OS. The context switch will be executed and the process will be put at the tail of the ready queue. The CPU scheduler will select the next process in the ready queue. SJF: The SJF algorithm may be either preemptive or non-preemptive. The choice arises when a new process arrives at the ready queue while the previous process is executing. The new process might have a shorter next CPU burst than what is left of the currently executing process. A preemptive SJF algorithm will preempt the currently executing process where as a non-preemptive SJF algorithm will allow the currently running process to finish the CPU burst. A preemptive SJF algorithm is also known as shortest remaining time first algorithm. 17

18 Operating System File Management 18

19 File Management Part of the Operating System that deals with effective information management Features: Minimal I/O operations on files Flexibility between logical and physical block size Automatic allocation of file space Flexible file naming facility such as links, aliases etc 19 19

20 File systems MSDOS - file system UNIX - file system 20 We will look at case study of the two file systems viz., MS-DOS file system and UNIX file system. The moment we turn the computer on, the computer loads a special program called the operating system into the computer s memory which provides an environment for us to run other programs. The OS provides an interface between the application programs and the hardware. DOS (Disk Operating System) is the operating system for IBM PCs and PCcompatibles. There are 2 flavors of DOS viz., PC-DOS and MS-DOS. PC-DOS is mainly for IBM PCs where as MS-DOS is licensed by Microsoft for PC-compatibles. From the user perspective, there is no difference. 20

21 MS DOS-File system MS-DOS has a tree structure i.e. files are organized on each logical drive within a hierarchical directory structure. Root directory is the top directory which holds numerous files and subdirectories. 21 When one first formats a disk, DOS creates a single directory on the disk known as root directory. This directory is so named because all the directories which are created later grow from the root, just like the branches of a tree. Let us take the example of a cabinet as an analogy. We can simply put a number of files in the cabinet or we can create a number of drawers (compartments) in the cabinet. This would help to organize the files properly. The cabinet can be considered as the root directory and the drawers as directories the purpose is essentially the same i.e it helps to organize information. DOS uses the backslash character (\) to represent directory or sub-directory. The root directory, also known as home directory is represented by backslash (\) alone. This is the default directory if no name is specified after the backslash. DOS selects one disk drive as the current drive or current directory unless specified otherwise. The current directory can also be changed with the CHDIR command. 21

22 MS DOS-File system Naming convention in DOS consists of Logical drive Path Filename Example: C:\ER\CHSSC\CHAPTER.DOC 22 Drivename : C Pathname: 2 directories viz., ER & CHSSC Filename: CHAPTER.DOC 22

23 MS DOS Data access Basic allocation units of each drive- CLUSTERS chkdsk is used to find the cluster size in a system Each drive has a file-allocation table (FAT) FAT is a roadmap that DOS follows to locate the clusters belonging to a particular file. 23 This topic deals with how files are organized in the hard disk and how a user can access them. The operating system allocates disk space on demand by user programs. A disk is divided into sectors and tracks. Each sector is usually 512 bytes. Normally, the space is allocated in units of fixed size known as clusters. A cluster is a multiple of sector size i.e. multiples of 512 bytes say 512, 1024, 2048 bytes etc. When a user creates a directory, DOS allocates a cluster to hold the directory entries. Each directory entry requires 32 bytes. If a disk uses 2048-byte clusters (assuming), a single cluster can hold 64 directory entries(2048/32). Now, if the directory contains more than 64 entries, DOS must allocate a second cluster. Thus, DOS stores files on disks in groups of sectors called clusters or allocation units. The file may fit in a single cluster or a group of clusters depending on the file s size. DOS tries to store the clusters belonging to a particular file in consecutive disk locations as far as possible. However, in some cases, the clusters of another file may prevent DOS from using consecutive locations. 23

24 MS DOS Data access The entry in the FAT corresponding to each cluster contains a value that indicates:» which cluster is unused» which cluster is reserved» which cluster considered as a bad cluster» the number of next cluster in the file» the last cluster of the file 24 24

25 How to access the contents of a file? mydoc txt 5456 bytes FFFF 0000 CLUSTERS FAT ENTRIES 25 The diagram in the slide above shows how to access the contents of a file. This shows the directory entry of a file mydoc.txt of 5456 bytes which begins with entry no. 3 which is the cluster no. of the first cluster of the file. Location 3 above stores the value Location 6 stores the value Location 7 stores the value FFFF which implies that it is the end of the file. Thus by accessing the FAT table, we can say that the contents of mydoc. txt file are there in cluster nos. 3, 6 and 7. 25

26 Volume structure in MS-DOS Boot-sector : Contains a bootstrap loader and disk characteristics FAT : Main file allocation table Additional FAT : used for recovery during the failure of main FAT Root directory : It is in a fixed position of fixed size File space : Rest of disk space which is available for files and sub-directories. 26 The boot sector contains details about the characteristics of a disk and a bootstrap loader. When the computer is switched on first, the boot sector is automatically read from the disk by the ROM start up program and executed. This causes an immediate jump to the bootstrap loader code, which in turn finds the operating system files, MS-DOS.SYS and IO.SYS in the root directory. These are loaded into the memory and executed which in turn makes the operating system operational. 26

27 File permissions in MS-DOS read-only : a file cannot be written or deleted hidden : such files ignored by many commands system : such files sre system files ( OS related files) archive : used for back-up 27 In DOS, the command attrib will show the permissions attached to a file. A file can have the following attributes viz., Read-only Hidden System Archive Security feature is very poor in DOS 27

28 UNIX File system UNIX has multiple file systems A file system is a formatted partition of the disk Is a group of files having relevant information There is always one compulsory file system known as the root. 28 The origin of UNIX can be traced back to 1965, Bell Telephone Laboratories, General Electric Company and MIT took up a joint venture to develop an operating system that could serve a large community of users and also allow them to share data. A hard disk may comprise of a single file system or it can also be partitioned to house several file systems. The reverse is however not true. No file system can be split over two different disks. One file system called as root is compulsory; others can be created by the administrator and mounted at some point in the hierarchy before use. 28

29 Volume structure in UNIX Boot block : occupies the beginning of the root file system Super block : Has the state of the file-its size,where to find the free space on the file system,how many files it can store etc. Inode list : It follows the super block-give the internal representation of the file Data Block : Contains data.( Size of the blocks can vary from 512 bytes to 4K) 29 The UNIX file system is somewhat different from the MS-DOS file system. The disk space allotted to a UNIX file system is made of blocks of usually 512 bytes. All the blocks belonging to a file are divided into four parts viz., Boot Block - occupies the beginning of the root file system and contains a program called bootstrap loader. This program is executed when the host machine is booted. Super Block - Has the state of the file-its size, where to find the free space on the file system, how many files it can store etc. Inode Table UNIX treats everything it knows and understands as files. The information related to these files is stored in a table known as Inode Table on the disk. For each file, there is an inode entry in the table. Each entry is approx 64 bytes and contains details such as Owner of the file Type of the file File access permissions File access time Size of the file Date and time of last access etc Data Block contains the actual file contents. An allocated block can belong to only one file in the file system. 29

30 Inode pointer structure INODE DATA BLOCKS Direct 0 Direct 1 Direct 9 Single indirect Double indirect Triple indirect Each inode entry in the inode table consists of 13 addresses each. These addresses specify where exactly the contents of the file are stored on the disk. These addresses are numbered 0 to 12. The first ten adddresses viz., 0 to 9 point to 1 KB blocks on disk and thus can handle a file size upto 10 KB. The 11 th entry contains the address of a 1KB block. (This block does not contain the file contents).this block contains 256 more slots or addresses each of which in turn can point to a 1 KB block on disk. The maximum size that can be addressed using the 10 th entry is 256 KB. This is called Single Indirection. The 12 th address in the inode table points to a block of 256 addresses each of which in turn again points to another set of 256 addresses. These addresses point to 1 KB data chunks. Thus the maximum file size accessible by this is 256 * 256 i.e. 64 MB. This is known as Double Indirection. Similarly, the maximum file size accessible by the 13 th address in the inode table is 256*256*256 i.e. 16GB. This is known as Triple Indirection. Thus, together the maximum file size that UNIX can provide is 10 KB KB + 64 MB + 16 GB which is quite vast. 30

31 Types of users in UNIX OWNER : the owner of the file GROUP : all members in the group OTHERS : all other users in the environment Categories of file permissions Read only Write only Execute only 31 There are 3 types of users in Unix viz., Owner Group Others For each of the above categories, following permissions can be attached i.e. Read only denoted by r Write only denoted by w Execute only denoted by x Example: If all the users are given all the permissions then the file will show the permissions as rwxrwxrwx. The first three slots are for the owner, the next three for the group and the last three for others. If the owner decides to have read, write and execute permissions only for himself and only read permission to others then the file will have rwxr r permissions. 31

32 Operating System THE END 32

History. 5/1/2006 Computer System Software CS012 BE 7th Semester 2

History. 5/1/2006 Computer System Software CS012 BE 7th Semester 2 Unix File System History The origin of UNIX can be traced back to 1965, Bell Telephone Laboratories, General Electric Company and MIT took up a joint venture to develop an operating system that could serve

More information

DOS. 5/1/2006 Computer System Software CS 012 BE 7th Semester 2

DOS. 5/1/2006 Computer System Software CS 012 BE 7th Semester 2 DOS File System DOS The moment we turn the computer on, the computer loads a special program called the operating system into the computer s memory which provides an environment for us to run other programs.

More information

Process- Concept &Process Scheduling OPERATING SYSTEMS

Process- Concept &Process Scheduling OPERATING SYSTEMS OPERATING SYSTEMS Prescribed Text Book Operating System Principles, Seventh Edition By Abraham Silberschatz, Peter Baer Galvin and Greg Gagne PROCESS MANAGEMENT Current day computer systems allow multiple

More information

Chapter 5: CPU Scheduling

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

More information

Processes. CS 475, Spring 2018 Concurrent & Distributed Systems

Processes. CS 475, Spring 2018 Concurrent & Distributed Systems Processes CS 475, Spring 2018 Concurrent & Distributed Systems Review: Abstractions 2 Review: Concurrency & Parallelism 4 different things: T1 T2 T3 T4 Concurrency: (1 processor) Time T1 T2 T3 T4 T1 T1

More information

CHAPTER 2: PROCESS MANAGEMENT

CHAPTER 2: PROCESS MANAGEMENT 1 CHAPTER 2: PROCESS MANAGEMENT Slides by: Ms. Shree Jaswal TOPICS TO BE COVERED Process description: Process, Process States, Process Control Block (PCB), Threads, Thread management. Process Scheduling:

More information

Ch 4 : CPU scheduling

Ch 4 : CPU scheduling Ch 4 : CPU scheduling It's the basis of multiprogramming operating systems. By switching the CPU among processes, the operating system can make the computer more productive In a single-processor system,

More information

Operating Systems. Figure: Process States. 1 P a g e

Operating Systems. Figure: Process States. 1 P a g e 1. THE PROCESS CONCEPT A. The Process: A process is a program in execution. A process is more than the program code, which is sometimes known as the text section. It also includes the current activity,

More information

Welcome to this course on Operating System Concepts

Welcome to this course on Operating System Concepts Welcome to this course on Operating System Concepts 1 2 3 4 6 8 12 13 Operating System is a set of system programs which provides an environment to help the user to execute the programs. The OS is

More information

UNIT:2. Process Management

UNIT:2. Process Management 1 UNIT:2 Process Management SYLLABUS 2.1 Process and Process management i. Process model overview ii. Programmers view of process iii. Process states 2.2 Process and Processor Scheduling i Scheduling Criteria

More information

1.1 CPU I/O Burst Cycle

1.1 CPU I/O Burst Cycle PROCESS SCHEDULING ALGORITHMS As discussed earlier, in multiprogramming systems, there are many processes in the memory simultaneously. In these systems there may be one or more processors (CPUs) but the

More information

Chap 7, 8: Scheduling. Dongkun Shin, SKKU

Chap 7, 8: Scheduling. Dongkun Shin, SKKU Chap 7, 8: Scheduling 1 Introduction Multiprogramming Multiple processes in the system with one or more processors Increases processor utilization by organizing processes so that the processor always has

More information

CPU scheduling. Alternating sequence of CPU and I/O bursts. P a g e 31

CPU scheduling. Alternating sequence of CPU and I/O bursts. P a g e 31 CPU scheduling CPU scheduling is the basis of multiprogrammed operating systems. By switching the CPU among processes, the operating system can make the computer more productive. In a single-processor

More information

CS370: System Architecture & Software [Fall 2014] Dept. Of Computer Science, Colorado State University

CS370: System Architecture & Software [Fall 2014] Dept. Of Computer Science, Colorado State University Frequently asked questions from the previous class survey CS 370: SYSTEM ARCHITECTURE & SOFTWARE [CPU SCHEDULING] Shrideep Pallickara Computer Science Colorado State University OpenMP compiler directives

More information

OPERATING SYSTEMS. COMS W1001 Introduction to Information Science. Boyi Xie

OPERATING SYSTEMS. COMS W1001 Introduction to Information Science. Boyi Xie 1 OPERATING SYSTEMS COMS W1001 Introduction to Information Science Boyi Xie 2 Announcement Homework 1 is available Grace days A total of 5 days for 5 HWs If all grace days have been used, 50% of the points

More information

Lecture 17: Threads and Scheduling. Thursday, 05 Nov 2009

Lecture 17: Threads and Scheduling. Thursday, 05 Nov 2009 CS211: Programming and Operating Systems Lecture 17: Threads and Scheduling Thursday, 05 Nov 2009 CS211 Lecture 17: Threads and Scheduling 1/22 Today 1 Introduction to threads Advantages of threads 2 User

More information

CS 3733 Operating Systems

CS 3733 Operating Systems What will be covered in MidtermI? CS 3733 Operating Systems Instructor: Dr. Tongping Liu Department Computer Science The University of Texas at San Antonio Basics of C programming language Processes, program

More information

COSC243 Part 2: Operating Systems

COSC243 Part 2: Operating Systems COSC243 Part 2: Operating Systems Lecture 17: CPU Scheduling Zhiyi Huang Dept. of Computer Science, University of Otago Zhiyi Huang (Otago) COSC243 Lecture 17 1 / 30 Overview Last lecture: Cooperating

More information

Preview. Process Scheduler. Process Scheduling Algorithms for Batch System. Process Scheduling Algorithms for Interactive System

Preview. Process Scheduler. Process Scheduling Algorithms for Batch System. Process Scheduling Algorithms for Interactive System Preview Process Scheduler Short Term Scheduler Long Term Scheduler Process Scheduling Algorithms for Batch System First Come First Serve Shortest Job First Shortest Remaining Job First Process Scheduling

More information

OPERATING SYSTEMS. After A.S.Tanenbaum, Modern Operating Systems, 3rd edition. Uses content with permission from Assoc. Prof. Florin Fortis, PhD

OPERATING SYSTEMS. After A.S.Tanenbaum, Modern Operating Systems, 3rd edition. Uses content with permission from Assoc. Prof. Florin Fortis, PhD OPERATING SYSTEMS #5 After A.S.Tanenbaum, Modern Operating Systems, 3rd edition Uses content with permission from Assoc. Prof. Florin Fortis, PhD General information GENERAL INFORMATION Cooperating processes

More information

CS3733: Operating Systems

CS3733: Operating Systems CS3733: Operating Systems Topics: Process (CPU) Scheduling (SGG 5.1-5.3, 6.7 and web notes) Instructor: Dr. Dakai Zhu 1 Updates and Q&A Homework-02: late submission allowed until Friday!! Submit on Blackboard

More information

Lecture Topics. Announcements. Today: Uniprocessor Scheduling (Stallings, chapter ) Next: Advanced Scheduling (Stallings, chapter

Lecture Topics. Announcements. Today: Uniprocessor Scheduling (Stallings, chapter ) Next: Advanced Scheduling (Stallings, chapter Lecture Topics Today: Uniprocessor Scheduling (Stallings, chapter 9.1-9.3) Next: Advanced Scheduling (Stallings, chapter 10.1-10.4) 1 Announcements Self-Study Exercise #10 Project #8 (due 11/16) Project

More information

OPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5

OPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5 OPERATING SYSTEMS CS3502 Spring 2018 Processor Scheduling Chapter 5 Goals of Processor Scheduling Scheduling is the sharing of the CPU among the processes in the ready queue The critical activities are:

More information

Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras

Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras Week 05 Lecture 18 CPU Scheduling Hello. In this lecture, we

More information

CPU Scheduling. CSE 2431: Introduction to Operating Systems Reading: Chapter 6, [OSC] (except Sections )

CPU Scheduling. CSE 2431: Introduction to Operating Systems Reading: Chapter 6, [OSC] (except Sections ) CPU Scheduling CSE 2431: Introduction to Operating Systems Reading: Chapter 6, [OSC] (except Sections 6.7.2 6.8) 1 Contents Why Scheduling? Basic Concepts of Scheduling Scheduling Criteria A Basic Scheduling

More information

Frequently asked questions from the previous class survey

Frequently asked questions from the previous class survey CS 370: OPERATING SYSTEMS [CPU SCHEDULING] Shrideep Pallickara Computer Science Colorado State University L14.1 Frequently asked questions from the previous class survey Turnstiles: Queue for threads blocked

More information

Subject Teacher: Prof. Sheela Bankar

Subject Teacher: Prof. Sheela Bankar Peoples Empowerment Group ISB&M SCHOOL OF TECHNOLOGY, NANDE, PUNE DEPARTMENT OF COMPUTER ENGINEERING Academic Year 2017-18 Subject: SP&OS Class: T.E. computer Subject Teacher: Prof. Sheela Bankar 1. Explain

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 9 Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 CPU Scheduling: Objectives CPU scheduling,

More information

Unit 3 : Process Management

Unit 3 : Process Management Unit : Process Management Processes are the most widely used units of computation in programming and systems, although object and threads are becoming more prominent in contemporary systems. Process management

More information

CPU Scheduling (1) CPU Scheduling (Topic 3) CPU Scheduling (2) CPU Scheduling (3) Resources fall into two classes:

CPU Scheduling (1) CPU Scheduling (Topic 3) CPU Scheduling (2) CPU Scheduling (3) Resources fall into two classes: CPU Scheduling (Topic 3) 홍성수 서울대학교공과대학전기공학부 Real-Time Operating Systems Laboratory CPU Scheduling (1) Resources fall into two classes: Preemptible: Can take resource away, use it for something else, then

More information

CSC 553 Operating Systems

CSC 553 Operating Systems CSC 553 Operating Systems Lecture 12 - File Management Files Data collections created by users The File System is one of the most important parts of the OS to a user Desirable properties of files: Long-term

More information

Introduction to OS. File Management. MOS Ch. 4. Mahmoud El-Gayyar. Mahmoud El-Gayyar / Introduction to OS 1

Introduction to OS. File Management. MOS Ch. 4. Mahmoud El-Gayyar. Mahmoud El-Gayyar / Introduction to OS 1 Introduction to OS File Management MOS Ch. 4 Mahmoud El-Gayyar elgayyar@ci.suez.edu.eg Mahmoud El-Gayyar / Introduction to OS 1 File Management Objectives Provide I/O support for a variety of storage device

More information

OPERATING SYSTEMS. UNIT II Sections A, B & D. An operating system executes a variety of programs:

OPERATING SYSTEMS. UNIT II Sections A, B & D. An operating system executes a variety of programs: OPERATING SYSTEMS UNIT II Sections A, B & D PREPARED BY ANIL KUMAR PRATHIPATI, ASST. PROF., DEPARTMENT OF CSE. PROCESS CONCEPT An operating system executes a variety of programs: Batch system jobs Time-shared

More information

Last Class: Processes

Last Class: Processes Last Class: Processes A process is the unit of execution. Processes are represented as Process Control Blocks in the OS PCBs contain process state, scheduling and memory management information, etc A process

More information

COMP 3361: Operating Systems 1 Final Exam Winter 2009

COMP 3361: Operating Systems 1 Final Exam Winter 2009 COMP 3361: Operating Systems 1 Final Exam Winter 2009 Name: Instructions This is an open book exam. The exam is worth 100 points, and each question indicates how many points it is worth. Read the exam

More information

Process Scheduling Part 2

Process Scheduling Part 2 Operating Systems and Computer Networks Process Scheduling Part 2 pascal.klein@uni-due.de Alexander Maxeiner, M.Sc. Faculty of Engineering Agenda Process Management Time Sharing Synchronization of Processes

More information

CSE120 Principles of Operating Systems. Prof Yuanyuan (YY) Zhou Scheduling

CSE120 Principles of Operating Systems. Prof Yuanyuan (YY) Zhou Scheduling CSE120 Principles of Operating Systems Prof Yuanyuan (YY) Zhou Scheduling Announcement l Homework 2 due on October 26th l Project 1 due on October 27th 2 Scheduling Overview l In discussing process management

More information

3.1 (a) The Main Features of Operating Systems

3.1 (a) The Main Features of Operating Systems Chapter 3.1 The Functions of Operating Systems 3.1 (a) The Main Features of Operating Systems The operating system (OS) must provide and manage hardware resources as well as provide an interface between

More information

General Objectives: To understand the process management in operating system. Specific Objectives: At the end of the unit you should be able to:

General Objectives: To understand the process management in operating system. Specific Objectives: At the end of the unit you should be able to: F2007/Unit5/1 UNIT 5 OBJECTIVES General Objectives: To understand the process management in operating system Specific Objectives: At the end of the unit you should be able to: define program, process and

More information

Operating System Concepts Ch. 5: Scheduling

Operating System Concepts Ch. 5: Scheduling Operating System Concepts Ch. 5: Scheduling Silberschatz, Galvin & Gagne Scheduling In a multi-programmed system, multiple processes may be loaded into memory at the same time. We need a procedure, or

More information

Scheduling of processes

Scheduling of processes Scheduling of processes Processor scheduling Schedule processes on the processor to meet system objectives System objectives: Assigned processes to be executed by the processor Response time Throughput

More information

Lecture 5 / Chapter 6 (CPU Scheduling) Basic Concepts. Scheduling Criteria Scheduling Algorithms

Lecture 5 / Chapter 6 (CPU Scheduling) Basic Concepts. Scheduling Criteria Scheduling Algorithms Operating System Lecture 5 / Chapter 6 (CPU Scheduling) Basic Concepts Scheduling Criteria Scheduling Algorithms OS Process Review Multicore Programming Multithreading Models Thread Libraries Implicit

More information

Lecture 2 Process Management

Lecture 2 Process Management Lecture 2 Process Management Process Concept An operating system executes a variety of programs: Batch system jobs Time-shared systems user programs or tasks The terms job and process may be interchangeable

More information

Course Syllabus. Operating Systems

Course Syllabus. Operating Systems Course Syllabus. Introduction - History; Views; Concepts; Structure 2. Process Management - Processes; State + Resources; Threads; Unix implementation of Processes 3. Scheduling Paradigms; Unix; Modeling

More information

CSE 120 Principles of Operating Systems Spring 2017

CSE 120 Principles of Operating Systems Spring 2017 CSE 120 Principles of Operating Systems Spring 2017 Lecture 5: Scheduling Administrivia Homework #1 due tomorrow Homework #2 out tomorrow October 20, 2015 CSE 120 Lecture 8 Scheduling and Deadlock 2 Scheduling

More information

Processes and Threads

Processes and Threads OPERATING SYSTEMS CS3502 Spring 2018 Processes and Threads (Chapter 2) Processes Two important types of dynamic entities in a computer system are processes and threads. Dynamic entities only exist at execution

More information

CPU Scheduling. Rab Nawaz Jadoon. Assistant Professor DCS. Pakistan. COMSATS, Lahore. Department of Computer Science

CPU Scheduling. Rab Nawaz Jadoon. Assistant Professor DCS. Pakistan. COMSATS, Lahore. Department of Computer Science CPU Scheduling Rab Nawaz Jadoon DCS COMSATS Institute of Information Technology Assistant Professor COMSATS, Lahore Pakistan Operating System Concepts Objectives To introduce CPU scheduling, which is the

More information

CPU Scheduling. Schedulers. CPSC 313: Intro to Computer Systems. Intro to Scheduling. Schedulers in the OS

CPU Scheduling. Schedulers. CPSC 313: Intro to Computer Systems. Intro to Scheduling. Schedulers in the OS Schedulers in the OS Scheduling Structure of a Scheduler Scheduling = Selection + Dispatching Criteria for scheduling Scheduling Algorithms FIFO/FCFS SPF / SRTF Priority - Based Schedulers start long-term

More information

CPU Scheduling. Operating Systems (Fall/Winter 2018) Yajin Zhou ( Zhejiang University

CPU Scheduling. Operating Systems (Fall/Winter 2018) Yajin Zhou (  Zhejiang University Operating Systems (Fall/Winter 2018) CPU Scheduling Yajin Zhou (http://yajin.org) Zhejiang University Acknowledgement: some pages are based on the slides from Zhi Wang(fsu). Review Motivation to use threads

More information

Memory Management. 3. What two registers can be used to provide a simple form of memory protection? Base register Limit Register

Memory Management. 3. What two registers can be used to provide a simple form of memory protection? Base register Limit Register Memory Management 1. Describe the sequence of instruction-execution life cycle? A typical instruction-execution life cycle: Fetches (load) an instruction from specific memory address. Decode the instruction

More information

Operating Systems Unit 3

Operating Systems Unit 3 Unit 3 CPU Scheduling Algorithms Structure 3.1 Introduction Objectives 3.2 Basic Concepts of Scheduling. CPU-I/O Burst Cycle. CPU Scheduler. Preemptive/non preemptive scheduling. Dispatcher Scheduling

More information

Properties of Processes

Properties of Processes CPU Scheduling Properties of Processes CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait. CPU burst distribution: CPU Scheduler Selects from among the processes that

More information

CPU Scheduling Algorithms

CPU Scheduling Algorithms CPU Scheduling Algorithms Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating Systems Concepts with Java, by Silberschatz, Galvin, and Gagne (2007).

More information

Review. Preview. Three Level Scheduler. Scheduler. Process behavior. Effective CPU Scheduler is essential. Process Scheduling

Review. Preview. Three Level Scheduler. Scheduler. Process behavior. Effective CPU Scheduler is essential. Process Scheduling Review Preview Mutual Exclusion Solutions with Busy Waiting Test and Set Lock Priority Inversion problem with busy waiting Mutual Exclusion with Sleep and Wakeup The Producer-Consumer Problem Race Condition

More information

Announcements. Program #1. Reading. Due 2/15 at 5:00 pm. Finish scheduling Process Synchronization: Chapter 6 (8 th Ed) or Chapter 7 (6 th Ed)

Announcements. Program #1. Reading. Due 2/15 at 5:00 pm. Finish scheduling Process Synchronization: Chapter 6 (8 th Ed) or Chapter 7 (6 th Ed) Announcements Program #1 Due 2/15 at 5:00 pm Reading Finish scheduling Process Synchronization: Chapter 6 (8 th Ed) or Chapter 7 (6 th Ed) 1 Scheduling criteria Per processor, or system oriented CPU utilization

More information

Operating Systems ECE344. Ding Yuan

Operating Systems ECE344. Ding Yuan Operating Systems ECE344 Ding Yuan Announcement & Reminder Midterm exam Will grade them this Friday Will post the solution online before next lecture Will briefly go over the common mistakes next Monday

More information

Process Scheduling. Copyright : University of Illinois CS 241 Staff

Process Scheduling. Copyright : University of Illinois CS 241 Staff Process Scheduling Copyright : University of Illinois CS 241 Staff 1 Process Scheduling Deciding which process/thread should occupy the resource (CPU, disk, etc) CPU I want to play Whose turn is it? Process

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

UNIT 2 PROCESSES 2.0 INTRODUCTION

UNIT 2 PROCESSES 2.0 INTRODUCTION UNIT 2 PROCESSES Processes Structure Page Nos. 2.0 Introduction 25 2.1 Objectives 26 2.2 The Concept of Process 26 2.2.1 Implicit and Explicit Tasking 2.2.2 Processes Relationship 2.2.3 Process States

More information

Chapter 9 Memory Management

Chapter 9 Memory Management Contents 1. Introduction 2. Computer-System Structures 3. Operating-System Structures 4. Processes 5. Threads 6. CPU Scheduling 7. Process Synchronization 8. Deadlocks 9. Memory Management 10. Virtual

More information

Announcements. Program #1. Program #0. Reading. Is due at 9:00 AM on Thursday. Re-grade requests are due by Monday at 11:59:59 PM.

Announcements. Program #1. Program #0. Reading. Is due at 9:00 AM on Thursday. Re-grade requests are due by Monday at 11:59:59 PM. Program #1 Announcements Is due at 9:00 AM on Thursday Program #0 Re-grade requests are due by Monday at 11:59:59 PM Reading Chapter 6 1 CPU Scheduling Manage CPU to achieve several objectives: maximize

More information

Some popular Operating Systems include Linux, Unix, Windows, MS-DOS, Android, etc.

Some popular Operating Systems include Linux, Unix, Windows, MS-DOS, Android, etc. 1.1 Operating System Definition An Operating System (OS) is an interface between a computer user and computer hardware. An operating system is a software which performs all the basic tasks like file management,

More information

B. V. Patel Institute of Business Management, Computer &Information Technology, UTU

B. V. Patel Institute of Business Management, Computer &Information Technology, UTU BCA-3 rd Semester 030010304-Fundamentals Of Operating Systems Unit: 1 Introduction Short Answer Questions : 1. State two ways of process communication. 2. State any two uses of operating system according

More information

File. File System Implementation. Operations. Permissions and Data Layout. Storing and Accessing File Data. Opening a File

File. File System Implementation. Operations. Permissions and Data Layout. Storing and Accessing File Data. Opening a File File File System Implementation Operating Systems Hebrew University Spring 2007 Sequence of bytes, with no structure as far as the operating system is concerned. The only operations are to read and write

More information

CS 326: Operating Systems. CPU Scheduling. Lecture 6

CS 326: Operating Systems. CPU Scheduling. Lecture 6 CS 326: Operating Systems CPU Scheduling Lecture 6 Today s Schedule Agenda? Context Switches and Interrupts Basic Scheduling Algorithms Scheduling with I/O Symmetric multiprocessing 2/7/18 CS 326: Operating

More information

Scheduling. The Basics

Scheduling. The Basics The Basics refers to a set of policies and mechanisms to control the order of work to be performed by a computer system. Of all the resources in a computer system that are scheduled before use, the CPU

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2018 Lecture 8 Threads and Scheduling Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ How many threads

More information

File System Internals. Jo, Heeseung

File System Internals. Jo, Heeseung File System Internals Jo, Heeseung Today's Topics File system implementation File descriptor table, File table Virtual file system File system design issues Directory implementation: filename -> metadata

More information

UNIT 3. PROCESS MANAGEMENT

UNIT 3. PROCESS MANAGEMENT This document can be downloaded from www.chetanahegde.in with most recent updates. 1 UNIT 3. PROCESS MANAGEMENT 3.1 PROCESS A process can be defined in several ways: A program in execution An instance

More information

CSC Operating Systems Spring Lecture - XII Midterm Review. Tevfik Ko!ar. Louisiana State University. March 4 th, 2008.

CSC Operating Systems Spring Lecture - XII Midterm Review. Tevfik Ko!ar. Louisiana State University. March 4 th, 2008. CSC 4103 - Operating Systems Spring 2008 Lecture - XII Midterm Review Tevfik Ko!ar Louisiana State University March 4 th, 2008 1 I/O Structure After I/O starts, control returns to user program only upon

More information

Introduction. Secondary Storage. File concept. File attributes

Introduction. Secondary Storage. File concept. File attributes Introduction Secondary storage is the non-volatile repository for (both user and system) data and programs As (integral or separate) part of an operating system, the file system manages this information

More information

Announcements. Reading. Project #1 due in 1 week at 5:00 pm Scheduling Chapter 6 (6 th ed) or Chapter 5 (8 th ed) CMSC 412 S14 (lect 5)

Announcements. Reading. Project #1 due in 1 week at 5:00 pm Scheduling Chapter 6 (6 th ed) or Chapter 5 (8 th ed) CMSC 412 S14 (lect 5) Announcements Reading Project #1 due in 1 week at 5:00 pm Scheduling Chapter 6 (6 th ed) or Chapter 5 (8 th ed) 1 Relationship between Kernel mod and User Mode User Process Kernel System Calls User Process

More information

OPERATING SYSTEMS: Lesson 4: Process Scheduling

OPERATING SYSTEMS: Lesson 4: Process Scheduling OPERATING SYSTEMS: Lesson 4: Process Scheduling Jesús Carretero Pérez David Expósito Singh José Daniel García Sánchez Francisco Javier García Blas Florin Isaila 1 Content Process creation. Process termination.

More information

Announcements/Reminders

Announcements/Reminders Announcements/Reminders Class news group: rcfnews.cs.umass.edu::cmpsci.edlab.cs377 CMPSCI 377: Operating Systems Lecture 5, Page 1 Last Class: Processes A process is the unit of execution. Processes are

More information

Chapter 14 Operating Systems

Chapter 14 Operating Systems Chapter 14 Operating Systems Ref Page Slide 1/54 Learning Objectives In this chapter you will learn about: Definition and need for operating system Main functions of an operating system Commonly used mechanisms

More information

Chapter 14 Operating Systems

Chapter 14 Operating Systems Chapter 14 Systems Ref Page Slide 1/54 Learning Objectives In this chapter you will learn about: Definition and need for operating Main functions of an operating Commonly used mechanisms for: Process management

More information

File System Case Studies. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

File System Case Studies. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University File System Case Studies Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Today s Topics The Original UNIX File System FFS Ext2 FAT 2 UNIX FS (1)

More information

COMP SCI 3SH3: Operating System Concepts (Term 2 Winter 2006) Test 2 February 27, 2006; Time: 50 Minutes ;. Questions Instructor: Dr.

COMP SCI 3SH3: Operating System Concepts (Term 2 Winter 2006) Test 2 February 27, 2006; Time: 50 Minutes ;. Questions Instructor: Dr. COMP SCI 3SH3: Operating System Concepts (Term 2 Winter 2006) Test 2 February 27, 2006; Time: 50 Minutes ;. Questions Instructor: Dr. Kamran Sartipi Name: Student ID: Question 1 (Disk Block Allocation):

More information

Department of Computer applications. [Part I: Medium Answer Type Questions]

Department of Computer applications. [Part I: Medium Answer Type Questions] Department of Computer applications BBDNITM, Lucknow MCA 311: OPERATING SYSTEM [Part I: Medium Answer Type Questions] UNIT 1 Q1. What do you mean by an Operating System? What are the main functions of

More information

Techno India Batanagar Department of Computer Science & Engineering. Model Questions. Multiple Choice Questions:

Techno India Batanagar Department of Computer Science & Engineering. Model Questions. Multiple Choice Questions: Techno India Batanagar Department of Computer Science & Engineering Model Questions Subject Name: Operating System Multiple Choice Questions: Subject Code: CS603 1) Shell is the exclusive feature of a)

More information

* What are the different states for a task in an OS?

* What are the different states for a task in an OS? * Kernel, Services, Libraries, Application: define the 4 terms, and their roles. The kernel is a computer program that manages input/output requests from software, and translates them into data processing

More information

CPU Scheduling. Daniel Mosse. (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013)

CPU Scheduling. Daniel Mosse. (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013) CPU Scheduling Daniel Mosse (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013) Basic Concepts Maximum CPU utilization obtained with multiprogramming CPU I/O Burst Cycle Process

More information

TDIU25: Operating Systems II. Processes, Threads and Scheduling

TDIU25: Operating Systems II. Processes, Threads and Scheduling TDIU25: Operating Systems II. Processes, Threads and Scheduling SGG9: 3.1-3.3, 4.1-4.3, 5.1-5.4 o Process concept: context switch, scheduling queues, creation o Multithreaded programming o Process scheduling

More information

CPU Scheduling: Objectives

CPU Scheduling: Objectives CPU Scheduling: Objectives CPU scheduling, the basis for multiprogrammed operating systems CPU-scheduling algorithms Evaluation criteria for selecting a CPU-scheduling algorithm for a particular system

More information

CLASS: II YEAR / IV SEMESTER CSE SUBJECT CODE AND NAME: CS6401 OPERATING SYSTEMS UNIT I OPERATING SYSTEMS OVERVIEW

CLASS: II YEAR / IV SEMESTER CSE SUBJECT CODE AND NAME: CS6401 OPERATING SYSTEMS UNIT I OPERATING SYSTEMS OVERVIEW CLASS: II YEAR / IV SEMESTER CSE SUBJECT CODE AND NAME: CS6401 OPERATING SYSTEMS SYLLABUS UNIT I OPERATING SYSTEMS OVERVIEW Computer System Overview-Basic Elements, Instruction Execution, Interrupts, Memory

More information

LECTURE 3:CPU SCHEDULING

LECTURE 3:CPU SCHEDULING LECTURE 3:CPU SCHEDULING 1 Outline Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time CPU Scheduling Operating Systems Examples Algorithm Evaluation 2 Objectives

More information

Wait-For Graph. Exercise. Wait-For Graph. Today. Comp 104: Operating Systems Concepts. Corresponding Wait-For Graph 13/01/2014. Process Scheduling

Wait-For Graph. Exercise. Wait-For Graph. Today. Comp 104: Operating Systems Concepts. Corresponding Wait-For Graph 13/01/2014. Process Scheduling Comp 104: Operating Systems Concepts Process Scheduling Today Deadlock Wait-for graphs Detection and recovery Process scheduling Scheduling algorithms First-come, first-served (FCFS) Shortest Job First

More information

A COMPARATIVE STUDY OF CPU SCHEDULING POLICIES IN OPERATING SYSTEMS

A COMPARATIVE STUDY OF CPU SCHEDULING POLICIES IN OPERATING SYSTEMS VSRD International Journal of Computer Science &Information Technology, Vol. IV Issue VII July 2014 / 119 e-issn : 2231-2471, p-issn : 2319-2224 VSRD International Journals : www.vsrdjournals.com REVIEW

More information

AC59/AT59/AC110/AT110 OPERATING SYSTEMS & SYSTEMS SOFTWARE DEC 2015

AC59/AT59/AC110/AT110 OPERATING SYSTEMS & SYSTEMS SOFTWARE DEC 2015 Q.2 a. Explain the following systems: (9) i. Batch processing systems ii. Time sharing systems iii. Real-time operating systems b. Draw the process state diagram. (3) c. What resources are used when a

More information

CSE 120 Principles of Operating Systems

CSE 120 Principles of Operating Systems CSE 120 Principles of Operating Systems Fall 2016 Lecture 8: Scheduling and Deadlock Geoffrey M. Voelker Administrivia Thursday Friday Monday Homework #2 due at start of class Review material for midterm

More information

OPERATING SYSTEM. Functions of Operating System:

OPERATING SYSTEM. Functions of Operating System: OPERATING SYSTEM Introduction: An operating system (commonly abbreviated to either OS or O/S) is an interface between hardware and user. OS is responsible for the management and coordination of activities

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 Thread Scheduling Operating Systems Examples Java Thread Scheduling

More information

Topic 4 Scheduling. The objective of multi-programming is to have some process running at all times, to maximize CPU utilization.

Topic 4 Scheduling. The objective of multi-programming is to have some process running at all times, to maximize CPU utilization. Topic 4 Scheduling The objective of multiprogramming is to have some process running at all times, to maximize CPU utilization. The objective of time sharing is to switch the CPU among processes so frequently.

More information

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 TED (10)-3071 (REVISION-2010) Reg. No.. Signature. FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 OPERATING SYSTEM (Common to CT and IF) (Maximum marks: 100) [Time: 3 hours

More information

ALL the assignments (A1, A2, A3) and Projects (P0, P1, P2) we have done so far.

ALL the assignments (A1, A2, A3) and Projects (P0, P1, P2) we have done so far. Midterm Exam Reviews ALL the assignments (A1, A2, A3) and Projects (P0, P1, P2) we have done so far. Particular attentions on the following: System call, system kernel Thread/process, thread vs process

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

SMD149 - Operating Systems

SMD149 - Operating Systems SMD149 - Operating Systems Roland Parviainen November 3, 2005 1 / 45 Outline Overview 2 / 45 Process (tasks) are necessary for concurrency Instance of a program in execution Next invocation of the program

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 10 Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Chapter 6: CPU Scheduling Basic Concepts

More information

So far. Next: scheduling next process from Wait to Run. 1/31/08 CSE 30341: Operating Systems Principles

So far. Next: scheduling next process from Wait to Run. 1/31/08 CSE 30341: Operating Systems Principles So far. Firmware identifies hardware devices present OS bootstrap process: uses the list created by firmware and loads driver modules for each detected hardware. Initializes internal data structures (PCB,

More information

CSE 120. Fall Lecture 8: Scheduling and Deadlock. Keith Marzullo

CSE 120. Fall Lecture 8: Scheduling and Deadlock. Keith Marzullo CSE 120 Principles of Operating Systems Fall 2007 Lecture 8: Scheduling and Deadlock Keith Marzullo Aministrivia Homework 2 due now Next lecture: midterm review Next Tuesday: midterm 2 Scheduling Overview

More information