Fine Grain Quality Management
|
|
- Gwendolyn Fox
- 6 years ago
- Views:
Transcription
1 Fine Grain Quality Management Jacques Combaz Jean-Claude Fernandez Mohamad Jaber Joseph Sifakis Loïc Strus Verimag Lab. Université Joseph Fourier Grenoble, France DCS seminar, 10 June 2008, Col de Porte Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
2 Outline 1 Motivations Video Encoder Problem & Approaches 2 Fine Grain QoS Control Model Approach Summary 3 Stochastic Approach Model & Problem Stochastic Mixed Quality Management Policy Performance Analysis Conclusion 4 Learning Problem Neural networks Experimental results Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
3 Motivations 1 Motivations Video Encoder Problem & Approaches 2 Fine Grain QoS Control Model Approach Summary 3 Stochastic Approach Model & Problem Stochastic Mixed Quality Management Policy Performance Analysis Conclusion 4 Learning Problem Neural networks Experimental results Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
4 Video Encoder Motivations Video Encoder collaboration with STMicroelectronics (GaloGiC project) embedded video encoder macroblock camera... input frames quality q level frame MotEst(q); DCT(q); Quant(q);... Coding(q); video encoder bitstream (encoded frame)... Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
5 Motivations Video Encoder Video Encoder collaboration with STMicroelectronics (GaloGiC project) embedded video encoder macroblock camera... input frames quality q level frame MotEst(q); DCT(q); Quant(q);... Coding(q); video encoder bitstream (encoded frame)... deadline D real-time constraints (e.g. D = 1/30 s = 33 ms) limited resources intensive computing uncertainty on execution times we propose an online adaptation of the quality level parameters q Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
6 Motivations Problem & Approaches Problem & Approaches Problem (embedded video encoder) meet the deadlines input buffer minimization avoid frame skipping optimal use of resources QoS maximization Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
7 Motivations Problem & Approaches Problem & Approaches Problem (embedded video encoder) meet the deadlines input buffer minimization avoid frame skipping optimal use of resources QoS maximization Existing Approaches hard real-time (critical system engineering) worst-case analysis meet the deadlines soft real-time (best-effort engineering) average-case analysis no guarantee efficient use of resources Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
8 Motivations Problem & Approaches Problem & Approaches Problem (embedded video encoder) meet the deadlines input buffer minimization avoid frame skipping optimal use of resources QoS maximization Our Approach bridging the gap by using adaptive techniques adapting software behaviour by setting quality level parameters optimal use of computing resources with real-time guarantees Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
9 Fine Grain QoS Control 1 Motivations Video Encoder Problem & Approaches 2 Fine Grain QoS Control Model Approach Summary 3 Stochastic Approach Model & Problem Stochastic Mixed Quality Management Policy Performance Analysis Conclusion 4 Learning Problem Neural networks Experimental results Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
10 Model Fine Grain QoS Control Model Application Software s 0 a 1 s 1 a 2... a n s n s i : control point a i : actions parameterized by integer quality levels q i Q = [q min, q max ] Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
11 Model Fine Grain QoS Control Model Application Software s 0 a 1 s 1 a 2... a n s n s i : control point a i : actions parameterized by integer quality levels q i Q = [q min, q max ] Estimates of Execution Times (increasing with quality) C av (a i, q): average execution time of a i at the quality level q C wc (a i, q): worst-case execution time of a i at the quality level q Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
12 Fine Grain QoS Control Model Model Application Software s a 1 a 2 a n 0... s 1 s n s i : control point a i : actions parameterized by integer quality levels q i Q = [q min, q max ] D Estimates of Execution Times (increasing with quality) C av (a i, q): average execution time of a i at the quality level q C wc (a i, q): worst-case execution time of a i at the quality level q Real-Time Constraints D: deadline for the completion of the actions Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
13 Fine Grain QoS Control Approach Quality Management Problem Application software: s a 1 a 2 a n 0 s 1... s n D The Problem find quality level parameters q i such that: safety deadlines are met optimality maximization of the quality levels smoothness of the quality levels online computation of the quality levels q i Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
14 Fine Grain QoS Control Quality Manager Design Approach next quality level q i Quality Manager Γ quality management policy X: q i = max { q Q t X (s i, q) t i 1 } Application Software control point s i 1, actual time t i 1 s i 1, t i 1 remaining execution time (estimate) for quality q: C X (a i..a n, q) feasibility criterion: D C X (a i..a n, q) + t i 1 we define t X (s i 1, q) = D C X (a i..a n, q) Quality Management Policy X at state (s i 1, t i 1 ) choosing the best quality level which is feasible, i.e.: q i := max { q t X (s i 1, q) t i 1 } Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
15 Fine Grain QoS Control Approach Mixed Quality Management Policy [EMSOFT 05,RTS] s n D s i 1 accessible states from (s i 1, t i 1 ) t i 1 (actual time) t D Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
16 Fine Grain QoS Control Approach Mixed Quality Management Policy [EMSOFT 05,RTS] s n D average behavior s i 1 t i 1 (actual time) t D average behavior: C av (a i..a n, q) = C av (a i, q) C av (a n, q) Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
17 Fine Grain QoS Control Approach Mixed Quality Management Policy [EMSOFT 05,RTS] s n D worst-case behavior average behavior s i 1 t i 1 (actual time) t D average behavior: C av (a i..a n, q) = C av (a i, q) C av (a n, q) worst-case behavior (under control): C sf (a i..a n, q) = C wc (a i, q) + C wc (a i+1, q min ) C wc (a n, q min ) Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
18 Fine Grain QoS Control Approach Mixed Quality Management Policy [EMSOFT 05,RTS] s n D worst-case behavior average behavior s i 1 t i 1 (actual time) t D average behavior: C av (a i..a n, q) = C av (a i, q) C av (a n, q) worst-case behavior (under control): C sf (a i..a n, q) = C wc (a i, q) + C wc (a i+1, q min ) C wc (a n, q min ) C mx = C av + δ max, where δ max (a i..a n, q) = max { C sf (a j..a n, q) C av (a j..a n, q) j i } Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
19 Summary Fine Grain QoS Control Summary (+) fine grain quality management mixed policy: improves predictability reduces the impact of the worst-case (measured by δ max ) safety, optimality, smoothness Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
20 Summary Fine Grain QoS Control Summary (+) fine grain quality management mixed policy: improves predictability reduces the impact of the worst-case (measured by δ max ) safety, optimality, smoothness (-) limitations worst-case estimates: complex HW platforms computation of worst-case estimates non-flexibility only 100% guarantee low predictability and low time budget utilization for: controllable uncontrollable {}}{{}}{ δ max ( a 1 a a j a j+1 a j a n, q) can be sizable Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
21 Summary Fine Grain QoS Control Summary (+) fine grain quality management mixed policy: improves predictability reduces the impact of the worst-case (measured by δ max ) safety, optimality, smoothness (-) limitations worst-case estimates: complex HW platforms computation of worst-case estimates non-flexibility only 100% guarantee low predictability and low time budget utilization for: controllable uncontrollable {}}{{}}{ δ max ( a 1 a a j a j+1 a j a n, q) can be sizable we need soft real-time methodologies that provide guarantees & predictability Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
22 Stochastic Approach 1 Motivations Video Encoder Problem & Approaches 2 Fine Grain QoS Control Model Approach Summary 3 Stochastic Approach Model & Problem Stochastic Mixed Quality Management Policy Performance Analysis Conclusion 4 Learning Problem Neural networks Experimental results Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
23 Model & Problem Stochastic Approach Model & Problem Estimates of the Execution Times the integer probability distribution function d q i : d q i : N [0, 1] d q i (k) = P[" execution time of a i at quality q is k"] + k=0 d q i (k) = 1 independent execution times Problem find a Quality Manager Γ s.t.: safety the deadline miss ratio is a target ratio µ [0, 1] optimality maximization of the quality levels smoothness of the quality levels Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
24 Stochastic Approach Stochastic Mixed Quality Management Policy Stochastic Mixed Quality Management Policy d q (k) i k Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
25 Stochastic Approach Stochastic Mixed Quality Management Policy Stochastic Mixed Quality Management Policy d q (k) i probability = τ worst-case: probabilistic Cτ wc actual estimate C0 wc C wc probabilistic worst-case execution time Cτ wc (a i, q) s.t.: C wc τ (a i, q) = min { l + k=l k d q i (k) τ} Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
26 Stochastic Approach Stochastic Mixed Quality Management Policy Stochastic Mixed Quality Management Policy d q (k) i probability = τ worst-case: probabilistic Cτ wc actual estimate C0 wc C wc probabilistic worst-case execution time Cτ wc (a i, q) s.t.: C wc τ (a i, q) = min { l + k=l k d q i (k) τ} average execution time (mean value): C av (a i, q) = + k=0 kd q i (k) Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
27 Stochastic Approach Performance Analysis Performance Analysis d i : probability distribution for actual time t i (completion of a 1..a i ) recursive computation of d i : d i (k) = + l=0 d i 1 (l)d q i i (k l), where q i = Γ(s i 1, l) Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
28 Stochastic Approach Performance Analysis Performance Analysis d i : probability distribution for actual time t i (completion of a 1..a i ) recursive computation of d i : d i (k) = + l=0 d i 1 (l)d q i i (k l), where q i = Γ(s i 1, l) Performance of the Quality Manager Γ expected deadline miss ratio: P[t n > D] = k>d d n (k) expected time budget utilization: E(t n ) = + k=0 kd n (k) Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
29 Stochastic Approach Performance Analysis Performance Analysis expected deadline miss ratio parameter τ Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
30 Stochastic Approach Performance Analysis Performance Analysis target µ expected deadline miss ratio parameter τ τ Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
31 Stochastic Approach Performance Analysis Performance Analysis target µ expected deadline miss ratio parameter τ τ expected time budget utilization (%) parameter τ Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
32 Performance Analysis Stochastic Approach Performance Analysis expected deadline miss ratio schedule #1 (S 1, A) schedule #2 (S 2, A) parameter τ expected time budget utilization (%) schedule #1 (S 1, A) schedule #2 (S 2, A) parameter τ Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
33 Performance Analysis Stochastic Approach Performance Analysis expected deadline miss ratio parameter τ expected time budget utilization (%) parameter τ time budget utilization (%) τ = 0.3 time budget utilization (%) τ = frame number frame number Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
34 Conclusion Stochastic Approach Conclusion stochastic mixed quality management policy: soft real-time guarantees achieving a tradeoff time budget utilization / deadline miss ratio parameterized worst-case scenario influence: parameter τ: 0 1 deadlines: hard soft code reuse: one source for different target HWs / QoS requirements perspectives: depencies between execution times multiple tasks, multiple processors, operating systems Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
35 Learning 1 Motivations Video Encoder Problem & Approaches 2 Fine Grain QoS Control Model Approach Summary 3 Stochastic Approach Model & Problem Stochastic Mixed Quality Management Policy Performance Analysis Conclusion 4 Learning Problem Neural networks Experimental results Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
36 Problem Learning Problem Using worst-case execution time is problematic in some cases! controllable uncotrollable {}}{{}}{ a 1, a 2,..., a j a j+1,..., a n D Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
37 Problem Learning Problem Using worst-case execution time is problematic in some cases! controllable uncotrollable {}}{{}}{ a 1, a 2,..., a j a j+1,..., a n D mixed Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
38 Problem Learning Problem Using worst-case execution time is problematic in some cases! controllable uncotrollable {}}{{}}{ a 1, a 2,..., a j a j+1,..., a n D mixed average Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
39 Problem Learning Problem Using worst-case execution time is problematic in some cases! controllable uncotrollable {}}{{}}{ a 1, a 2,..., a j a j+1,..., a n D mixed average refined average Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
40 Problem Learning Problem Using worst-case execution time is problematic in some cases! controllable uncotrollable {}}{{}}{ a 1, a 2,..., a j a j+1,..., a n D mixed average refined average Refine average execution times Better predict the execution time of action using its input Using neural netwroks to predict the execution time Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
41 Neural Network Learning Neural networks A neural network is defined by: L = { L 1, L 2,..., L n } N l is the number of neurons w (l) ij is the weight f l is the activation function θ (l) i is a scalar bias y (l) ( i = f l ( PN l 1 y (l 1) w (l 1) + θ (l) j=1 j ij i ) if l 1 x i (input of neuron i) if l = 1. Input Layer 1-Hidden Layer Output Layer x 1 w (3) 11 y (3) 1 x 2 w (2) 32 w (2) 31 y (2) 3 = f 2 ( P 2 w (2) x i=1 3i i ) Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
42 Learning Neural networks Architecture and learning algorithm Architecture the number of layers ( n ) one hidden layer approximate every continuous function the number of neurons in each layer ( N l ) number of input * 2 the activation functions ( f l ) identity : x x and sigmoid : x 1 1+e βx Learning algorithm (X, Y ) where X = (x 1,..., x N1 ) input and Y = (y 1,..., y Nn ) desired output. N n Minimize E(W ) = 1/2 (y j y (n) j ) 2. 1 Initialize the network weights W. 2 Select a new sample (X, Y ). 3 Update weights of the output and hidden layers using specific rules, that is, W W + W. 4 Go to 3 if the error E(W ) is above a tolerance value. 5 Go to 2 if other samples must be learnt. j=1 Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
43 Experimental framework Learning Experimental results MPEG4 video encoder uncotrollable z } { GM(b 1 )MotEst(q, b 1 )... GM(b 350 )MotEst(q, b 350 ) DCT (b 1 )... Coding(b 1 )... DCT (b 350 )... Coding(b 350 ) b 1 camera input frames... buffer quality q level encoder frame b 350 video encoder bitstream (encoded frame) deadline D Use neural networks for computing refined average of uncotrollable actions. We consider X = (x 1, x 2 ): x 1 is the SAD value (sum of absolute difference) x 2 is the position of the macroblock Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
44 Results Learning Experimental results Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
45 Learning Experimental results Results time budget utilization (ms) fixed average refined average (learning) mixed frame number Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
46 Perspective Learning Experimental results BIP Combaz, Fernandez, Jaber, Sifakis, Strus () Fine Grain Quality Management DCS seminar, 10 June / 25
Using Speed Diagrams for Symbolic Quality Management
Using Speed Diagrams for Symbolic Quality Management Jacques Combaz, Jean-Claude Fernandez, Joseph Sifakis, Loic Strus Verimag, Centre Equation -2avenue de Vignate F38610 Gières, France Abstract We present
More informationECE521 Lectures 9 Fully Connected Neural Networks
ECE521 Lectures 9 Fully Connected Neural Networks Outline Multi-class classification Learning multi-layer neural networks 2 Measuring distance in probability space We learnt that the squared L2 distance
More informationTranslator. Productivity. Functional Correctness. Performance. Efficiency/ Compiler. Correctness. BIP Engine/Linux. Correctness. Multicore Platform
Programming Model Application SW Translator Productivity SW model in BIP Functional Correctness D-Finder System model in BIP DOL Performance Efficiency/ Correctness Correctness Source2Source Distributed
More informationEmbedded Systems Design: Optimization Challenges. Paul Pop Embedded Systems Lab (ESLAB) Linköping University, Sweden
of /4 4 Embedded Systems Design: Optimization Challenges Paul Pop Embedded Systems Lab (ESLAB) Linköping University, Sweden Outline! Embedded systems " Example area: automotive electronics " Embedded systems
More informationECE521 Lecture 7/8. Logistic Regression
ECE521 Lecture 7/8 Logistic Regression Outline Logistic regression (Continue) A single neuron Learning neural networks Multi-class classification 2 Logistic regression The output of a logistic regression
More informationFrom perceptrons to word embeddings. Simon Šuster University of Groningen
From perceptrons to word embeddings Simon Šuster University of Groningen Outline A basic computational unit Weighting some input to produce an output: classification Perceptron Classify tweets Written
More informationRegression-based Statistical Bounds on Software Execution Time
ecos 17, Montreal Regression-based Statistical Bounds on Software Execution Time Ayoub Nouri P. Poplavko, L. Angelis, A. Zerzelidis, S. Bensalem, P. Katsaros University of Grenoble-Alpes - France August
More informationEDF Feasibility and Hardware Accelerators
EDF Feasibility and Hardware Accelerators Andrew Morton University of Waterloo, Waterloo, Canada, arrmorton@uwaterloo.ca Wayne M. Loucks University of Waterloo, Waterloo, Canada, wmloucks@pads.uwaterloo.ca
More informationAndrew Morton University of Waterloo Canada
EDF Feasibility and Hardware Accelerators Andrew Morton University of Waterloo Canada Outline 1) Introduction and motivation 2) Review of EDF and feasibility analysis 3) Hardware accelerators and scheduling
More informationSystem Model. Real-Time systems. Giuseppe Lipari. Scuola Superiore Sant Anna Pisa -Italy
Real-Time systems System Model Giuseppe Lipari Scuola Superiore Sant Anna Pisa -Italy Corso di Sistemi in tempo reale Laurea Specialistica in Ingegneria dell Informazione Università di Pisa p. 1/?? Task
More informationMachine Learning I Continuous Reinforcement Learning
Machine Learning I Continuous Reinforcement Learning Thomas Rückstieß Technische Universität München January 7/8, 2010 RL Problem Statement (reminder) state s t+1 ENVIRONMENT reward r t+1 new step r t
More informationSTA 414/2104: Lecture 8
STA 414/2104: Lecture 8 6-7 March 2017: Continuous Latent Variable Models, Neural networks Delivered by Mark Ebden With thanks to Russ Salakhutdinov, Jimmy Ba and others Outline Continuous latent variable
More informationSymbolic Control of Incrementally Stable Systems
Symbolic Control of Incrementally Stable Systems Antoine Girard Laboratoire Jean Kuntzmann, Université Joseph Fourier Grenoble, France Workshop on Formal Verification of Embedded Control Systems LCCC,
More informationProbabilistic real-time scheduling. Liliana CUCU-GROSJEAN. TRIO team, INRIA Nancy-Grand Est
Probabilistic real-time scheduling Liliana CUCU-GROSJEAN TRIO team, INRIA Nancy-Grand Est Outline What is a probabilistic real-time system? Relation between pwcet and pet Response time analysis Optimal
More informationIntroduction to Machine Learning
Introduction to Machine Learning Neural Networks Varun Chandola x x 5 Input Outline Contents February 2, 207 Extending Perceptrons 2 Multi Layered Perceptrons 2 2. Generalizing to Multiple Labels.................
More informationTime and Schedulability Analysis of Stateflow Models
Time and Schedulability Analysis of Stateflow Models Marco Di Natale Scuola Superiore S. Anna Haibo Zeng Mc Gill University Outline Context: MBD of Embedded Systems Relationship with PBD An Introduction
More informationReal-time Systems: Scheduling Periodic Tasks
Real-time Systems: Scheduling Periodic Tasks Advanced Operating Systems Lecture 15 This work is licensed under the Creative Commons Attribution-NoDerivatives 4.0 International License. To view a copy of
More informationECE521 Lecture7. Logistic Regression
ECE521 Lecture7 Logistic Regression Outline Review of decision theory Logistic regression A single neuron Multi-class classification 2 Outline Decision theory is conceptually easy and computationally hard
More informationDesign of Real-Time Software
Design of Real-Time Software Reference model Reinder J. Bril Technische Universiteit Eindhoven Department of Mathematics and Computer Science System Architecture and Networking Group P.O. Box 513, 5600
More informationNeural Network Training
Neural Network Training Sargur Srihari Topics in Network Training 0. Neural network parameters Probabilistic problem formulation Specifying the activation and error functions for Regression Binary classification
More informationSegment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks
Segment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks Junsung Kim, Björn Andersson, Dionisio de Niz, and Raj Rajkumar Carnegie Mellon University 2/31 Motion Planning on Self-driving Parallel
More informationEPL442: Computational
EPL442: Computational Learning Systems Lab 2 Vassilis Vassiliades Department of Computer Science University of Cyprus Outline Artificial Neuron Feedforward Neural Network Back-propagation Algorithm Notes
More informationHow can ideas from quantum computing improve or speed up neuromorphic models of computation?
Neuromorphic Computation: Architectures, Models, Applications Associative Memory Models with Adiabatic Quantum Optimization Kathleen Hamilton, Alexander McCaskey, Jonathan Schrock, Neena Imam and Travis
More informationEnergy-aware checkpointing of divisible tasks with soft or hard deadlines
Energy-aware checkpointing of divisible tasks with soft or hard deadlines Guillaume Aupy 1, Anne Benoit 1,2, Rami Melhem 3, Paul Renaud-Goud 1 and Yves Robert 1,2,4 1. Ecole Normale Supérieure de Lyon,
More informationBudgeting Under-Specified Tasks for Weakly-Hard Real-Time Systems
Budgeting Under-Specified Tasks for Weakly-Hard Real-Time Systems Zain Hammadeh, Sophie Quinton, Marco Panunzio, Rafik Henia, Laurent Rioux, Rolf Ernst To cite this version: Zain Hammadeh, Sophie Quinton,
More informationOnline Scheduling Switch for Maintaining Data Freshness in Flexible Real-Time Systems
Online Scheduling Switch for Maintaining Data Freshness in Flexible Real-Time Systems Song Han 1 Deji Chen 2 Ming Xiong 3 Aloysius K. Mok 1 1 The University of Texas at Austin 2 Emerson Process Management
More informationNeed for Deep Networks Perceptron. Can only model linear functions. Kernel Machines. Non-linearity provided by kernels
Need for Deep Networks Perceptron Can only model linear functions Kernel Machines Non-linearity provided by kernels Need to design appropriate kernels (possibly selecting from a set, i.e. kernel learning)
More informationSTA 414/2104: Lecture 8
STA 414/2104: Lecture 8 6-7 March 2017: Continuous Latent Variable Models, Neural networks With thanks to Russ Salakhutdinov, Jimmy Ba and others Outline Continuous latent variable models Background PCA
More information4. Multilayer Perceptrons
4. Multilayer Perceptrons This is a supervised error-correction learning algorithm. 1 4.1 Introduction A multilayer feedforward network consists of an input layer, one or more hidden layers, and an output
More informationData Mining Part 5. Prediction
Data Mining Part 5. Prediction 5.5. Spring 2010 Instructor: Dr. Masoud Yaghini Outline How the Brain Works Artificial Neural Networks Simple Computing Elements Feed-Forward Networks Perceptrons (Single-layer,
More informationApprentissage, réseaux de neurones et modèles graphiques (RCP209) Neural Networks and Deep Learning
Apprentissage, réseaux de neurones et modèles graphiques (RCP209) Neural Networks and Deep Learning Nicolas Thome Prenom.Nom@cnam.fr http://cedric.cnam.fr/vertigo/cours/ml2/ Département Informatique Conservatoire
More informationCOMP 551 Applied Machine Learning Lecture 14: Neural Networks
COMP 551 Applied Machine Learning Lecture 14: Neural Networks Instructor: Ryan Lowe (ryan.lowe@mail.mcgill.ca) Slides mostly by: Class web page: www.cs.mcgill.ca/~hvanho2/comp551 Unless otherwise noted,
More informationEmbedded Systems 14. Overview of embedded systems design
Embedded Systems 14-1 - Overview of embedded systems design - 2-1 Point of departure: Scheduling general IT systems In general IT systems, not much is known about the computational processes a priori The
More informationSpatial Transformation
Spatial Transformation Presented by Liqun Chen June 30, 2017 1 Overview 2 Spatial Transformer Networks 3 STN experiments 4 Recurrent Models of Visual Attention (RAM) 5 Recurrent Models of Visual Attention
More informationPreference Elicitation for Sequential Decision Problems
Preference Elicitation for Sequential Decision Problems Kevin Regan University of Toronto Introduction 2 Motivation Focus: Computational approaches to sequential decision making under uncertainty These
More informationLoad Regulating Algorithm for Static-Priority Task Scheduling on Multiprocessors
Technical Report No. 2009-7 Load Regulating Algorithm for Static-Priority Task Scheduling on Multiprocessors RISAT MAHMUD PATHAN JAN JONSSON Department of Computer Science and Engineering CHALMERS UNIVERSITY
More informationLearning Deep Architectures for AI. Part I - Vijay Chakilam
Learning Deep Architectures for AI - Yoshua Bengio Part I - Vijay Chakilam Chapter 0: Preliminaries Neural Network Models The basic idea behind the neural network approach is to model the response as a
More informationThe preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems
The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems Sanjoy Baruah 1 Vincenzo Bonifaci 2 3 Haohan Li 1 Alberto Marchetti-Spaccamela 4 Suzanne Van Der Ster
More informationCycleTandem: Energy-Saving Scheduling for Real-Time Systems with Hardware Accelerators
CycleTandem: Energy-Saving Scheduling for Real-Time Systems with Hardware Accelerators Sandeep D souza and Ragunathan (Raj) Rajkumar Carnegie Mellon University High (Energy) Cost of Accelerators Modern-day
More informationINVERSE RELIABILITY ANALYSIS IN STRUCTURAL DESIGN
INVERSE RELIABILITY ANALYSIS IN STRUCTURAL DESIGN David Lehký, Drahomír Novák Institute of Structural Mechanics, Faculty of Civil Engineering, Brno University of Technology, Brno, Czech Republic.6.0 ISUME
More informationComponent-based Analysis of Worst-case Temperatures
Component-based Analysis of Worst-case Temperatures Lothar Thiele, Iuliana Bacivarov, Jian-Jia Chen, Devendra Rai, Hoeseok Yang 1 How can we analyze timing properties in a compositional framework? 2 Modular
More informationFeedforward Neural Nets and Backpropagation
Feedforward Neural Nets and Backpropagation Julie Nutini University of British Columbia MLRG September 28 th, 2016 1 / 23 Supervised Learning Roadmap Supervised Learning: Assume that we are given the features
More informationIntroduction Neural Networks - Architecture Network Training Small Example - ZIP Codes Summary. Neural Networks - I. Henrik I Christensen
Neural Networks - I Henrik I Christensen Robotics & Intelligent Machines @ GT Georgia Institute of Technology, Atlanta, GA 30332-0280 hic@cc.gatech.edu Henrik I Christensen (RIM@GT) Neural Networks 1 /
More informationMachine Learning Lecture 5
Machine Learning Lecture 5 Linear Discriminant Functions 26.10.2017 Bastian Leibe RWTH Aachen http://www.vision.rwth-aachen.de leibe@vision.rwth-aachen.de Course Outline Fundamentals Bayes Decision Theory
More informationCheng Soon Ong & Christian Walder. Canberra February June 2018
Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2018 Outlines Overview Introduction Linear Algebra Probability Linear Regression
More informationBranch Prediction using Advanced Neural Methods
Branch Prediction using Advanced Neural Methods Sunghoon Kim Department of Mechanical Engineering University of California, Berkeley shkim@newton.berkeley.edu Abstract Among the hardware techniques, two-level
More informationResilient and energy-aware algorithms
Resilient and energy-aware algorithms Anne Benoit ENS Lyon Anne.Benoit@ens-lyon.fr http://graal.ens-lyon.fr/~abenoit CR02-2016/2017 Anne.Benoit@ens-lyon.fr CR02 Resilient and energy-aware algorithms 1/
More informationReading Group on Deep Learning Session 1
Reading Group on Deep Learning Session 1 Stephane Lathuiliere & Pablo Mesejo 2 June 2016 1/31 Contents Introduction to Artificial Neural Networks to understand, and to be able to efficiently use, the popular
More informationGenerative Models for Sentences
Generative Models for Sentences Amjad Almahairi PhD student August 16 th 2014 Outline 1. Motivation Language modelling Full Sentence Embeddings 2. Approach Bayesian Networks Variational Autoencoders (VAE)
More informationReinforcement Learning via Policy Optimization
Reinforcement Learning via Policy Optimization Hanxiao Liu November 22, 2017 1 / 27 Reinforcement Learning Policy a π(s) 2 / 27 Example - Mario 3 / 27 Example - ChatBot 4 / 27 Applications - Video Games
More informationStochastic Optimization for Undergraduate Computer Science Students
Stochastic Optimization for Undergraduate Computer Science Students Professor Joongheon Kim School of Computer Science and Engineering, Chung-Ang University, Seoul, Republic of Korea 1 Reference 2 Outline
More informationEECS 571 Principles of Real-Time Embedded Systems. Lecture Note #7: More on Uniprocessor Scheduling
EECS 571 Principles of Real-Time Embedded Systems Lecture Note #7: More on Uniprocessor Scheduling Kang G. Shin EECS Department University of Michigan Precedence and Exclusion Constraints Thus far, we
More informationProbabilistic Reasoning in Deep Learning
Probabilistic Reasoning in Deep Learning Dr Konstantina Palla, PhD palla@stats.ox.ac.uk September 2017 Deep Learning Indaba, Johannesburgh Konstantina Palla 1 / 39 OVERVIEW OF THE TALK Basics of Bayesian
More informationReal-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2
Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2 Lecture Outline Scheduling periodic tasks The rate monotonic algorithm Definition Non-optimality Time-demand analysis...!2
More informationReal-Time Scheduling and Resource Management
ARTIST2 Summer School 2008 in Europe Autrans (near Grenoble), France September 8-12, 2008 Real-Time Scheduling and Resource Management Lecturer: Giorgio Buttazzo Full Professor Scuola Superiore Sant Anna
More informationCOGS Q250 Fall Homework 7: Learning in Neural Networks Due: 9:00am, Friday 2nd November.
COGS Q250 Fall 2012 Homework 7: Learning in Neural Networks Due: 9:00am, Friday 2nd November. For the first two questions of the homework you will need to understand the learning algorithm using the delta
More informationLearning Tetris. 1 Tetris. February 3, 2009
Learning Tetris Matt Zucker Andrew Maas February 3, 2009 1 Tetris The Tetris game has been used as a benchmark for Machine Learning tasks because its large state space (over 2 200 cell configurations are
More informationNon-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions
Non-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions Mitra Nasri Chair of Real-time Systems, Technische Universität Kaiserslautern, Germany nasri@eit.uni-kl.de
More informationReal-Time and Embedded Systems (M) Lecture 5
Priority-driven Scheduling of Periodic Tasks (1) Real-Time and Embedded Systems (M) Lecture 5 Lecture Outline Assumptions Fixed-priority algorithms Rate monotonic Deadline monotonic Dynamic-priority algorithms
More informationADALINE for Pattern Classification
POLYTECHNIC UNIVERSITY Department of Computer and Information Science ADALINE for Pattern Classification K. Ming Leung Abstract: A supervised learning algorithm known as the Widrow-Hoff rule, or the Delta
More informationREINFORCE Framework for Stochastic Policy Optimization and its use in Deep Learning
REINFORCE Framework for Stochastic Policy Optimization and its use in Deep Learning Ronen Tamari The Hebrew University of Jerusalem Advanced Seminar in Deep Learning (#67679) February 28, 2016 Ronen Tamari
More informationarxiv: v2 [cs.ne] 22 Feb 2013
Sparse Penalty in Deep Belief Networks: Using the Mixed Norm Constraint arxiv:1301.3533v2 [cs.ne] 22 Feb 2013 Xanadu C. Halkias DYNI, LSIS, Universitè du Sud, Avenue de l Université - BP20132, 83957 LA
More informationStatistical Analysis and Distortion Modeling of MPEG-4 FGS
Statistical Analysis and Distortion Modeling of MPEG-4 FGS Min Dai Electrical Engineering Texas A&M University, TX 77843 Dmitri Loguinov Computer Science Texas A&M University, TX 77843 Hayder Radha Hayder
More informationPayments System Design Using Reinforcement Learning: A Progress Report
Payments System Design Using Reinforcement Learning: A Progress Report A. Desai 1 H. Du 1 R. Garratt 2 F. Rivadeneyra 1 1 Bank of Canada 2 University of California Santa Barbara 16th Payment and Settlement
More informationAS computer hardware technology advances, both
1 Best-Harmonically-Fit Periodic Task Assignment Algorithm on Multiple Periodic Resources Chunhui Guo, Student Member, IEEE, Xiayu Hua, Student Member, IEEE, Hao Wu, Student Member, IEEE, Douglas Lautner,
More informationSPSS, University of Texas at Arlington. Topics in Machine Learning-EE 5359 Neural Networks
Topics in Machine Learning-EE 5359 Neural Networks 1 The Perceptron Output: A perceptron is a function that maps D-dimensional vectors to real numbers. For notational convenience, we add a zero-th dimension
More informationLogistic Regression & Neural Networks
Logistic Regression & Neural Networks CMSC 723 / LING 723 / INST 725 Marine Carpuat Slides credit: Graham Neubig, Jacob Eisenstein Logistic Regression Perceptron & Probabilities What if we want a probability
More informationRecurrent Latent Variable Networks for Session-Based Recommendation
Recurrent Latent Variable Networks for Session-Based Recommendation Panayiotis Christodoulou Cyprus University of Technology paa.christodoulou@edu.cut.ac.cy 27/8/2017 Panayiotis Christodoulou (C.U.T.)
More informationarxiv: v1 [cs.os] 6 Jun 2013
Partitioned scheduling of multimode multiprocessor real-time systems with temporal isolation Joël Goossens Pascal Richard arxiv:1306.1316v1 [cs.os] 6 Jun 2013 Abstract We consider the partitioned scheduling
More informationProportional Share Resource Allocation Outline. Proportional Share Resource Allocation Concept
Proportional Share Resource Allocation Outline Fluid-flow resource allocation models» Packet scheduling in a network Proportional share resource allocation models» CPU scheduling in an operating system
More informationPartially Observable Markov Decision Processes (POMDPs)
Partially Observable Markov Decision Processes (POMDPs) Sachin Patil Guest Lecture: CS287 Advanced Robotics Slides adapted from Pieter Abbeel, Alex Lee Outline Introduction to POMDPs Locally Optimal Solutions
More informationArtificial Neural Networks (ANN) Xiaogang Su, Ph.D. Department of Mathematical Science University of Texas at El Paso
Artificial Neural Networks (ANN) Xiaogang Su, Ph.D. Department of Mathematical Science University of Texas at El Paso xsu@utep.edu Fall, 2018 Outline Introduction A Brief History ANN Architecture Terminology
More informationEnergy-efficient scheduling
Energy-efficient scheduling Guillaume Aupy 1, Anne Benoit 1,2, Paul Renaud-Goud 1 and Yves Robert 1,2,3 1. Ecole Normale Supérieure de Lyon, France 2. Institut Universitaire de France 3. University of
More informationword2vec Parameter Learning Explained
word2vec Parameter Learning Explained Xin Rong ronxin@umich.edu Abstract The word2vec model and application by Mikolov et al. have attracted a great amount of attention in recent two years. The vector
More informationDeep Reinforcement Learning SISL. Jeremy Morton (jmorton2) November 7, Stanford Intelligent Systems Laboratory
Deep Reinforcement Learning Jeremy Morton (jmorton2) November 7, 2016 SISL Stanford Intelligent Systems Laboratory Overview 2 1 Motivation 2 Neural Networks 3 Deep Reinforcement Learning 4 Deep Learning
More informationLarge-Scale Feature Learning with Spike-and-Slab Sparse Coding
Large-Scale Feature Learning with Spike-and-Slab Sparse Coding Ian J. Goodfellow, Aaron Courville, Yoshua Bengio ICML 2012 Presented by Xin Yuan January 17, 2013 1 Outline Contributions Spike-and-Slab
More informationAdaptive Scheduling and Voltage Scaling for Multiprocessor Real-time Applications with Non-deterministic Workload
Scheduling and Voltage Scaling for Multiprocessor Real-time Applications with Non-deterministic Workload Parth Malani, Prakash Mukre, Qinru Qiu and Qing Wu Department of Electrical and Computer Engineering,
More informationNeural Networks. Bishop PRML Ch. 5. Alireza Ghane. Feed-forward Networks Network Training Error Backpropagation Applications
Neural Networks Bishop PRML Ch. 5 Alireza Ghane Neural Networks Alireza Ghane / Greg Mori 1 Neural Networks Neural networks arise from attempts to model human/animal brains Many models, many claims of
More informationLecture 4: Perceptrons and Multilayer Perceptrons
Lecture 4: Perceptrons and Multilayer Perceptrons Cognitive Systems II - Machine Learning SS 2005 Part I: Basic Approaches of Concept Learning Perceptrons, Artificial Neuronal Networks Lecture 4: Perceptrons
More informationNeural networks. Chapter 20. Chapter 20 1
Neural networks Chapter 20 Chapter 20 1 Outline Brains Neural networks Perceptrons Multilayer networks Applications of neural networks Chapter 20 2 Brains 10 11 neurons of > 20 types, 10 14 synapses, 1ms
More informationEmbedded Systems Development
Embedded Systems Development Lecture 3 Real-Time Scheduling Dr. Daniel Kästner AbsInt Angewandte Informatik GmbH kaestner@absint.com Model-based Software Development Generator Lustre programs Esterel programs
More informationFeedforward Neural Networks. Michael Collins, Columbia University
Feedforward Neural Networks Michael Collins, Columbia University Recap: Log-linear Models A log-linear model takes the following form: p(y x; v) = exp (v f(x, y)) y Y exp (v f(x, y )) f(x, y) is the representation
More informationHow to deal with uncertainties and dynamicity?
How to deal with uncertainties and dynamicity? http://graal.ens-lyon.fr/ lmarchal/scheduling/ 19 novembre 2012 1/ 37 Outline 1 Sensitivity and Robustness 2 Analyzing the sensitivity : the case of Backfilling
More informationMachine Learning. Neural Networks. (slides from Domingos, Pardo, others)
Machine Learning Neural Networks (slides from Domingos, Pardo, others) For this week, Reading Chapter 4: Neural Networks (Mitchell, 1997) See Canvas For subsequent weeks: Scaling Learning Algorithms toward
More informationLecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013
Lecture 3 Real-Time Scheduling Daniel Kästner AbsInt GmbH 203 Model-based Software Development 2 SCADE Suite Application Model in SCADE (data flow + SSM) System Model (tasks, interrupts, buses, ) SymTA/S
More informationReal-time Scheduling of Periodic Tasks (2) Advanced Operating Systems Lecture 3
Real-time Scheduling of Periodic Tasks (2) Advanced Operating Systems Lecture 3 Lecture Outline The rate monotonic algorithm (cont d) Maximum utilisation test The deadline monotonic algorithm The earliest
More informationLeveraging Transactional Memory for a Predictable Execution of Applications Composed of Hard Real-Time and Best-Effort Tasks
Leveraging Transactional Memory for a Predictable Execution of Applications Composed of Hard Real-Time and Best-Effort Tasks Stefan Metzlaff, Sebastian Weis, and Theo Ungerer Department of Computer Science,
More informationSome ideas and open problems in real-time stochastic scheduling. Liliana CUCU, TRIO team, Nancy, France
Some ideas and open problems in real-time stochastic scheduling Liliana CUCU, TRIO team, Nancy, France Real-time systems Reactive systems Correct reaction Temporal constraints Gotha-- Liliana CUCU - 04/04/2008
More informationFailure Tolerance of Multicore Real-Time Systems scheduled by a Pfair Algorithm
Failure Tolerance of Multicore Real-Time Systems scheduled by a Pfair Algorithm Yves MOUAFO Supervisors A. CHOQUET-GENIET, G. LARGETEAU-SKAPIN OUTLINES 2 1. Context and Problematic 2. State of the art
More informationA Measurement-Analytic Approach for QoS Estimation in a Network Based on the Dominant Time Scale
222 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 2, APRIL 2003 A Measurement-Analytic Approach for QoS Estimation in a Network Based on the Dominant Time Scale Do Young Eun and Ness B. Shroff, Senior
More informationNeural Networks. Single-layer neural network. CSE 446: Machine Learning Emily Fox University of Washington March 10, /9/17
3/9/7 Neural Networks Emily Fox University of Washington March 0, 207 Slides adapted from Ali Farhadi (via Carlos Guestrin and Luke Zettlemoyer) Single-layer neural network 3/9/7 Perceptron as a neural
More informationMachine Learning for Large-Scale Data Analysis and Decision Making A. Neural Networks Week #6
Machine Learning for Large-Scale Data Analysis and Decision Making 80-629-17A Neural Networks Week #6 Today Neural Networks A. Modeling B. Fitting C. Deep neural networks Today s material is (adapted)
More informationA graph contains a set of nodes (vertices) connected by links (edges or arcs)
BOLTZMANN MACHINES Generative Models Graphical Models A graph contains a set of nodes (vertices) connected by links (edges or arcs) In a probabilistic graphical model, each node represents a random variable,
More informationEmpirical Risk Minimization
Empirical Risk Minimization Fabrice Rossi SAMM Université Paris 1 Panthéon Sorbonne 2018 Outline Introduction PAC learning ERM in practice 2 General setting Data X the input space and Y the output space
More informationCSE446: Neural Networks Spring Many slides are adapted from Carlos Guestrin and Luke Zettlemoyer
CSE446: Neural Networks Spring 2017 Many slides are adapted from Carlos Guestrin and Luke Zettlemoyer Human Neurons Switching time ~ 0.001 second Number of neurons 10 10 Connections per neuron 10 4-5 Scene
More informationLong-Short Term Memory and Other Gated RNNs
Long-Short Term Memory and Other Gated RNNs Sargur Srihari srihari@buffalo.edu This is part of lecture slides on Deep Learning: http://www.cedar.buffalo.edu/~srihari/cse676 1 Topics in Sequence Modeling
More informationtext classification 3: neural networks
text classification 3: neural networks CS 585, Fall 2018 Introduction to Natural Language Processing http://people.cs.umass.edu/~miyyer/cs585/ Mohit Iyyer College of Information and Computer Sciences University
More informationCSC242: Intro to AI. Lecture 21
CSC242: Intro to AI Lecture 21 Administrivia Project 4 (homeworks 18 & 19) due Mon Apr 16 11:59PM Posters Apr 24 and 26 You need an idea! You need to present it nicely on 2-wide by 4-high landscape pages
More informationTowards a Bayesian model for Cyber Security
Towards a Bayesian model for Cyber Security Mark Briers (mbriers@turing.ac.uk) Joint work with Henry Clausen and Prof. Niall Adams (Imperial College London) 27 September 2017 The Alan Turing Institute
More information