Static WCET Analysis vs. Measurement: What is the Right Way to Access Real-Time Task Timing? David Fleeman { Center.

Slides:



Advertisements
Similar presentations
Feedback Control Real- time Scheduling James Yang, Hehe Li, Xinguang Sheng CIS 642, Spring 2001 Professor Insup Lee.
Advertisements

Feedback EDF Scheduling Exploiting Dynamic Voltage Scaling Yifan Zhu and Frank Mueller Department of Computer Science Center for Embedded Systems Research.
Simulation of Feedback Scheduling Dan Henriksson, Anton Cervin and Karl-Erik Årzén Department of Automatic Control.
QoS-based Management of Multiple Shared Resources in Dynamic Real-Time Systems Klaus Ecker, Frank Drews School of EECS, Ohio University, Athens, OH {ecker,
Starfish: A Self-tuning System for Big Data Analytics.
November 23, 2005 Egor Bondarev, Michel Chaudron, Peter de With Scenario-based PA Method for Dynamic Component-Based Systems Egor Bondarev, Michel Chaudron,
Real- time Dynamic Voltage Scaling for Low- Power Embedded Operating Systems Written by P. Pillai and K.G. Shin Presented by Gaurav Saxena CSE 666 – Real.
SLA-Oriented Resource Provisioning for Cloud Computing
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems (m, k)-firm tasks and QoS enhancement.
Tasks Periodic The period is the amount of time between each iteration of a regularly repeated task Time driven The task is automatically activated by.
SKELETON BASED PERFORMANCE PREDICTION ON SHARED NETWORKS Sukhdeep Sodhi Microsoft Corp Jaspal Subhlok University of Houston.
Virtualization and Cloud Computing Virtualization David Bednárek, Jakub Yaghob, Filip Zavoral.
Presenter: David Fleeman { D. Juedes, F. Drews, L. Welch and D. Fleeman Center for Intelligent, Distributed & Dependable.
Adaptive Sampling for Sensor Networks Ankur Jain ٭ and Edward Y. Chang University of California, Santa Barbara DMSN 2004.
A Grid Resource Broker Supporting Advance Reservations and Benchmark- Based Resource Selection Erik Elmroth and Johan Tordsson Reporter : S.Y.Chen.
Preemptive Behavior Analysis and Improvement of Priority Scheduling Algorithms Xiaoying Wang Northeastern University China.
1 of 14 1/15 Schedulability Analysis and Optimization for the Synthesis of Multi-Cluster Distributed Embedded Systems Paul Pop, Petru Eles, Zebo Peng Embedded.
Embedded and Real Time Systems Lecture #4 David Andrews
Integrated Control and Scheduling James Yang, Steve Sheng, Bill Li Instructor: Prof. Insup Lee.
Grid Load Balancing Scheduling Algorithm Based on Statistics Thinking The 9th International Conference for Young Computer Scientists Bin Lu, Hongbin Zhang.
Dynamic Reconfiguration of Component-based Real-time Software Words February 2005 Sedona, Arizona, USA Andreas Rasche, Andreas Polze and Martin.
Wk 2 – Scheduling 1 CS502 Spring 2006 Scheduling The art and science of allocating the CPU and other resources to processes.
By Group: Ghassan Abdo Rayyashi Anas to’meh Supervised by Dr. Lo’ai Tawalbeh.
Bandwidth Allocation in a Self-Managing Multimedia File Server Vijay Sundaram and Prashant Shenoy Department of Computer Science University of Massachusetts.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 1: Introduction What is an Operating System? Mainframe Systems Desktop Systems.
Minimizing Response Time Implication in DVS Scheduling for Low Power Embedded Systems Sharvari Joshi Veronica Eyo.
VOLTAGE SCHEDULING HEURISTIC for REAL-TIME TASK GRAPHS D. Roychowdhury, I. Koren, C. M. Krishna University of Massachusetts, Amherst Y.-H. Lee Arizona.
Quality-based Adaptive Resource Management Architecture (QARMA): A CORBA Resource Management Service Presenter: David Fleeman {
Predicting performance of applications and infrastructures Tania Lorido 27th May 2011.
ParaScale : Exploiting Parametric Timing Analysis for Real-Time Schedulers and Dynamic Voltage Scaling Sibin Mohan 1 Frank Mueller 1,William Hawkins 2,
Integrating Fine-Grained Application Adaptation with Global Adaptation for Saving Energy Vibhore Vardhan, Daniel G. Sachs, Wanghong Yuan, Albert F. Harris,
Quality of Service Karrie Karahalios Spring 2007.
Page 1 2P13 Week 9. Page 2 Table 9.2 Scheduling Criteria User Oriented, Performance Related Turnaround time This is the interval of time between the submission.
Operating Systems Process Management.
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
Euro-Par, A Resource Allocation Approach for Supporting Time-Critical Applications in Grid Environments Qian Zhu and Gagan Agrawal Department of.
Introduction to the Adapter Server Rob Mace June, 2008.
Zheng Wu. Background Motivation Analysis Framework Intra-Core Cache Analysis Cache Conflict Analysis Optimization Techniques WCRT Analysis Experiment.
Undergraduate course on Real-time Systems Linköping 1 of 45 Autumn 2009 TDDC47: Real-time and Concurrent Programming Lecture 5: Real-time Scheduling (I)
What Shape is Your Real-Time System? Lonnie R. Welch Intelligent, Real-Time, Secure Systems Lab. School of EECS Ohio University Michael.
SE-3910 Real-time Systems Week 5, Class 2 – Lab turn-in page is up! – Use interrupts in a Linux/C environment – Scheduling – Watchdog follow-up Watchdog.
DynamicMR: A Dynamic Slot Allocation Optimization Framework for MapReduce Clusters Nanyang Technological University Shanjiang Tang, Bu-Sung Lee, Bingsheng.
Introduction to Embedded Systems Rabie A. Ramadan 5.
1 of 14 1/15 Schedulability-Driven Frame Packing for Multi-Cluster Distributed Embedded Systems Paul Pop, Petru Eles, Zebo Peng Embedded Systems Lab (ESLAB)
Q G Making Storage Real-time Steve Modica, CTO, Small Tree.
CS4315A. Berrached:CMS:UHD1 Introduction to Operating Systems Chapter 1.
Task Mapping and Partition Allocation for Mixed-Criticality Real-Time Systems Domițian Tămaș-Selicean and Paul Pop Technical University of Denmark.
Undergraduate course on Real-time Systems Linköping University TDDD07 Real-time Systems Lecture 2: Scheduling II Simin Nadjm-Tehrani Real-time Systems.
Euro-Par, HASTE: An Adaptive Middleware for Supporting Time-Critical Event Handling in Distributed Environments ICAC 2008 Conference June 2 nd,
Review etc.. Want to get out of here by 10am Go see 373 projects.
Theme Guidance - Network Traffic Proposed NMLRG IETF 95, April 2016 Sheng Jiang (Speaker, Co-chair) Page 1/6.
Introduction to Performance Tuning Chia-heng Tu PAS Lab Summer Workshop 2009 June 30,
Spark on Entropy : A Reliable & Efficient Scheduler for Low-latency Parallel Jobs in Heterogeneous Cloud Huankai Chen PhD Student at University of Kent.
Undergraduate course on Real-time Systems Linköping TDDD07 – Real-time Systems Lecture 1: Introduction & Scheduling I Simin Nadjm-Tehrani Real-time Systems.
Optimization of Time-Partitions for Mixed-Criticality Real-Time Distributed Embedded Systems Domițian Tămaș-Selicean and Paul Pop Technical University.
Embedded System Scheduling
CHaRy Software Synthesis for Hard Real-Time Systems
Unit OS9: Real-Time and Embedded Systems
Standards and Patterns for Dynamic Resource Management
ICS Principles of Operating Systems
So far… Text RO …. printf() RW link printf Linking, loading
Utility-Function based Resource Allocation for Adaptable Applications in Dynamic, Distributed Real-Time Systems Presenter: David Fleeman {
Transparent Contribution of Memory
Operating System Introduction.
Aravindh Anantaraman*, Kiran Seth†, Eric Rotenberg*, Frank Mueller‡
Operating System , Fall 2000 EA101 W 9:00-10:00 F 9:00-11:00
Feedback Control Real-time Scheduling
FAST: Frequency-Aware Static Timing Analysis
Cloud Resource Scheduling for Online and Batch Applications
Transparent Contribution of Memory
Presentation transcript:

Static WCET Analysis vs. Measurement: What is the Right Way to Access Real-Time Task Timing? David Fleeman { Center for Intelligent, Distributed & Dependable Systems Ohio University Athens, OH Panel Session WPDRTS 2004 April 26, 2004

2 Organization of the Panel Introduction –David Fleeman Center for Intelligent, Distributed & Dependable Systems (CIDDS), Ohio University, USA. Speakers –Christian Ferdinand “Worst Case Execution Time Prediction by Static Program Analysis” –Charles Cavanaugh “On Static WCT Analysis vs. Run-time Monitoring of Execution Time” –Frank Mueller “Timing Analysis: In Search of Multiple Paradigms” Panel Discussion –Peter Puschner Technische Universitat, Vienna, Austria.

3 Introduction Two common methods to calculate/collect resource usage profiles: –Static WCET Analysis –Measurement Compiler-time analysis of the code can be used to determine the longest execution sequence. Simulation of an application can be used to gather measured execution time. If you have resource usage profiles for all applications (and some additional information), then you can estimate/calculate the execution time of a particular application when deployed. This panel will explore the methods and the benefits / drawbacks of both Static WCET Analysis and Measurement.

4 What Types of Applications? Hard Real-Time: Can not miss deadlines. Firm Real-Time: Acceptable to temporarily miss deadlines. Soft Real-Time: Acceptable to miss deadlines, but not desirable. Non Real-Time: Batch jobs and best-effort

5 What Types of Applications? Multiple Levels of Fidelity Affected by Environmental Factors NoFixedDynamic YesAdaptableDynamic, Adaptable Fixed: Execution requirements do not change Dynamic: Execution requirements are dependent on environmental conditions such as load. Adaptable: Execution requirements are dependent on the current level of fidelity such as at a lower frame rate for the UAV system.

6 A Motivating Application System Extrinsic Attributes (QARMA terminology) –Environmental conditions that are out of the control of the system that may affect both the resource usage and the “benefit / utility” of the system. Service Attributes (QARMA terminology) –Control knobs that can be adjusted to affect both the resource usage and the “benefit / utility” of the system. Image Processing System –EA: Camera Capture Rate from 0 images/sec to 3 images/sec –EA: Cloud Cover of the Earth’s atmosphere from 0-100% –SA: Pixel Percentage to be processed (discrete set) –SA: Compression algorithm (discrete set) The cyclic execution time dependent on the pixel percentage and compression algorithm. The total resource usage also dependent upon the camera rate.

7 Issues With Measurement Profile the cyclic execution time of each application at the various settings for service and extrinsic attributes. –May be difficult to simulate appropriate extrinsic attributes that will cover all run-time situations. –May be difficult to isolate the application from the rest of the system in order to avoid unwanted contention. –May not capture actual WCET resulting in possible missed deadlines at run-time. –Must repeat this process for a lot of profiling points.

8 Issues With Static WCET Analysis Profile the cyclic execution time of each application at the various settings for service and extrinsic attributes. –We defer this question to the panel?

9 Interesting Questions Can Static WCET Analysis be used to capture WCET for a particular configuration and/or environment for a dynamic and adaptable system? In normal execution, how much of the CPU resource is under-utilized while reserving cycles for the WCET scenario? Can Static WCET Analysis and Measurement be used in tandem to improve system performance?

10 Perhaps Another Discussion: Run-Time Issues Operating System –Interrupts –Scheduling Algorithm –Real-time or not Contention for Shared Resources Affects Execution Time –Disk accesses –Bandwidth through network channels –Memory paging How do you calculate the execution time for the actual deployed application when we have all these run-time issues? How useful are these WCET and measured profiles?