PROCESSES & THREADS. Charles Abzug, Ph.D. Department of Computer Science James Madison University Harrisonburg, VA Charles Abzug
|
|
|
- Suzan Garrett
- 6 years ago
- Views:
Transcription
1 PROCESSES & THREADS Charles Abzug, Ph.D. Department of Computer Science James Madison University Harrisonburg, VA Voice Phone: ; Cell Phone: OR Home Page: Charles Abzug Tanenbaum, Andrew S. (2008). Modern Operating Systems. Third Edition. Upper Saddle River, NJ: Prentice-Hall. ISBN: CHAPTER 2: Processes and Threads Sobell, Mark G. (2005). A Practical Guide to Linux Commands, Editors, and Shell Programming. Upper Saddle River, NJ: Prentice-Hall Professional Technical Reference. ISBN: (alk. paper). CHAPTER 3: 10-Oct Charles Abzug 2 1
2 CPU-Scheduling Algorithms (for Processes or Threads) 1. First-Come-First-Served 2. Shortest Job First 3. Shortest Remaining Time Next 4. Round-Robin Scheduling 5. Priority Scheduling 6. Priority Scheduling with Multiple Queues 7. Shortest Process Next 8. "Guaranteed" Scheduling 9. Lottery Scheduling 10. Fair-Share Scheduling 10-Oct Charles Abzug 3 Part I: PROCESSES 10-Oct Charles Abzug 4 2
3 Multiprogramming Figure Oct Charles Abzug 5 Initiators of Process Creation 1. System Initialization (Boot-Up) 2. Explicit User-Initiation (e.g., issuance of a CLI command) 3. Existing Process via issuance of a Process-Creation System Call 4. Long-Term Scheduler, in accommodating a submitted batch job 10-Oct Charles Abzug 6 3
4 Initiators of Process Termination 1. Completion of assigned task: normal termination (voluntary) 2. Exit upon encountering a specifically chosen error (voluntary) 3. Occurrence of a fatal error (involuntary) 4. Explicitly ordered by another (usually ancestral) process (involuntary) 10-Oct Charles Abzug 7 Kinds of Processes 1. Foreground 2. Background 3. Daemon 10-Oct Charles Abzug 8 4
5 Simple Model of Process States and Process Transitions Causal events for transition: NOTE: Fourth state (not shown): Terminated Figure Oct Charles Abzug 9 Individual Processes, and the Underlying OS for Interrupt-Handling & Scheduling Figure Oct Charles Abzug 10 5
6 Contents of a Process Descriptor Figure Oct Charles Abzug 11 Sequence of Activities Following the Occurrence of an Interrupt Figure Oct Charles Abzug 12 6
7 % CPU Utilization Depends on the Degree of Multiprogramming U CPU = 1 p n Figure 2-6. Degree of Multiprogramming 10-Oct Charles Abzug 13 Part II: THREADS 10-Oct Charles Abzug 14 7
8 Word Processor with Multiple Threads Figure Waits for and then handles input from keyboard. 2. Reformats the document in background. 3. Autosaves the document at the specified time interval, copying out the current content onto the disk (foreground). 4. Sends the document to the print SPOOLer. 10-Oct Charles Abzug 15 Web Server with Multiple Threads Figure Oct Charles Abzug 16 8
9 Web Server: Dispatcher Thread Figure 2-9a. 10-Oct Charles Abzug 17 Web Server: Worker Thread Figure 2-9b. 10-Oct Charles Abzug 18 9
10 Alternative Approaches to the Design of a Web Server Figure Oct Charles Abzug 19 Single-Threaded and Multi-Threaded Processes Figure Oct Charles Abzug 20 10
11 Items Shared by All the Threads of a Single Process, and Items Unique to Each Thread Figure Oct Charles Abzug 21 Separate Stack for Each Thread Figure Oct Charles Abzug 22 11
12 Function Calls for POSIX Threads (Pthreads) Figure Oct Charles Abzug 23 Example of a Program that Uses Pthreads Figure Oct Charles Abzug 24 12
13 User-Level Threads vs. Kernel-Level Threads Figure Oct Charles Abzug 25 Multiplexing of Several User-Level Threads Onto a Single Kernel-Level Thread Figure Oct Charles Abzug 26 13
14 Creation of a New Thread in Response to the Arrival of a Message Figure Oct Charles Abzug 27 Inter-Thread Conflicts in the Use of a Global Variable Figure Oct Charles Abzug 28 14
15 Private Global Variables Figure Oct Charles Abzug 29 Race Conditions Figure Oct Charles Abzug 30 15
16 Mutual Exclusion from a Critical Region Figure Oct Charles Abzug 31 Use of a Spin Lock to Achieve Mutual Exclusion Process 0: Process 1: Figure Oct Charles Abzug 32 16
17 Peterson's Algorithm for Achieving Mutual Exclusion Figure Oct Charles Abzug 33 Use of an Atomic "Test and Set Lock" (TSL) Machine Instruction to Achieve Mutual Exclusion Figure Oct Charles Abzug 34 17
18 Entering and Leaving the Critical Region Using "XCHG" Figure Oct Charles Abzug 35 Race Condition in the "Producer-Consumer Problem" Figure Oct Charles Abzug 36 18
19 Use of Semaphores in the "Producer-Consumer Problem" Figure Oct Charles Abzug 37 Use of mutex_lock and mutex_unlock to Achieve Mutual Exclusion Figure Oct Charles Abzug 38 19
20 POSIX Threads: Procedure Calls for Mutual Exclusion Figure Oct Charles Abzug 39 POSIX Threads: Procedure Calls Pertaining to Condition Variables Figure Oct Charles Abzug 40 20
21 POSIX Threads: Use of Mutexes and Condition Variables to Solve the Producer-Consumer Problem Figure 2-32a. 10-Oct Charles Abzug 41 POSIX Threads: Use of Mutexes and Condition Variables to Solve the Producer-Consumer Problem Figure 2-32b. 10-Oct Charles Abzug 42 21
22 Use of the Monitor, a Programming-Language Construct, to Achieve Mutual Exclusion Figure Oct Charles Abzug 43 Use of a Monitor to Effect Mutual Exclusion in the "Producer-Consumer Problem" Figure Oct Charles Abzug 44 22
23 The "Producer-Consumer Problem: Solution in Java (1) Figure 2-35"a". 10-Oct Charles Abzug 45 The "Producer-Consumer Problem: Solution in Java (2) Figure 2-35"b". 10-Oct Charles Abzug 46 23
24 Message-Passing Used to Solve the "Producer-Consumer Problem: Figure Oct Charles Abzug 47 Use of a Barrier to Enforce the Synchronization of Multiple Processes All processes are approaching the barrier. None has yet reached it. Several processes have reached the barrier and are waiting until all are present. Last process has reached the barrier. All processes may now pass through. Figure Oct Charles Abzug 48 24
25 CPU-Bound and I/O-Bound Processes Figure Oct Charles Abzug 49 Goals of the Scheduling Algorithm: Dependent upon the Computing Environment Figure Oct Charles Abzug 50 25
26 Long-Term (Admission) Scheduler, Medium-Term (Memory) Scheduler, and Short-Term (CPU) Scheduler NOTE: This figure did not come from our course text. 10-Oct Charles Abzug 51 CPU-Scheduling Algorithms 1. First-Come-First-Served (FCFS): Batch Environment, NON-Preemptive 10-Oct Charles Abzug 52 26
27 CPU-Scheduling Algorithms 1. First-Come-First-Served (FCFS): Batch Environment, NON-Preemptive 2. Shortest Job First (SJF): Batch Environment, NON-Preemptive 10-Oct Charles Abzug 53 Effectiveness of "Shortest-Job First" Scheduling Jobs run in order of arrival: First-Come-First-Served (FCFS) Shortest Jobs run First (SJF) Figure Oct Charles Abzug 54 27
28 CPU-Scheduling Algorithms 1. First-Come-First-Served (FCFS): Batch Environment, NON-Preemptive 2. Shortest Job First (SJF): Batch Environment, NON-Preemptive 3. Shortest Remaining Time Next (SRT): Batch Environment, PREEMPTIVE 10-Oct Charles Abzug 55 CPU-Scheduling Algorithms 1. First-Come-First-Served (FCFS): Batch Environment, NON-Preemptive 2. Shortest Job First (SJF): Batch Environment, NON-Preemptive 3. Shortest Remaining Time Next (SRT): Batch Environment, PREEMPTIVE 4. Round-Robin Scheduling (with Time Quantum): Interactive, PREEMPTIVE 10-Oct Charles Abzug 56 28
29 Round-Robin Scheduling Job 'B' gets the processor: Job 'B' uses up its quantum: Figure Oct Charles Abzug 57 CPU-Scheduling Algorithms 1. First-Come-First-Served (FCFS): Batch Environment, NON-Preemptive 2. Shortest Job First (SJF): Batch Environment, NON-Preemptive 3. Shortest Remaining Time Next (SRT): Batch Environment, PREEMPTIVE 4. Round-Robin Scheduling (with Time Quantum): Interactive, PREEMPTIVE 5. Priority Scheduling (with Time Quantum): Interactive, PREEMPTIVE 10-Oct Charles Abzug 58 29
30 CPU-Scheduling Algorithms 1. First-Come-First-Served (FCFS): Batch Environment, NON-Preemptive 2. Shortest Job First (SJF): Batch Environment, NON-Preemptive 3. Shortest Remaining Time Next (SRT): Batch Environment, PREEMPTIVE 4. Round-Robin Scheduling (with Time Quantum): Interactive, PREEMPTIVE 5. Priority Scheduling (with Time Quantum): Interactive, PREEMPTIVE 6. Priority Scheduling with Multiple Queues (with Time Quantum): Interactive, 10-Oct Charles Abzug 59 Priority-Based Scheduling Figure Oct Charles Abzug 60 30
31 CPU-Scheduling Algorithms 1. First-Come-First-Served (FCFS): Batch Environment, NON-Preemptive 2. Shortest Job First (SJF): Batch Environment, NON-Preemptive 3. Shortest Remaining Time Next (SRT): Batch Environment, PREEMPTIVE 4. Round-Robin Scheduling (with Time Quantum): Interactive, PREEMPTIVE 5. Priority Scheduling (with Time Quantum): Interactive, PREEMPTIVE 6. Priority Scheduling with Multiple Queues (with Time Quantum): Interactive, PREEMPTIVE 7. Shortest Process Next: Interactive, can be PREEMPTIVE or NON-Preemptive 10-Oct Charles Abzug 61 CPU-Scheduling Algorithms 1. First-Come-First-Served (FCFS): Batch Environment, NON-Preemptive 2. Shortest Job First (SJF): Batch Environment, NON-Preemptive 3. Shortest Remaining Time Next (SRT): Batch Environment, PREEMPTIVE 4. Round-Robin Scheduling (with Time Quantum): Interactive, PREEMPTIVE 5. Priority Scheduling (with Time Quantum): Interactive, PREEMPTIVE 6. Priority Scheduling with Multiple Queues (with Time Quantum): Interactive, PREEMPTIVE 7. Shortest Process Next: Interactive, can be PREEMPTIVE or NON-Preemptive 8. "Guaranteed" Scheduling (better name: "Equitable" Scheduling); Interactive, 10-Oct Charles Abzug 62 31
32 CPU-Scheduling Algorithms 1. First-Come-First-Served (FCFS): Batch Environment, NON-Preemptive 2. Shortest Job First (SJF): Batch Environment, NON-Preemptive 3. Shortest Remaining Time Next (SRT): Batch Environment, PREEMPTIVE 4. Round-Robin Scheduling (with Time Quantum): Interactive, PREEMPTIVE 5. Priority Scheduling (with Time Quantum): Interactive, PREEMPTIVE 6. Priority Scheduling with Multiple Queues (with Time Quantum): Interactive, PREEMPTIVE 7. Shortest Process Next: Interactive, can be PREEMPTIVE or NON-Preemptive 8. "Guaranteed" Scheduling (better name: "Equitable" Scheduling); Interactive, PREEMPTIVE 9. Lottery Scheduling (with Time Quantum): Interactive, PREEMPTIVE 10-Oct Charles Abzug 63 CPU-Scheduling Algorithms 1. First-Come-First-Served (FCFS): Batch Environment, NON-Preemptive 2. Shortest Job First (SJF): Batch Environment, NON-Preemptive 3. Shortest Remaining Time Next (SRT): Batch Environment, PREEMPTIVE 4. Round-Robin Scheduling (with Time Quantum): Interactive, PREEMPTIVE 5. Priority Scheduling (with Time Quantum): Interactive, PREEMPTIVE 6. Priority Scheduling with Multiple Queues (with Time Quantum): Interactive, PREEMPTIVE 7. Shortest Process Next: Interactive, can be PREEMPTIVE or NON-Preemptive 8. "Guaranteed" Scheduling (better name: "Equitable" Scheduling); Interactive, PREEMPTIVE 9. Lottery Scheduling (with Time Quantum): Interactive, PREEMPTIVE 10. Fair-Share Scheduling (with Time Quantum): Interactive, PREEMPTIVE 10-Oct Charles Abzug 64 32
33 Scheduling of User-Level Threads Figure 2-43a. 10-Oct Charles Abzug 65 Scheduling of Kernel-Level Threads Figure 2-43b. 10-Oct Charles Abzug 66 33
34 The "Dining Philosophers Problem" Figure Oct Charles Abzug 67 Deadlock or Starvation in the "Dining Philosophers Problem" Figure Oct Charles Abzug 68 34
35 Use of Semaphores to Solve the "Dining Philosophers Problem" (1) Figure 2-46a. 10-Oct Charles Abzug 69 Use of Semaphores to Solve the "Dining Philosophers Problem" (2) Figure 2-46b. 10-Oct Charles Abzug 70 35
36 Use of Semaphores to Solve the "Readers & Writers Problem" Figure Oct Charles Abzug 71 END 10-Oct Charles Abzug 72 36
Chapter 2 Processes and Threads
MODERN OPERATING SYSTEMS Third Edition ANDREW S. TANENBAUM Chapter 2 Processes and Threads The Process Model Figure 2-1. (a) Multiprogramming of four programs. (b) Conceptual model of four independent,
Processes The Process Model. Chapter 2. Processes and Threads. Process Termination. Process Creation
Chapter 2 Processes The Process Model Processes and Threads 2.1 Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling Multiprogramming of four programs Conceptual
Processes The Process Model. Chapter 2 Processes and Threads. Process Termination. Process States (1) Process Hierarchies
Chapter 2 Processes and Threads Processes The Process Model 2.1 Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling Multiprogramming of four programs Conceptual
Threads. Threads The Thread Model (1) CSCE 351: Operating System Kernels Witawas Srisa-an Chapter 4-5
Threads CSCE 351: Operating System Kernels Witawas Srisa-an Chapter 4-5 1 Threads The Thread Model (1) (a) Three processes each with one thread (b) One process with three threads 2 1 The Thread Model (2)
Processes Prof. James L. Frankel Harvard University. Version of 6:16 PM 10-Feb-2017 Copyright 2017, 2015 James L. Frankel. All rights reserved.
Processes Prof. James L. Frankel Harvard University Version of 6:16 PM 10-Feb-2017 Copyright 2017, 2015 James L. Frankel. All rights reserved. Process Model Each process consists of a sequential program
CS450/550 Operating Systems
CS450/550 Operating Systems Lecture 2 Processes and Threads Palden Lama Department of Computer Science CS450/550 P&T.1 Review: Summary of Lecture 1 Two major OS functionalities: machine extension and resource
Chapter 2 Processes and Threads. Interprocess Communication Race Conditions
Chapter 2 Processes and Threads [ ] 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling 85 Interprocess Communication Race Conditions Two processes want to access shared memory at
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
CS450/550 Operating Systems
CS450/550 Operating Systems Lecture 2 Processes and Threads Dr. Xiaobo Zhou Department of Computer Science CS450/550 P&T.1 Review: Summary of Lecture 1 Two major OS functionalities: machine extension and
What are they? How do we represent them? Scheduling Something smaller than a process? Threads Synchronizing and Communicating Classic IPC problems
Processes What are they? How do we represent them? Scheduling Something smaller than a process? Threads Synchronizing and Communicating Classic IPC problems Processes The Process Model a) Multiprogramming
8: Scheduling. Scheduling. Mark Handley
8: Scheduling Mark Handley Scheduling On a multiprocessing system, more than one process may be available to run. The task of deciding which process to run next is called scheduling, and is performed by
Midterm Exam. October 20th, Thursday NSC
CSE 421/521 - Operating Systems Fall 2011 Lecture - XIV Midterm Review Tevfik Koşar University at Buffalo October 18 th, 2011 1 Midterm Exam October 20th, Thursday 9:30am-10:50am @215 NSC Chapters included
OPERATING SYSTEMS DESIGN AND IMPLEMENTATION Third Edition ANDREW S. TANENBAUM ALBERT S. WOODHULL. Chap. 2.2 Interprocess Communication
OPERATING SYSTEMS DESIGN AND IMPLEMENTATION Third Edition ANDREW S. TANENBAUM ALBERT S. WOODHULL Chap. 2.2 Interprocess Communication Annotated by B. Hirsbrunner, University of Fribourg, 2011 Lecture 5,
Subject: Operating System (BTCOC403) Class: S.Y.B.Tech. (Computer Engineering)
A. Multiple Choice Questions (60 questions) Subject: Operating System (BTCOC403) Class: S.Y.B.Tech. (Computer Engineering) Unit-I 1. What is operating system? a) collection of programs that manages hardware
CSE 153 Design of Operating Systems
CSE 153 Design of Operating Systems Winter 2018 Midterm Review Midterm in class on Monday Covers material through scheduling and deadlock Based upon lecture material and modules of the book indicated on
Department of Computer applications. [Part I: Medium Answer Type Questions]
![Department of Computer applications. [Part I: Medium Answer Type Questions]](/thumbs/78/76812862.jpg "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
Timers 1 / 46. Jiffies. Potent and Evil Magic
Timers 1 / 46 Jiffies Each timer tick, a variable called jiffies is incremented It is thus (roughly) the number of HZ since system boot A 32-bit counter incremented at 1000 Hz wraps around in about 50
MARUTHI SCHOOL OF BANKING (MSB)
MARUTHI SCHOOL OF BANKING (MSB) SO IT - OPERATING SYSTEM(2017) 1. is mainly responsible for allocating the resources as per process requirement? 1.RAM 2.Compiler 3.Operating Systems 4.Software 2.Which
Operating Systems Comprehensive Exam. Spring Student ID # 2/17/2011
Operating Systems Comprehensive Exam Spring 2011 Student ID # 2/17/2011 You must complete all of Section I You must complete two of the problems in Section II If you need more space to answer a question,
Operating Systems: Quiz2 December 15, Class: No. Name:
Operating Systems: Quiz2 December 15, 2006 Class: No. Name: Part I (30%) Multiple Choice Each of the following questions has only one correct answer. Fill the correct one in the blank in front of each
Mid Term from Feb-2005 to Nov 2012 CS604- Operating System
Mid Term from Feb-2005 to Nov 2012 CS604- Operating System Latest Solved from Mid term Papers Resource Person Hina 1-The problem with priority scheduling algorithm is. Deadlock Starvation (Page# 84) Aging
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
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
Main Points of the Computer Organization and System Software Module
Main Points of the Computer Organization and System Software Module You can find below the topics we have covered during the COSS module. Reading the relevant parts of the textbooks is essential for a
CISC 7310X. C05: CPU Scheduling. Hui Chen Department of Computer & Information Science CUNY Brooklyn College. 3/1/2018 CUNY Brooklyn College
CISC 7310X C05: CPU Scheduling Hui Chen Department of Computer & Information Science CUNY Brooklyn College 3/1/2018 CUNY Brooklyn College 1 Outline Recap & issues CPU Scheduling Concepts Goals and criteria
R13 SET - 1 2. Answering the question in Part-A is compulsory 1 a) Define Operating System. List out the objectives of an operating system. [3M] b) Describe different attributes of the process. [4M] c)
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:
Course Description: This course includes the basic concepts of operating system
Operating Systems Course Title: Operating Systems Full Marks:60+ 20+20 Course No: CSC259 Pass Marks: 24+8+8 Nature of the Course: Theory + Lab Credit Hrs: 3 Course Description: This course includes the
Uniprocessor Scheduling
Uniprocessor Scheduling Chapter 9 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice, FL 2008, Prentice Hall CPU- and I/O-bound processes
Operating Systems Comprehensive Exam. Spring Student ID # 3/16/2006
Operating Systems Comprehensive Exam Spring 2006 Student ID # 3/16/2006 You must complete all of part I (60%) You must complete two of the three sections in part II (20% each) In Part I, circle or select
CHAPTER NO - 1 : Introduction:
Sr. No L.J. Institute of Engineering & Technology Semester: IV (26) Subject Name: Operating System Subject Code:21402 Faculties: Prof. Saurin Dave CHAPTER NO - 1 : Introduction: TOPIC:1 Basics of Operating
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
C09: Process Synchronization
CISC 7310X C09: Process Synchronization Hui Chen Department of Computer & Information Science CUNY Brooklyn College 3/29/2018 CUNY Brooklyn College 1 Outline Race condition and critical regions The bounded
Lecture 9: Midterm Review
Project 1 Due at Midnight Lecture 9: Midterm Review CSE 120: Principles of Operating Systems Alex C. Snoeren Midterm Everything we ve covered is fair game Readings, lectures, homework, and Nachos Yes,
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)
Semaphore. Originally called P() and V() wait (S) { while S <= 0 ; // no-op S--; } signal (S) { S++; }
Semaphore Semaphore S integer variable Two standard operations modify S: wait() and signal() Originally called P() and V() Can only be accessed via two indivisible (atomic) operations wait (S) { while
CMPS 111 Spring 2013 Prof. Scott A. Brandt Midterm Examination May 6, Name: ID:
CMPS 111 Spring 2013 Prof. Scott A. Brandt Midterm Examination May 6, 2013 Name: ID: This is a closed note, closed book exam. There are 23 multiple choice questions, 6 short answer questions. Plan your
Advanced Operating Systems (CS 202) Scheduling (1)
Advanced Operating Systems (CS 202) Scheduling (1) Today: CPU Scheduling 2 The Process The process is the OS abstraction for execution It is the unit of execution It is the unit of scheduling It is the
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
Unit I. Chapter 2: Process and Threads
Unit I Chapter 2: Process and Threads Introduction: Processes are one of the oldest and most important abstractions that operating systems provide. They support the ability to have (pseudo) simultaneous
(MCQZ-CS604 Operating Systems)
command to resume the execution of a suspended job in the foreground fg (Page 68) bg jobs kill commands in Linux is used to copy file is cp (Page 30) mv mkdir The process id returned to the child process
CMPS 111 Spring 2003 Midterm Exam May 8, Name: ID:
CMPS 111 Spring 2003 Midterm Exam May 8, 2003 Name: ID: This is a closed note, closed book exam. There are 20 multiple choice questions and 5 short answer questions. Plan your time accordingly. Part I:
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
CSI3131 Final Exam Review
CSI3131 Final Exam Review Final Exam: When: April 24, 2015 2:00 PM Where: SMD 425 File Systems I/O Hard Drive Virtual Memory Swap Memory Storage and I/O Introduction CSI3131 Topics Process Computing Systems
Operating Systems. Scheduling
Operating Systems Scheduling Process States Blocking operation Running Exit Terminated (initiate I/O, down on semaphore, etc.) Waiting Preempted Picked by scheduler Event arrived (I/O complete, semaphore
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
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 )](/thumbs/79/79464788.jpg "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
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:
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
Chendu College of Engineering & Technology
Chendu College of Engineering & Technology (Approved by AICTE, New Delhi and Affiliated to Anna University) Zamin Endathur, Madurantakam, Kancheepuram District 603311 +91-44-27540091/92 www.ccet.org.in
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
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
SYNCHRONIZATION M O D E R N O P E R A T I N G S Y S T E M S R E A D 2. 3 E X C E P T A N D S P R I N G 2018
SYNCHRONIZATION M O D E R N O P E R A T I N G S Y S T E M S R E A D 2. 3 E X C E P T 2. 3. 8 A N D 2. 3. 1 0 S P R I N G 2018 INTER-PROCESS COMMUNICATION 1. How a process pass information to another process
UNIT 2 Basic Concepts of CPU Scheduling. UNIT -02/Lecture 01
1 UNIT 2 Basic Concepts of CPU Scheduling UNIT -02/Lecture 01 Process Concept An operating system executes a variety of programs: **Batch system jobs **Time-shared systems user programs or tasks **Textbook
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
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
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
Operating Systems: William Stallings. Starvation. Patricia Roy Manatee Community College, Venice, FL 2008, Prentice Hall
Operating Systems: Internals and Design Principles, 6/E William Stallings Chapter 6 Concurrency: Deadlock and Starvation Patricia Roy Manatee Community College, Venice, FL 2008, Prentice Hall Deadlock
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
CS 571 Operating Systems. Midterm Review. Angelos Stavrou, George Mason University
CS 571 Operating Systems Midterm Review Angelos Stavrou, George Mason University Class Midterm: Grading 2 Grading Midterm: 25% Theory Part 60% (1h 30m) Programming Part 40% (1h) Theory Part (Closed Books):
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
Operating Systems Comprehensive Exam. Spring Student ID # 3/20/2013
Operating Systems Comprehensive Exam Spring 2013 Student ID # 3/20/2013 You must complete all of Section I You must complete two of the problems in Section II If you need more space to answer a question,
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
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
QUESTION BANK UNIT I
QUESTION BANK Subject Name: Operating Systems UNIT I 1) Differentiate between tightly coupled systems and loosely coupled systems. 2) Define OS 3) What are the differences between Batch OS and Multiprogramming?
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
OS Structure. User mode/ kernel mode. System call. Other concepts to know. Memory protection, privileged instructions
Midterm Review OS Structure User mode/ kernel mode Memory protection, privileged instructions System call Definition, examples, how it works? Other concepts to know Monolithic kernel vs. Micro kernel 2
Operating System Design
Module 6: Operating System Design Stage 1 Semester 2 Module Title Module Number/Reference 6 Module Status (Mandatory/Elective) Module ECTS credit 5 Module NFQ level (only if applicable) Pre-requisite Module
Problem Set: Processes
Lecture Notes on Operating Systems Problem Set: Processes 1. Answer yes/no, and provide a brief explanation. (a) Can two processes be concurrently executing the same program executable? (b) Can two running
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
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
PROCESS SYNCHRONIZATION
PROCESS SYNCHRONIZATION Process Synchronization Background The Critical-Section Problem Peterson s Solution Synchronization Hardware Semaphores Classic Problems of Synchronization Monitors Synchronization
Practice Exercises 305
Practice Exercises 305 The FCFS algorithm is nonpreemptive; the RR algorithm is preemptive. The SJF and priority algorithms may be either preemptive or nonpreemptive. Multilevel queue algorithms allow
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
Dealing with Issues for Interprocess Communication
Dealing with Issues for Interprocess Communication Ref Section 2.3 Tanenbaum 7.1 Overview Processes frequently need to communicate with other processes. In a shell pipe the o/p of one process is passed
STUDENT NAME: STUDENT ID: Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Total
University of Minnesota Department of Computer Science & Engineering CSci 5103 - Fall 2018 (Instructor: Tripathi) Midterm Exam 1 Date: October 18, 2018 (1:00 2:15 pm) (Time: 75 minutes) Total Points 100
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
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
OS Structure. User mode/ kernel mode (Dual-Mode) Memory protection, privileged instructions. Definition, examples, how it works?
Midterm Review OS Structure User mode/ kernel mode (Dual-Mode) Memory protection, privileged instructions System call Definition, examples, how it works? Other concepts to know Monolithic kernel vs. Micro
What s An OS? Cyclic Executive. Interrupts. Advantages Simple implementation Low overhead Very predictable
What s An OS? Provides environment for executing programs Process abstraction for multitasking/concurrency scheduling Hardware abstraction layer (device drivers) File systems Communication Do we need an
Scheduling Bits & Pieces
Scheduling Bits & Pieces 1 Windows Scheduling 2 Windows Scheduling Priority Boost when unblocking Actual boost dependent on resource Disk (1), serial (2), keyboard (6), soundcard (8).. Interactive, window
Processes and Threads
Processes and Threads 1 Learning Outcomes An understanding of fundamental concepts of processes and threads 2 Major Requirements of an Operating System Interleave the execution of several processes to
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
Chapter 5: CPU Scheduling. Operating System Concepts 8 th Edition,
Chapter 5: CPU Scheduling Operating System Concepts 8 th Edition, Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2009 Chapter 5: Process Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms
CSCI-GA Operating Systems Lecture 3: Processes and Threads -Part 2 Scheduling Hubertus Franke
CSCI-GA.2250-001 Operating Systems Lecture 3: Processes and Threads -Part 2 Scheduling Hubertus Franke frankeh@cs.nyu.edu Processes Vs Threads The unit of dispatching is referred to as a thread or lightweight
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
Job Scheduling. CS170 Fall 2018
Job Scheduling CS170 Fall 2018 What to Learn? Algorithms of job scheduling, which maximizes CPU utilization obtained with multiprogramming Select from ready processes and allocates the CPU to one of them
Processes and Threads. Processes: Review
Processes and Threads Processes and their scheduling Threads and scheduling Multiprocessor scheduling Distributed Scheduling/migration Lecture 3, page 1 Processes: Review Multiprogramming versus multiprocessing
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
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
Learning Outcomes. Processes and Threads. Major Requirements of an Operating System. Processes and Threads
Learning Outcomes Processes and Threads An understanding of fundamental concepts of processes and threads 1 2 Major Requirements of an Operating System Interleave the execution of several processes to
Operating Systems (1DT020 & 1TT802)
Uppsala University Department of Information Technology Name: Perso. no: Operating Systems (1DT020 & 1TT802) 2009-05-27 This is a closed book exam. Calculators are not allowed. Answers should be written
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
Operating Systems. Lecture Process Scheduling. Golestan University. Hossein Momeni
Operating Systems Lecture 2.2 - Process Scheduling Golestan University Hossein Momeni momeni@iust.ac.ir Scheduling What is scheduling? Goals Mechanisms Scheduling on batch systems Scheduling on interactive
Question No: 1 (Marks: 1) - Please choose one A computer system that allows only one user to use the computer at a given time is known as:
MUHAMMAD FAISAL MIT 4 th Semester Al-Barq Campus (VGJW01) Gujranwala faisalgrw123@gmail.com Solved Reference MCQ s For Mid TERM EXAMS CS604 OPERTING SYSTEM Question No: 1 (Marks: 1) - Please choose one
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
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
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,
Jan 20, 2005 Lecture 2: Multiprogramming OS
Jan 20, 2005 Lecture 2: Multiprogramming OS February 17, 2005 1 Review OS mediates between hardware and user software QUIZ: Q: What is the most important function in an OS? A: To support multiprogramming
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