Progress Report 2013/08/08.

Slides:

Advertisements

Similar presentations

Feedback EDF Scheduling Exploiting Dynamic Voltage Scaling Yifan Zhu and Frank Mueller Department of Computer Science Center for Embedded Systems Research.

Advertisements

CH 5. CPU Scheduling Basic Concepts F CPU Scheduling  context switching u CPU switching for another process u saving old PCB and loading.

Cloud Computing Resource provisioning Keke Chen. Outline  For Web applications statistical Learning and automatic control for datacenters  For data.

BFS: Brain F*ck Scheduler Jacob Chan. Objectives  Brain F*ck Scheduling  What it is  How it works  Features  Scalability  Limitations  Definition.

Energy-efficient Virtual Machine Provision Algorithms for Cloud System Ching-Chi Lin Institute of Information Science, Academia Sinica Department of Computer.

Power Management Algorithms An effort to minimize Processor Temperature and Energy Consumption.

On Schedulability and Time Composability of Data Aggregation Networks Fatemeh Saremi *, Praveen Jayachandran †, Forrest Iandola *, Md Yusuf Sarwar Uddin.

Lab Meeting Performance Analysis of Distributed Embedded Systems Lothar Thiele and Ernesto Wandeler Presented by Alex Cameron 17 th August, 2012.

Remain silent and write on index card: 1. As the “game” progressed, how or what were you feeling? 2.How did you interpret others’ behaviors? 3.What can.

Simulation with ArenaChapter 2 – Fundamental Simulation Concepts Discrete Event “Hand” Simulation of a GI/GI/1 Queue.

Uniprocessor Scheduling III CPSC 410 Operating Systems Department of Physics, Computer Science and Engineering Christopher Newport University.

Techniques for Efficient Processing in Runahead Execution Engines Onur Mutlu Hyesoon Kim Yale N. Patt.

RISC Processor I/O By Eric Schultz Under Advisement of Dr. Vinod Prasad.

Job scheduling Queue discipline.

Performance Evaluation Techniques Professor Bob Kinicki Computer Science Department.

End-to-End Delay Analysis for Fixed Priority Scheduling in WirelessHART Networks Abusayeed Saifullah, You Xu, Chenyang Lu, Yixin Chen.

IPDPS’14 Reviewer’s Comments. Summary Typos. Energy model ◦ Too simple. Cost function ◦ Should use more standardized cost functions such as the energy-

November , 2009SERVICE COMPUTATION 2009 Analysis of Energy Efficiency in Clouds H. AbdelSalamK. Maly R. MukkamalaM. Zubair Department.

Using Loop Perforation to Dynamically Adapt Application Behavior to Meet Real-Time Deadlines Henry Hoffmann, Sasa Misailovic, Stelios Sidiroglou, Anant.

Liam Newcombe BCS Data Centre Specialist Group Secretary Modelling Data Centre Energy Efficiency and Cost.

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

An Energy-Efficient Hypervisor Scheduler for Asymmetric Multi- core 1 Ching-Chi Lin Institute of Information Science, Academia Sinica Department of Computer.

10 th December, 2013 Lab Meeting Papers Reviewed:.

Hard Real-Time Scheduling for Low- Energy Using Stochastic Data and DVS Processors Flavius Gruian Department of Computer Science, Lund University Box 118.

Q N U Schedule Risk Management By Ursula Kuehn, PMP, EVP UQN and Associates.

Operating Systems for Reconfigurable Embedded Platforms: Online Scheduling of Real-Time Tasks -Ramkumar Shankar.

Understanding Performance, Power and Energy Behavior in Asymmetric Processors Nagesh B Lakshminarayana Hyesoon Kim School of Computer Science Georgia Institute.

An Energy-efficient Task Scheduler for Multi-core Platforms with per-core DVFS Based on Task Characteristics Ching-Chi Lin Institute of Information Science,

. Introduction NeuroVision™ NVC vision correction technology is a non-invasive, patient-specific treatment based on visual stimulation and facilitation.

VICOMTECH VISIT AT CERN CERN 2013, October 3 rd & 4 th O.COUET CERN/PH/SFT DATA VISUALIZATION IN HIGH ENERGY PHYSICS THE ROOT SYSTEM.

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

June 30 - July 2, 2009AIMS 2009 Towards Energy Efficient Change Management in A Cloud Computing Environment: A Pro-Active Approach H. AbdelSalamK. Maly.

Data Scheduling for Multi-item and transactional Requests in On-demand Broadcast Nitin Pabhu Vijay Kumar MDM 2005.

OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.

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

Xi He Golisano College of Computing and Information Sciences Rochester Institute of Technology Rochester, NY THERMAL-AWARE RESOURCE.

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

Workload Clustering for Increasing Energy Savings on Embedded MPSoCs S. H. K. Narayanan, O. Ozturk, M. Kandemir, M. Karakoy.

CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Energy-aware QoS packet scheduling.

Time Remaining 20:00.

Movement-Based Check-pointing and Logging for Recovery in Mobile Computing Systems Sapna E. George, Ing-Ray Chen, Ying Jin Dept. of Computer Science Virginia.

ECE692 Course Project Proposal Cache-aware power management for multi-core real-time systems Xing Fu Khairul Kabir 16 September 2009.

Zeta: Scheduling Interactive Services with Partial Execution Yuxiong He, Sameh Elnikety, James Larus, Chenyu Yan Microsoft Research and Microsoft Bing.

Energy-efficient Scheduling policy for collaborative execution in mobile cloud computing INFOCOM '13.

Basic Concepts Maximum CPU utilization obtained with multiprogramming

GCSE Physical Education Unit – Physical Activity as part of your healthy, active lifestyle PRINCIPLES OF TRAINING.

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

Scheduling SDP Processing Pipelines – A Combinatorial Optimisation Approach Chen Wu, ICRAR In collaboration with DFMS team.

Adaptive Cache Partitioning on a Composite Core

Modeling and Simulation (An Introduction)

Activity List the human resources needed on your project

Kalin Siow,1,2 Donald T.H. Tan1,2,3

Computing Resource Allocation and Scheduling in A Data Center

ALGORITHMS & FLOWCHARTING II

مبررات إدخال الحاسوب في رياض الأطفال

CPU Scheduling G.Anuradha

CMSC 611: Advanced Computer Architecture

Serial versus Pipelined Execution

Physics-based simulation for visual computing applications

Energy Efficient Scheduling in IoT Networks

21twelveinteractive.com/ twitter.com/21twelveI/ facebook.com/21twelveinteractive/ linkedin.com/company/21twelve-interactive/ pinterest.com/21twelveinteractive/

Discrete Event “Hand” Simulation of a GI/GI/1 Queue

NET 424: REAL-TIME SYSTEMS (Practical Part)

CMSC 611: Advanced Computer Architecture

Progress Report 2012/12/20.

Progress Report 2017/02/08.

IIS Progress Report 2016/01/18.

Research Topics Embedded, Real-time, Sensor Systems Frank Mueller moss

Scheduling of Regular Tasks in Linux

Presentation transcript:

Progress Report 2013/08/08

Computation & Background Tasks Example Deadline of interactive task 1 Deadline of interactive task 2 Deadline of interactive task 3 Interactive Task 1 Computation & Background Tasks Interactive Task 2 Computation Task 3 Interactive Task 3 i=1 i=2 Core0 H Interactive Task 3 Computation Task 4 Core1 H Computation Task 1 Back ground Task 2 Core2 L Computation Task 2 Background Task 1 Core3 L

Workload – Candy Crush

Workload – Monkey

Simulation Input

Simulation Results - Drop Energy After Normalization Drop Ratio Baseline 2194560e 1.0 Adaptive 1374015e 0.626 1.01% IEDF+BF 739080e 0.337 6.81%

Simulation Results - Compensate Energy After Normalization Baseline 2194560e 1.0 Adaptive 1381700e 0.630 IEDF+BF 1042584e 0.475

Simulation Results - Comparison Energy After Normalization Case 1 Baseline 2194560e 1.0 Adaptive 1381700e 0.630 IEDF+BF 1042584e 0.475 Case 2 (Busy) 2100384e 2086221e 0.993 2147957e 1.023

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

Observation 2 Frequency changing only happens when a new task arrived or a task has finished. B2-B1 B1 B1 B1 B2-B1 B1

Length of Overlapping Assume that tasks have different arrival time. Increase the processing rate of Task0 during t0 to t1 reduces the overlapping of Task0 and Task1. Task0 t1 t0 Task1 t2’ t2

Discussion