Progress Report 2013/08/22. Model Modification Each core works under the same frequency due to hardware limitation. A task can have different processing.

Slides:

Advertisements

Similar presentations

CS 241 Spring 2007 System Programming 1 Queuing Framework for Process Management Evaluation Lecture 20 Klara Nahrstedt.

Advertisements

1 Queuing Theory 2 Queuing theory is the study of waiting in lines or queues. Server Pool of potential customers Rear of queue Front of queue Line (or.

Cs238 CPU Scheduling Dr. Alan R. Davis. CPU Scheduling The objective of multiprogramming is to have some process running at all times, to maximize CPU.

6/25/2015Page 1 Process Scheduling B.Ramamurthy. 6/25/2015Page 2 Introduction An important aspect of multiprogramming is scheduling. The resources that.

Processes April 5, 2000 Instructor: Gary Kimura Slides courtesy of Hank Levy.

Rensselaer Polytechnic Institute CSCI-4210 – Operating Systems David Goldschmidt, Ph.D.

Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.

CPU-Scheduling Whenever the CPU becomes idle, the operating system must select one of the processes in the ready queue to be executed. The short term scheduler.

Computer Architecture and Operating Systems CS 3230: Operating System Section Lecture OS-3 CPU Scheduling Department of Computer Science and Software Engineering.

Operating System Concepts and Techniques Lecture 7 Scheduling-3 M. Naghibzadeh Reference M. Naghibzadeh, Operating System Concepts and Techniques, First.

Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.

Scheduling Chap 2. Scheduling Introduction to Scheduling (1) Bursts of CPU usage alternate with periods of I/O wait –a CPU-bound process –an I/O bound.

Round Robin Scheduling A preemptive scheduling designed for Time Sharing Systems The Ready Queue is treated as a circular queue A small execution.

Exercise (4). Exercise Assume the following jobs are executed with one processor, with the jobs arriving in the order listed in the table. – Suppose a.

Chapter 2 Parallel Architecture. Moore’s Law The number of transistors on a chip doubles every years. – Has been valid for over 40 years – Can’t.

Progress Report 2014/02/12. Previous in IPDPS’14 Energy-efficient task scheduling on per- core DVFS architecture ◦ Batch mode  Tasks with arrival time.

1 QUEUES. 2 Definition A queue is a linear list in which data can only be inserted at one end, called the rear, and deleted from the other end, called.

Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.

1 Dr. Ali Amiri TCOM 5143 Lecture 8 Capacity Assignment in Centralized Networks.

OPERATING SYSTEMS CS 3530 Summer 2014 Systems with Multi-programming Chapter 4.

Scanf n, a, b /* I-O wait */ for (i=1; i

Progress Report 2013/11/07. Outline Further studies about heterogeneous multiprocessing other than ARM Cache miss issue Discussion on task scheduling.

Lecture 2a: Performance Measurement. Goals of Performance Analysis The goal of performance analysis is to provide quantitative information about the performance.

CS340d: Operating Systems

Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.

1 CS.217 Operating System By Ajarn..Sutapart Sappajak,METC,MSIT Chapter 5 CPU Scheduling Slide 1 Chapter 5 CPU Scheduling.

Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.

Outline Models Design of experiments Current Scheduler Completely Fair Scheduler(CFS) ◦ Since Linux ◦ /kernel/sched.c ◦ Maintain balance (fairness)

Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.

Lecture Topics: 11/15 CPU scheduling: –Scheduling goals and algorithms.

Process CPUArrival Time P P2 3 0 P3 3 0 The Gantt Chart for the schedule is: Waiting time for P1 = (7-7)=0; P2 = (0-0)=0; P3 = (3-0)

Operating System Concepts and Techniques Lecture 6 Scheduling-2* M. Naghibzadeh Reference M. Naghibzadeh, Operating System Concepts and Techniques, First.

Operating System Examples - Scheduling. References r er/ch10.html r bangalore.org/blug/meetings/200401/scheduler-

Basic Concepts Maximum CPU utilization obtained with multiprogramming

IIS Progress Report 2016/01/11. Goal Propose an energy-efficient scheduler that minimize the power consumption while providing sufficient computing resources.

OPERATING SYSTEMS CS 3502 Fall 2017

CPU Scheduling CSSE 332 Operating Systems

CHT Project Progress Report

EEE Embedded Systems Design Process in Operating Systems 서강대학교 전자공학과

Lecture Topics: 11/1 Processes Process Management

Priority Scheduling Example

Computing Resource Allocation and Scheduling in A Data Center

Process Scheduling B.Ramamurthy 9/16/2018.

Module 5: CPU Scheduling

Operating Systems Lecture 15.

So far…. Firmware identifies hardware devices present

3: CPU Scheduling Basic Concepts Scheduling Criteria

Process Scheduling B.Ramamurthy 12/5/2018.

COMP60611 Fundamentals of Parallel and Distributed Systems

Greedy Methods Knapsack Problem Hoffman Codes

Processes Hank Levy 1.

Unit 0 Science Fundamentals.

Processes and Process Management

Single server model Queue Server I/O Controller And device Arrivals.

Process Scheduling B.Ramamurthy 2/23/2019.

COMP60621 Designing for Parallelism

Process Scheduling B.Ramamurthy 4/11/2019.

Process Scheduling B.Ramamurthy 4/7/2019.

Uniprocessor scheduling

Module 5: CPU Scheduling

CPU SCHEDULING CPU SCHEDULING.

Progress Report 2012/12/20.

Processes Hank Levy 1.

Shortest Remaining Time

CPU Scheduling.

IIS Progress Report 2016/01/18.

Progress Report 2013/08/08.

Module 5: CPU Scheduling

Chapter 5: CPU Scheduling

Presentation transcript:

Progress Report 2013/08/22

Model Modification Each core works under the same frequency due to hardware limitation. A task can have different processing rates during its execution.

Observation 1 If there is only one task, the processing rate should remain unchanged. => w = 0 or 1 w 1-w

Processing rate According to observation 1, if there is only one task, the cost is: Assume that p j leads to the smallest cost. p j is independent with B.

Length of Overlapping Assume that tasks have different arrival time. Increase the processing rate of Task 0 during t 0 to t 1 reduces the overlapping of Task 0 and Task 1. Task 0 t1t1 t0t0 Task 1 Task 0 Task 1 t2’t2’t2t2

Length of Overlapping(Cont.) However, if p j is independent with B, the blue parts of Task 1 must have the same processing rate. Task 0 t1t1 t0t0 Task 1 Task 0 Task 1 t2’t2’t2t2

Queuing Theory Compute the average waiting time of tasks, and adjust the processing rate. CPU (1-p) p I/O λ μ

Concern Scheduling under “each core with the same frequency” makes our work no difference with the others.

Disccusion