93502101 李盈賢.  Start a process with a specific priority class  Methods: 1)Cmd: start /’priority’ ‘filename’ 2)Create a shortcut.

Slides:



Advertisements
Similar presentations
Scheduling CSCI 3753 Operating Systems Spring 2005 Prof. Rick Han.
Advertisements

SCHEDULING Kshama Desai Bijal Shah Kishore Putta Kashyap Sheth.
 A quantum is the amount of time a thread gets to run before Windows checks.  Length: Windows 2000 / XP: 2 clock intervals Windows Server systems: 12.
Chapter 5 CPU Scheduling. CPU Scheduling Topics: Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
Threads, SMP, and Microkernels Chapter 4. Process Resource ownership - process is allocated a virtual address space to hold the process image Scheduling/execution-
Java How to Program, 9/e CET 3640 Professor: Dr. José M. Reyes Álamo © Copyright by Pearson Education, Inc. All Rights Reserved.
Day 25 Uniprocessor scheduling. Algorithm: Selection function Selection function – which process among ready processes to select. w – time spent in system,
Process Description and Control
CS 311 – Lecture 23 Outline Kernel – Process subsystem Process scheduling Scheduling algorithms User mode and kernel mode Lecture 231CS Operating.
Page 1 Processes and Threads Chapter Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling.
Introduction to Operating Systems – Windows process and thread management In this lecture we will cover Threads and processes in Windows Thread priority.
Thread 組員:王傳陞、林威丞 黃品舜、李盈賢. Outline Examining Thread Activity  Thread-related tools : Process Explorer  Why a process is hung  Viewing Ready Threads.
Ceng Operating Systems Chapter 2.1 : Processes Process concept Process scheduling Interprocess communication Deadlocks Threads.
1 When to Switch Processes 3 triggers –System call, Interrupt and Trap System call –when a user program invokes a system call. e.g., a system call that.
1 Uniprocessor Scheduling Chapter 9. 2 Aims of Scheduling Assign processes to be executed by the processor(s) Response time Throughput Processor efficiency.
Informationsteknologi Tuesday, October 9, 2007Computer Systems/Operating Systems - Class 141 Today’s class Scheduling.
Job scheduling Queue discipline.
Chapter 6 Implementing Processes, Threads, and Resources.
BINA RAMAMURTHY UNIVERSITY AT BUFFALO System Structure and Process Model 5/30/2013 Amrita-UB-MSES
1Chapter 05, Fall 2008 CPU Scheduling The CPU scheduler (sometimes called the dispatcher or short-term scheduler): Selects a process from the ready queue.
Java How to Program, 9/e CET 3640 Professor: Dr. Reyes Álamo © Copyright by Pearson Education, Inc. All Rights Reserved.
Process Description and Control. Process concepts n Definitions – replaces task, job – program in execution – entity that can be assigned to and executed.
Introduction to Embedded Systems
CSC 360- Instructor: K. Wu CPU Scheduling. CSC 360- Instructor: K. Wu Agenda 1.What is CPU scheduling? 2.CPU burst distribution 3.CPU scheduler and dispatcher.
Windows 2000 Scheduling Computing Department, Lancaster University, UK.
Scheduling Basic scheduling policies, for OS schedulers (threads, tasks, processes) or thread library schedulers Review of Context Switching overheads.
Chapter 41 Processes Chapter 4. 2 Processes  Multiprogramming operating systems are built around the concept of process (also called task).  A process.
Today’s Agenda  Quick Review  Finish Java Threads  The CS Problem Advanced Topics in Software Engineering 1.
Multiprocessor and Real-Time Scheduling Chapter 10.
1 RTOS Design Some of the content of this set of slides is taken from the documentation existing on the FreeRTOS website
CE Operating Systems Lecture 11 Windows – Object manager and process management.
CPU Scheduling Gursharan Singh Tatla 1-Feb-20111www.eazynotes.com.
1 Chapter 2.1 : Processes Process concept Process concept Process scheduling Process scheduling Interprocess communication Interprocess communication Threads.
1 Threads, SMP, and Microkernels Chapter 4. 2 Process Resource ownership: process includes a virtual address space to hold the process image (fig 3.16)
CE Operating Systems Lecture 7 Threads & Introduction to CPU Scheduling.
1 Review of Process Mechanisms. 2 Scheduling: Policy and Mechanism Scheduling policy answers the question: Which process/thread, among all those ready.
Windows 2000 Michael Blinn Ben Hejl Jane McHugh Matthew VanMater.
Concurrency & Context Switching Process Control Block What's in it and why? How is it used? Who sees it? 5 State Process Model State Labels. Causes of.
System Components ● There are three main protected modules of the System  The Hardware Abstraction Layer ● A virtual machine to configure all devices.
Processes, Threads, and Process States. Programs and Processes  Program: an executable file (before/after compilation)  Process: an instance of a program.
Amanda Johnson Hannah Young Josh Taylor Rich Carroll Troy Gladhill Saunders Roesser.
2 Processor(s)Main MemoryDevices Process, Thread & Resource Manager Memory Manager Device Manager File Manager.
Windows Operating System Internals - by David A. Solomon and Mark E. Russinovich with Andreas Polze Unit OS3: Concurrency 3.3. Advanced Windows Synchronization.
Chapter 2 Process Management. 2 Objectives After finish this chapter, you will understand: the concept of a process. the process life cycle. process states.
Managing Processors Jeff Chase Duke University. The story so far: protected CPU mode user mode kernel mode kernel “top half” kernel “bottom half” (interrupt.
1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
1 Threads in Java Jingdi Wang. 2 Introduction A thread is a single sequence of execution within a program Multithreading involves multiple threads of.
1 Threads, SMP, and Microkernels Chapter 4. 2 Process Resource ownership - process includes a virtual address space to hold the process image Scheduling/execution-
1 Uniprocessor Scheduling Chapter 3. 2 Alternating Sequence of CPU And I/O Bursts.
Threads, SMP, and Microkernels Chapter 4. Processes and Threads Operating systems use processes for two purposes - Resource allocation and resource ownership.
Uniprocessor Scheduling
Threads and Scheduling
Lecture 21 Concurrency Introduction
Operating Systems: A Modern Perspective, Chapter 6
System Structure and Process Model
System Structure and Process Model
Chapter 3: Windows7 Part 2.
System Structure B. Ramamurthy.
Threads, SMP, and Microkernels
Chapter 3: Windows7 Part 2.
Multithreading.
TDC 311 Process Scheduling.
Process Description and Control
Lecture 4- Threads, SMP, and Microkernels
Process Description and Control
Process Description and Control
Implementing Processes, Threads, and Resources
Chapter 2 Processes and Threads 2.1 Processes 2.2 Threads
Chapter 3: Processes Process Concept Process Scheduling
Michael Blinn Ben Hejl Jane McHugh Matthew VanMater
Presentation transcript:

李盈賢

 Start a process with a specific priority class  Methods: 1)Cmd: start /’priority’ ‘filename’ 2)Create a shortcut

 To enter the real-time range, Increase scheduling priority privilege is necessary

 Many kernel-mode system threads run in the real-time priority range, so if threads spend excessive time running in this range, they might block critical system functions

 Threads normally run at IRQL 0 or 1  User-mode threads always run at IRQL 0.  Kernel-mode APCs execute at IRQL 1  Threads running in kernel mode can raise IRQL to higher levels

1. Ready 2. Standby 3. Running 4. Waiting 5. Transition 6. Terminated 7. Initialized 8. (Win2003)Deferred Ready

 while a thread is being created

 Wait to be executed.  The dispatcher considers only the pool of threads in the ready state.

 Only on Windows Server 2003  for threads that have been selected to run on a specific processor but have not yet been scheduled  the kernel can minimize the amount of time the systemwide lock on the scheduling database is held

 It has been selected to run next on a particular processor.  a thread can be preempted out of the standby state before it ever executes  In multiprocessor system, only one thread can be in the standby state for each processor.

 Via context switching of the dispatcher  Until its quantum ends, preempted by a higher priority thread, terminates, yields execution, or it voluntarily enters the wait state.

 A thread can enter the wait state in several ways, e.g. voluntarily wait for an object to synchronize its execution, I/O operation, or an environment subsystem can direct the thread to suspend itself  When the thread’s wait ends, depending on the priority, the thread either begins running immediately or is moved back to the ready state.

 Ready for execution but its kernel stack is paged out of memory.  Once its kernel stack is brought back into memory, the thread enters the ready state.

 When a thread finishes executing, it enters the terminated state.  Once the thread is terminated, the executive thread block might or might not be deallocated. (The object manager sets policy regarding when to delete the object.)

 A set of kernel data structures.  To make thread-scheduling decisions  Keeps track of which threads are waiting to execute and which processors are executing which threads

On uniprocessor systems, the dispatcher database is synchronized by raising IRQL to DPC/dispatch level and SYNCH_LEVEL (both of which are defined as level 2). On multiprocessor systems, more is required than raising IRQL because each processor can, at the same time, raise to the same IRQL and attempt to operate on the dispatcher database