A compositional approach to embedded system performance analysis

Size: px
Start display at page:

Download "A compositional approach to embedded system performance analysis"

Transcription

1 A compositional approach to embedded system performance analysis R. Ernst TU Braunschweig R. Ernst, TU Braunschweig 1 Overview heterogeneous embedded architectures formal performance analysis holistic and flow based a compositional approach to performance analysis example context aware analysis conclusion R. Ernst, TU Braunschweig 5 1

2 Embedded systems - trends Trend 1: higher system integration integration of complete programmable subsystems on a single IC Multiprocessor-Systems-on-Chip (MpSoC) R. Ernst, TU Braunschweig 6 Nexperia example: Viper Setop Box External SDRAM D$ I$ MIPS (PR3940) CPU Memory controller TriMedia (TM32) CPU D$ I$ Interrupt controller Enhanced JTAG Fast PI bus Fast C-Bridge Mem. Mgmt. IF bus TriMedia C-Bridge TriMedia PI bus Clocks IC debug CPU debug Universal serial bus Universal async. receiver/transmitter (UART) ISO UART Reset MIPS bridge MIPS PI bus MIPS C-Bridge High-performance 2D-rendering engine Exp. bus interface unit PCI/XIO I²C IEEE 1394 link layer controller CRC DMA C-bridge MPEG-2 video decoder Adv. image composition Processor Video input processor Memory-based scaler MPEG system proc. Interrupt ctrl. Audio I/O Sony Philips Digital I/O Transport stream DMA General-purpose I/O Synchronous serial interface R. Ernst, TU Braunschweig 7 2

3 Embedded systems - trends - 2 Trend 2: networked systems ubiquitous computing, telecom, automotive, avionics, space,... subsystem subsystem integration integration service service integration integration Image source: Siemens R. Ernst, TU Braunschweig 8 Embedded architectures - trends system function integration reactive and transformative parts function IP, legacy code, new functions component and subsystem reuse (IP) increased design productivity and reduced development cost programmable platforms improved design productivity increased volume examples: network processors, multi-media platforms, automotive platforms, game platforms R. Ernst, TU Braunschweig 9 3

4 Embedded architecture - challenges design specialization increased performance reduced power consumption lower cost and size design flexibility late changes, platforms, reuse HW and SW IP integration result of reuse embedded HW architectures are heterogeneous R. Ernst, TU Braunschweig 10 ES architectures are heterogeneous different processing element types processors, weakly programmable coprocessors, IP components different interconnection networks and communication protocols different memory types different scheduling and synchronization strategies M P M DSP M M P CoP R. Ernst, TU Braunschweig 11 4

5 Heterogeneous architecture: Viper Setop Box External SDRAM D$ I$ MIPS (PR3940) CPU Memory controller TriMedia (TM32) CPU D$ I$ Interrupt controller Enhanced JTAG Fast PI bus Fast C-Bridge Mem. Mgmt. IF bus TriMedia C-Bridge TriMedia PI bus Clocks IC debug CPU debug Universal serial bus Universal async. receiver/transmitter (UART) ISO UART Reset MIPS bridge MIPS PI bus MIPS C-Bridge High-performance 2D-rendering engine Exp. bus interface unit PCI/XIO I²C IEEE 1394 link layer controller CRC DMA C-bridge MPEG-2 video decoder Adv. image composition Processor Video input processor Memory-based scaler MPEG system proc. Interrupt ctrl. Audio I/O Sony Philips Digital I/O Transport stream DMA General-purpose I/O Synchronous serial interface R. Ernst, TU Braunschweig 12 Managing HW architecture complexity development of application programmer interfaces (API) to hide complexity from application programmer and improve portability specialized RTOS to control resource sharing and interfaces complex multi-level HW/SW architecture R. Ernst, TU Braunschweig 13 5

6 Software architecture example software shared mem private private private private pe 1 application RTOS-APIs RTOS drivers application architecture API hardware periphery cache core I/O Int timer timer Bus- CTRL ce 1 layered software architecture with HW dependent SW and API embedded SW is heterogeneous Bus R. Ernst, TU Braunschweig 14 Communication Centric Design communication network as a backbone for systems integration state of the art: off chip: busses w. different protocols and performance levels on chip: Proprietary or standard buses with bridges AMBA, Sonics,... future: multi-stage networks on-chip as well as off-chip (PCI Express) IP CoPro MEM Application B RISC MEM DSP IP communication network VLIW MEM Application A R. Ernst, TU Braunschweig 15 6

7 Subsystem integration - example P 2 P 1 P 3 subsystem 2 Sens CPU M 1 DSP M 2 HW Integration IP 1 M 3 IP 2 subsystem 1 Sens CPU M 1 HW subsystem 1 Com Netw subsystem 2 IP 1 M 3 IP 2 DSP M 2 R. Ernst, TU Braunschweig 16 Communication centric design - key challenges subsystem integration&verification design space exploration and optimization R. Ernst, TU Braunschweig 17 7

8 Integration tasks resource sharing several SW processes mapped to one processing element task scheduling mapping several communications mapped to one communication path communication (bus) scheduling several process data mapped to one memory memory assignment (space & time) interface synthesis synthesizing process communication to target system communication integration verification R. Ernst, TU Braunschweig 18 Integration verification correct implementation of specified function HW/SW co-simulation, verification correct target architecture parameters processor and communication performance adherence to timing requirements no memory over/underflow no run-time dependent dead-locks general design problem challenge to heterogeneous system design R. Ernst, TU Braunschweig 19 8

9 Complex performance objectives and constraints C P sens. C P detc C P ctrl C P act. C application application MEM RTOS-APIs RTOS drivers RTOS-APIs RTOS drivers MEM Crash Sensor cache I/O core int timer timer bus- CTRL system bus timer timer bus- CTRL core int I/O cache Actuator Release Airbag Reaction time of airbag after crash? t crash + t sens + t csens + t detc + t fbus + t ctrl + t cact + t act + t airbag = = = = = physical delay t com t API t API + t drv + t process t physical delay drv t API t drv + t com + t process + t com + t API + t drv + t API R. Ernst, TU Braunschweig 20 Complex run-time interdependencies Sens CPU M 1 HW Com Netw IP 1 M 3 IP 2 DSP M 2 run-time dependencies of independent components via communication influence on timing and power R. Ernst, TU Braunschweig 21 9

10 Interdependency example complex non-functional interdependencies complex system corner cases min execution time high bus load max execution time low bus load P 1 t bc1 t wc1 M 1 CPU 1 communication network R. Ernst, TU Braunschweig 22 Heterogeneous resource sharing - example FCFS scheduling static priority scheduling CoPro RISC MEM DSP TDMA scheduling IP com. netw. MEM IP VLIW MEM static execution order scheduling proprietary (abstract info) earliest deadline first scheduling R. Ernst, TU Braunschweig 23 10

11 Performance verification - state of the art current approach: target architecture co-simulation combines functional and performance validation reuse component validation pattern for system integration and function test reuse application benchmarks for target architecture function validation visualization of system execution extensive simulation run times to include many test cases R. Ernst, TU Braunschweig 24 Co-simulation limitations identification of system performance corner cases different from component performance corner cases target architecture behavior unknown to the application function developer (cp. functional HW test) test case definition and selection? analysis of target architecture confusing variety of run-time interdependencies data dependent transient run-time effects mixed in co-simulation limited support of design space exploration debugging challenge inclusion of incomplete application specifications additional performance models required R. Ernst, TU Braunschweig 25 11

12 Alternatives? conservative design install independency in resource sharing example: fixed execution time slots TDMA formal performance analysis R. Ernst, TU Braunschweig 26 Formal performance analysis formal techniques known for individual components and subsystems (RMS, static scheduling etc.) heterogeneity is problem R. Ernst, TU Braunschweig 29 12

13 Performance model structure IP M model type system model influenced by communication pattern shared memory access environment model M P M P activation P 1 P 2 M component & communication execution model resource sharing strategy process activation component state (caches) P 1 process execution model execution path data dependent path execution arch. dependent communication data & arch. dep. R. Ernst, TU Braunschweig 30 System performance analysis approaches global approach analysis scope extension to several subsystems flow based hierachical approach global flow analysis combined with local scheduling analysis R. Ernst, TU Braunschweig 31 13

14 Analysis scope extension coherent analysis ( holistic approach) example: Tindell 94, Pop/Eles (DATE 2000, DAC 2002, ): TDMA + static priority automotive applications static priority process scheduling static priority queueing T: Transmitter process queue P 2 P 1 T TTP bus interface RTOS P 3 P 4 D RTOS TTP bus interface TTP bus (TDMA) problem: scalability R. Ernst, TU Braunschweig 32 Hierarchical approach independently scheduled subsystems are coupled by data flow SB 1 P 1 SB 2 P 3 P 2 P 4 scheduling SB 1 scheduling SB 2 subsystems coupled by stream of data interpreted as activating events coupling corresponds to event propagation R. Ernst, TU Braunschweig 33 14

15 Event propagation and analysis principle environment model local analysis derive output event model map to input event model until convergence or non-schedulability R. Ernst, TU Braunschweig 34 Flow based hierarchical approaches event model generalization for a set of scheduling strategies arrival and service curves Chakraborty/Thiele/Gries/Künzli new analysis approaches needed, e.g. Baruah used for network processor design event stream model adaptation use abstract interface stream properties to couple local analysis used e.g. for automotive software R. Ernst, TU Braunschweig 35 15

16 Generalized event model incoming events stream is integrated over time intervals and captured in arrival curves event consumption is captured in service curves 2 curves each for upper and lower bounds (interval) upper and lower bounds linearly approximated for analyis R. Ernst, TU Braunschweig 36 Load analysis with interval event model Load analyis: Addition propagation of computation and load intervals - min/max algebra e.g. buffer size: difference between input load and processed events HW and SW resources resource bounds input stream bounds source: L. Thiele, ETH Zurich remaining resources processed packet streams R. Ernst, TU Braunschweig 37 L. Thiele, ETH Zurich 16

17 Compositional Approach (Ernst et al.) observation: real-time analysis assumes similar event models at input t e1 t e2 t e3 periodic event stream t p t p periodic event streams with jitter periodic event streams with burst t e1 t e2 t e3 t p t p t e1 t e2 t e3 t en t en+1 t min sporadic events with minimum event separation t int t e1 t e2 sporadic events with bursts comparable event models appear at output volume of generated events is fixed or interval (data dependent) R. Ernst, TU Braunschweig 38 static execution order RTA event model examples periodic periodic w. jitter Jitter: fixed part (scheduling) + variable part (data dependency) sporadic sporadic w. jitter static priority periodic periodic w. jitter and burst sporadic sporadic w. jitter and burst time driven scheduling: TDMA, round robin adds jitter to any model R. Ernst, TU Braunschweig 39 17

18 Example: Static priority with arbitrary deadlines complex execution sequence - may create output bursts found in communication scheduling and multiprocessing P 1 T 1 P 2 T 2 T 2 T 2 T 2 P 3 priority busy period analysis solution e.g. by Lehoczky R. Ernst, TU Braunschweig 40 Few stream models can be derived n act (t) no. of activating events in time t burst can be simplified and modeled as jitter greater period with min. event distance R. Ernst, TU Braunschweig 41 18

19 Event stream model adaptation composition requires model adaptation adaptation for compatible input and output event models simple mathematical transformation to adapt analysis Event Model InterFace (EMIF) no added function, no run-time effect adaptation for non-compatible input and output event models insert Event Adaptation Function (EAF) to transform models EAF describes interface buffer function shows that buffer is required to couple subsystems R. Ernst, TU Braunschweig 42 Event Model Interface Classification periodic burst T T T=T, length t=t, (b) b=1 = 1 jitter T=T, = J=0 0 periodic with burst b T b t t t = t t = T sporadic x t x t x t periodic with jitter T T J J J t = T - J lossless EMIF EMIF to less expressive model R. Ernst, TU Braunschweig 43 19

20 Using EMIFs and EAFs EAF buffer required Periodic Periodic with Burst Periodic with Jitter Sporadic upper bound only R. Ernst, TU Braunschweig 44 subsystem 1 Example revisited non-functional dependency cycle com. netw. Distortion subsystem 2 R. Ernst, TU Braunschweig 45 20

21 Sens CPU M 1 sporadic sporadic burst EMIF EMIF EMIF HW EMIF sporadic com. netw. C 1 C 3 C 2 burst-based network analysis EMIF EMIF w/ EAF periodic periodic IP 1 M 3 IP 2 DSP R. Ernst, TU Braunschweig 46 M 2 Dependency cycle activation by RTOS simple periodic Sens sporadic w/ jitter preemption P1 P3 CPU periodic w/ burst EMIF w/ EAF resynchronization reduces HWjitter EMIF simple periodic C1 interference C2 NoC com. network R. Ernst, TU Braunschweig 47 21

22 t (P 1 )= 250 µs t (P 3 )= 10 µs simple sporadic f max =1,7kHz, s=8kb Sens 8kB 32 ( ) byte CPU s=3kb simple periodic f=20khz M 1 periodic w/ burst HW sporadic w/ jitter EMIF EMIF w/ EAF 3kB 24 ( ) byte simple sporadic periodic w/ burst com. network NoC C 1 C 3 C 2 1kB 1 ( ) byte periodic w/ jitter periodic f=140khz, s=1kb EMIF w/ EAF periodic IP 1 M 3 IP 2 DSP R. Ernst, TU Braunschweig 48 M 2 Results 39 R. Ernst, TU Braunschweig 49 22

23 Application model compatibility stream model represents exact data volume keeps causality for application model activation required for AND activation, e.g. data flow graphs otherwise infinite buffers or starvation 1 P P 1 P 2 P 1 P CPU1 CPU2 CPU1 CPU2 not needed for process systems with OR activation or time driven activation R. Ernst, TU Braunschweig 50 System contexts another stream property partial event order is kept application: tagged token (SPI model) to take system contexts into account example set top box R. Ernst, TU Braunschweig 51 23

24 Context exploitation: Set top box RF system bus decryption unit hard-disk R. Ernst, TU Braunschweig 52 Context exploitation: Set top box mux MPEG-2 IP-traffic RF decryption unit hard-disk scenario 1: record video + watch movie + download file via IP R. Ernst, TU Braunschweig 53 24

25 MPEG stream modeling stream properties I, B, P frame types of different data volume encoding with the following constraint on frame types Min 2 I out of 12 Min 2 P out of 12 Min 6 B out of 12 Max 4 I out of 12 Max 4 P out of 12 Max 8 B out of 12 stream coding set of constraints on the sequence of tagged tokens R. Ernst, TU Braunschweig 54 intra event stream context Event stream contexts data volume and execution time depend on frame types and frame sequence inter event stream context bus load and response times depend on relative phase of streams inter + intra event stream contexts merged streams on bus have variable order solutions available for cyclo static streams (Chen/Mok) and inter event stream contexts only (Tindell), extended to constrained sequences and combinations R. Ernst, TU Braunschweig 55 25

26 Response time impact mux IP video streams are multiplexed and have higher priority than IP 118 I I I I I I I w/o context t respip = 920 I t I I I I P w context t respip =690 P t response times for static priority bus arbitration R. Ernst, TU Braunschweig 56 Analysis improvement due to intra event stream contexts t t resp,max resp,max w context w/o context R. Ernst, TU Braunschweig 57 26

27 Set top box scenario 2 Encrypted MPEG-2 Decrypted MPEG-2 IP-traffic RF decryption unit hard-disk scenario 2: decript video + download file via IP R. Ernst, TU Braunschweig 58 Response time impact enc dec IP 100 I enc I dec I enc I dec 170 t transaction period = 100 I enc 50 I dec 140 enc and dec streams are coupled by decryption unit execution time R. Ernst, TU Braunschweig 59 I enc I dec t 27

28 Analysis improvement due to inter event stream contexts t t resp,max resp,max w context w/o context R. Ernst, TU Braunschweig 60 Analysis improvement due to both intra and inter event stream contexts t t resp,max resp,max w context w/o context R. Ernst, TU Braunschweig 61 28

29 Acknowledgement The following persons made major contributions to this work Jörn Braam J. Bhavani Rafik Henia Marek Jersak Razvan Racu Kai Richter R. Ernst, TU Braunschweig 62 Conclusion systems integration is key ES design problem performance verification is key integration problem many hidden performance problems not reflected in system function performance verification currently primarily based on simulation risky and time consuming presented compositional analysis based on abstract event flow models event flow models enable analysis of complex situations with feedback and contexts work applied in several ongoing industry cooperations (SpeAC, FlexFilm, automotive SW, ) R. Ernst, TU Braunschweig 63 29

30 see: Literature R. Ernst, TU Braunschweig 64 30

Temperature-Aware Analysis and Scheduling

Temperature-Aware Analysis and Scheduling Temperature-Aware Analysis and Scheduling Lothar Thiele, Pratyush Kumar Overview! Introduction! Power and Temperature Models! Analysis Real-time Analysis Worst-case Temperature Analysis! Scheduling Stop-and-go

More information

Embedded Systems 23 BF - ES

Embedded Systems 23 BF - ES Embedded Systems 23-1 - Measurement vs. Analysis REVIEW Probability Best Case Execution Time Unsafe: Execution Time Measurement Worst Case Execution Time Upper bound Execution Time typically huge variations

More information

Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus

Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus Devesh B. Chokshi and Purandar Bhaduri Department of Computer Science and Engineering Indian Institute of Technology Guwahati,

More information

Real-Time Calculus. LS 12, TU Dortmund

Real-Time Calculus. LS 12, TU Dortmund Real-Time Calculus Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 09, Dec., 2014 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 35 Arbitrary Deadlines The worst-case response time of τ i by only considering

More information

CSE 380 Computer Operating Systems

CSE 380 Computer Operating Systems CSE 380 Computer Operating Systems Instructor: Insup Lee & Dianna Xu University of Pennsylvania, Fall 2003 Lecture Note 3: CPU Scheduling 1 CPU SCHEDULING q How can OS schedule the allocation of CPU cycles

More information

Tecniche di ottimizzazione per lo sviluppo di applicazioni embedded su piattatforme multiprocessore su singolo chip

Tecniche di ottimizzazione per lo sviluppo di applicazioni embedded su piattatforme multiprocessore su singolo chip Tecniche di ottimizzazione per lo sviluppo di applicazioni embedded su piattatforme multiprocessore su singolo chip Luca Benini Lbenini@deis.unibo.it DEIS Università di Bologna Embedded Systems General

More information

NCU EE -- DSP VLSI Design. Tsung-Han Tsai 1

NCU EE -- DSP VLSI Design. Tsung-Han Tsai 1 NCU EE -- DSP VLSI Design. Tsung-Han Tsai 1 Multi-processor vs. Multi-computer architecture µp vs. DSP RISC vs. DSP RISC Reduced-instruction-set Register-to-register operation Higher throughput by using

More information

Embedded Systems Design: Optimization Challenges. Paul Pop Embedded Systems Lab (ESLAB) Linköping University, Sweden

Embedded 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 information

Real-Time Scheduling and Resource Management

Real-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 information

Andrew Morton University of Waterloo Canada

Andrew 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 information

Che-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University

Che-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University Che-Wei Chang chewei@mail.cgu.edu.tw Department of Computer Science and Information Engineering, Chang Gung University } 2017/11/15 Midterm } 2017/11/22 Final Project Announcement 2 1. Introduction 2.

More information

New Exploration Frameworks for Temperature-Aware Design of MPSoCs. Prof. David Atienza

New Exploration Frameworks for Temperature-Aware Design of MPSoCs. Prof. David Atienza New Exploration Frameworks for Temperature-Aware Degn of MPSoCs Prof. David Atienza Dept Computer Architecture and Systems Engineering (DACYA) Complutense Univerty of Madrid, Spain Integrated Systems Lab

More information

Real-time operating systems course. 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm

Real-time operating systems course. 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm Real-time operating systems course 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm Definitions Scheduling Scheduling is the activity of selecting which process/thread should

More information

Administrivia. Course Objectives. Overview. Lecture Notes Week markem/cs333/ 2. Staff. 3. Prerequisites. 4. Grading. 1. Theory and application

Administrivia. Course Objectives. Overview. Lecture Notes Week markem/cs333/ 2. Staff. 3. Prerequisites. 4. Grading. 1. Theory and application Administrivia 1. markem/cs333/ 2. Staff 3. Prerequisites 4. Grading Course Objectives 1. Theory and application 2. Benefits 3. Labs TAs Overview 1. What is a computer system? CPU PC ALU System bus Memory

More information

Aperiodic Task Scheduling

Aperiodic Task Scheduling Aperiodic Task Scheduling Jian-Jia Chen (slides are based on Peter Marwedel) TU Dortmund, Informatik 12 Germany Springer, 2010 2017 年 11 月 29 日 These slides use Microsoft clip arts. Microsoft copyright

More information

Component-based Analysis of Worst-case Temperatures

Component-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 information

Continuous heat flow analysis. Time-variant heat sources. Embedded Systems Laboratory (ESL) Institute of EE, Faculty of Engineering

Continuous heat flow analysis. Time-variant heat sources. Embedded Systems Laboratory (ESL) Institute of EE, Faculty of Engineering Thermal Modeling, Analysis and Management of 2D Multi-Processor System-on-Chip Prof David Atienza Alonso Embedded Systems Laboratory (ESL) Institute of EE, Falty of Engineering Outline MPSoC thermal modeling

More information

CMP 338: Third Class

CMP 338: Third Class CMP 338: Third Class HW 2 solution Conversion between bases The TINY processor Abstraction and separation of concerns Circuit design big picture Moore s law and chip fabrication cost Performance What does

More information

Leveraging 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 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 information

EDF Feasibility and Hardware Accelerators

EDF 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 information

The conceptual view. by Gerrit Muller University of Southeast Norway-NISE

The conceptual view. by Gerrit Muller University of Southeast Norway-NISE by Gerrit Muller University of Southeast Norway-NISE e-mail: gaudisite@gmail.com www.gaudisite.nl Abstract The purpose of the conceptual view is described. A number of methods or models is given to use

More information

EECS 579: SOC Testing

EECS 579: SOC Testing EECS 579: SOC Testing Core-Based Systems-On-A-Chip (SOCs) Cores or IP circuits are predesigned and verified functional units of three main types Soft core: synthesizable RTL Firm core: gate-level netlist

More information

Design of Real-Time Software

Design 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 information

Virtual Circuits in Network-on-Chip

Virtual Circuits in Network-on-Chip Virtual Circuits in Network-on-Chip Master of Science thesis nr.: 87 Technical University of Denmark Informatics and Mathematical Modelling Computer Science and Engineering Lyngby, 18th of September 2006

More information

CIS 4930/6930: Principles of Cyber-Physical Systems

CIS 4930/6930: Principles of Cyber-Physical Systems CIS 4930/6930: Principles of Cyber-Physical Systems Chapter 11 Scheduling Hao Zheng Department of Computer Science and Engineering University of South Florida H. Zheng (CSE USF) CIS 4930/6930: Principles

More information

System Model. Real-Time systems. Giuseppe Lipari. Scuola Superiore Sant Anna Pisa -Italy

System 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 information

CprE 281: Digital Logic

CprE 281: Digital Logic CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Simple Processor CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Digital

More information

CPU SCHEDULING RONG ZHENG

CPU SCHEDULING RONG ZHENG CPU SCHEDULING RONG ZHENG OVERVIEW Why scheduling? Non-preemptive vs Preemptive policies FCFS, SJF, Round robin, multilevel queues with feedback, guaranteed scheduling 2 SHORT-TERM, MID-TERM, LONG- TERM

More information

Modeling the Effects of AUTOSAR Overhead on Automotive Application Software Timing and Schedulability

Modeling the Effects of AUTOSAR Overhead on Automotive Application Software Timing and Schedulability Modeling the Effects of AUTOSAR Overhead on Automotive Application Software Timing and Schedulability by Manish Chauhan A thesis presented to the University of Waterloo in fulfillment of the thesis requirement

More information

Real-Time Scheduling. Real Time Operating Systems and Middleware. Luca Abeni

Real-Time Scheduling. Real Time Operating Systems and Middleware. Luca Abeni Real Time Operating Systems and Middleware Luca Abeni luca.abeni@unitn.it Definitions Algorithm logical procedure used to solve a problem Program formal description of an algorithm, using a programming

More information

Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks

Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks Moonju Park Ubiquitous Computing Lab., IBM Korea, Seoul, Korea mjupark@kr.ibm.com Abstract. This paper addresses the problem of

More information

Predictability of Least Laxity First Scheduling Algorithm on Multiprocessor Real-Time Systems

Predictability of Least Laxity First Scheduling Algorithm on Multiprocessor Real-Time Systems Predictability of Least Laxity First Scheduling Algorithm on Multiprocessor Real-Time Systems Sangchul Han and Minkyu Park School of Computer Science and Engineering, Seoul National University, Seoul,

More information

CSE370: Introduction to Digital Design

CSE370: Introduction to Digital Design CSE370: Introduction to Digital Design Course staff Gaetano Borriello, Brian DeRenzi, Firat Kiyak Course web www.cs.washington.edu/370/ Make sure to subscribe to class mailing list (cse370@cs) Course text

More information

CHAPTER 5 - PROCESS SCHEDULING

CHAPTER 5 - PROCESS SCHEDULING CHAPTER 5 - PROCESS SCHEDULING OBJECTIVES To introduce CPU scheduling, which is the basis for multiprogrammed operating systems To describe various CPU-scheduling algorithms To discuss evaluation criteria

More information

Mark Redekopp, All rights reserved. Lecture 1 Slides. Intro Number Systems Logic Functions

Mark Redekopp, All rights reserved. Lecture 1 Slides. Intro Number Systems Logic Functions Lecture Slides Intro Number Systems Logic Functions EE 0 in Context EE 0 EE 20L Logic Design Fundamentals Logic Design, CAD Tools, Lab tools, Project EE 357 EE 457 Computer Architecture Using the logic

More information

Scheduling. Uwe R. Zimmer & Alistair Rendell The Australian National University

Scheduling. Uwe R. Zimmer & Alistair Rendell The Australian National University 6 Scheduling Uwe R. Zimmer & Alistair Rendell The Australian National University References for this chapter [Bacon98] J. Bacon Concurrent Systems 1998 (2nd Edition) Addison Wesley Longman Ltd, ISBN 0-201-17767-6

More information

The Digital Logic Level

The Digital Logic Level The Digital Logic Level Wolfgang Schreiner Research Institute for Symbolic Computation (RISC-Linz) Johannes Kepler University Wolfgang.Schreiner@risc.uni-linz.ac.at http://www.risc.uni-linz.ac.at/people/schreine

More information

TDDI04, K. Arvidsson, IDA, Linköpings universitet CPU Scheduling. Overview: CPU Scheduling. [SGG7] Chapter 5. Basic Concepts.

TDDI04, K. Arvidsson, IDA, Linköpings universitet CPU Scheduling. Overview: CPU Scheduling. [SGG7] Chapter 5. Basic Concepts. TDDI4 Concurrent Programming, Operating Systems, and Real-time Operating Systems CPU Scheduling Overview: CPU Scheduling CPU bursts and I/O bursts Scheduling Criteria Scheduling Algorithms Multiprocessor

More information

Fast and Accurate Transaction-Level Model of a Wormhole Network-on-Chip with Priority Preemptive Virtual Channel Arbitration

Fast and Accurate Transaction-Level Model of a Wormhole Network-on-Chip with Priority Preemptive Virtual Channel Arbitration Fast and Accurate Transaction-Level Model of a Wormhole Network-on-Chip with Priority Preemptive Virtual Channel Arbitration Leandro Soares Indrusiak, Osmar Marchi dos Santos eal Time Systems Group (TS)

More information

Real-Time Systems. LS 12, TU Dortmund

Real-Time Systems. LS 12, TU Dortmund Real-Time Systems Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund April 24, 2014 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 57 Organization Instructor: Jian-Jia Chen, jian-jia.chen@cs.uni-dortmund.de

More information

2/5/07 CSE 30341: Operating Systems Principles

2/5/07 CSE 30341: Operating Systems Principles page 1 Shortest-Job-First (SJR) Scheduling Associate with each process the length of its next CPU burst. Use these lengths to schedule the process with the shortest time Two schemes: nonpreemptive once

More information

THE DIGITAL LOGIC LEVEL

THE DIGITAL LOGIC LEVEL 3 THE DIGITL LOGIC LEVEL 1 +V CC +V CC +V CC V out Collector V 1 V out V out V in V 2 V 1 V 2 ase Emitter (a) (b) (c) Figure 3-1. (a) transistor inverter. (b) NND gate. (c) NOR gate. NOT X NND X NOR X

More information

Lan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN

Lan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN Lan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN Ethernet Frame Format 7 b y te s 1 b y te 2 o r 6 b y te s 2 o r 6 b y te s 2 b y te s 4-1 5 0 0 b y te s 4 b y te s P r e a m b le S ta r t F r

More information

LSN 15 Processor Scheduling

LSN 15 Processor Scheduling LSN 15 Processor Scheduling ECT362 Operating Systems Department of Engineering Technology LSN 15 Processor Scheduling LSN 15 FCFS/FIFO Scheduling Each process joins the Ready queue When the current process

More information

Module 5: CPU Scheduling

Module 5: CPU Scheduling Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 5.1 Basic Concepts Maximum CPU utilization obtained

More information

Time and Schedulability Analysis of Stateflow Models

Time 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 information

These are special traffic patterns that create more stress on a switch

These are special traffic patterns that create more stress on a switch Myths about Microbursts What are Microbursts? Microbursts are traffic patterns where traffic arrives in small bursts. While almost all network traffic is bursty to some extent, storage traffic usually

More information

Non-Preemptive and Limited Preemptive Scheduling. LS 12, TU Dortmund

Non-Preemptive and Limited Preemptive Scheduling. LS 12, TU Dortmund Non-Preemptive and Limited Preemptive Scheduling LS 12, TU Dortmund 09 May 2017 (LS 12, TU Dortmund) 1 / 31 Outline Non-Preemptive Scheduling A General View Exact Schedulability Test Pessimistic Schedulability

More information

Embedded Systems 14. Overview of embedded systems design

Embedded 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 information

Chapter 6: CPU Scheduling

Chapter 6: CPU Scheduling Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 6.1 Basic Concepts Maximum CPU utilization obtained

More information

Concurrent Models of Computation

Concurrent Models of Computation Concurrent Models of Computation Edward A. Lee Robert S. Pepper Distinguished Professor, UC Berkeley EECS 219D Concurrent Models of Computation Fall 2011 Copyright 2009-2011, Edward A. Lee, All rights

More information

System-on-Chip Communication Modeling Style Guide

System-on-Chip Communication Modeling Style Guide Center for Embedded Computer Systems University of California, Irvine System-on-Chip Communication Modeling Style Guide Dongwan Shin Andreas Gerstlauer Rainer Dömer Daniel D. Gajski Technical Report CECS-TR-04-25

More information

Design of Real-Time Software

Design of Real-Time Software Design of Real-Time Software Analysis of hard real-time tasks under fixed-priority pre-emptive scheduling Reinder J. Bril Technische Universiteit Eindhoven Department of Mathematics and Computer Science

More information

TDDB68 Concurrent programming and operating systems. Lecture: CPU Scheduling II

TDDB68 Concurrent programming and operating systems. Lecture: CPU Scheduling II TDDB68 Concurrent programming and operating systems Lecture: CPU Scheduling II Mikael Asplund, Senior Lecturer Real-time Systems Laboratory Department of Computer and Information Science Copyright Notice:

More information

TTA and PALS: Formally Verified Design Patterns for Distributed Cyber-Physical

TTA and PALS: Formally Verified Design Patterns for Distributed Cyber-Physical TTA and PALS: Formally Verified Design Patterns for Distributed Cyber-Physical DASC 2011, Oct/19 CoMMiCS Wilfried Steiner wilfried.steiner@tttech.com TTTech Computertechnik AG John Rushby rushby@csl.sri.com

More information

Lecture 6. Real-Time Systems. Dynamic Priority Scheduling

Lecture 6. Real-Time Systems. Dynamic Priority Scheduling Real-Time Systems Lecture 6 Dynamic Priority Scheduling Online scheduling with dynamic priorities: Earliest Deadline First scheduling CPU utilization bound Optimality and comparison with RM: Schedulability

More information

Task Models and Scheduling

Task Models and Scheduling Task Models and Scheduling Jan Reineke Saarland University June 27 th, 2013 With thanks to Jian-Jia Chen at KIT! Jan Reineke Task Models and Scheduling June 27 th, 2013 1 / 36 Task Models and Scheduling

More information

VLSI Design Verification and Test Simulation CMPE 646. Specification. Design(netlist) True-value Simulator

VLSI Design Verification and Test Simulation CMPE 646. Specification. Design(netlist) True-value Simulator Design Verification Simulation used for ) design verification: verify the correctness of the design and 2) test verification. Design verification: Response analysis Specification Design(netlist) Critical

More information

Logic BIST. Sungho Kang Yonsei University

Logic BIST. Sungho Kang Yonsei University Logic BIST Sungho Kang Yonsei University Outline Introduction Basics Issues Weighted Random Pattern Generation BIST Architectures Deterministic BIST Conclusion 2 Built In Self Test Test/ Normal Input Pattern

More information

System-on-Chip Communication Modeling Style Guide

System-on-Chip Communication Modeling Style Guide Center for Embedded Computer Systems University of California, Irvine System-on-Chip Communication Modeling Style Guide Dongwan Shin Andreas Gerstlauer Rainer Dömer Daniel D. Gajski Technical Report CECS-TR-04-25

More information

Verifying Weakly-Hard Real-Time Properties of Traffic Streams in Switched Networks

Verifying Weakly-Hard Real-Time Properties of Traffic Streams in Switched Networks Consistent * Complete * Well Documented * Easy to Reuse * Verifying Weakly-Hard Real-Time Properties of Traffic Streams in Switched Networks Leonie Ahrendts Institute for Network and Computer Engineering,

More information

Design and Analysis of Time-Critical Systems Response-time Analysis with a Focus on Shared Resources

Design and Analysis of Time-Critical Systems Response-time Analysis with a Focus on Shared Resources Design and Analysis of Time-Critical Systems Response-time Analysis with a Focus on Shared Resources Jan Reineke @ saarland university ACACES Summer School 2017 Fiuggi, Italy computer science Fixed-Priority

More information

An Automotive Case Study ERTSS 2016

An Automotive Case Study ERTSS 2016 Institut Mines-Telecom Virtual Yet Precise Prototyping: An Automotive Case Study Paris Sorbonne University Daniela Genius, Ludovic Apvrille daniela.genius@lip6.fr ludovic.apvrille@telecom-paristech.fr

More information

EE115C Winter 2017 Digital Electronic Circuits. Lecture 19: Timing Analysis

EE115C Winter 2017 Digital Electronic Circuits. Lecture 19: Timing Analysis EE115C Winter 2017 Digital Electronic Circuits Lecture 19: Timing Analysis Outline Timing parameters Clock nonidealities (skew and jitter) Impact of Clk skew on timing Impact of Clk jitter on timing Flip-flop-

More information

Scheduling of Concurrent Reactive Objects for Embedded Real-Time Systems

Scheduling of Concurrent Reactive Objects for Embedded Real-Time Systems Scheduling of Concurrent Reactive Objects for Embedded Real-Time Systems Per Lindgren, Professor Embedded Systems Luleå University of Technology Sweden using Microsoft Powerpoint EISLAB Luleå University

More information

Performance, Power & Energy. ELEC8106/ELEC6102 Spring 2010 Hayden Kwok-Hay So

Performance, Power & Energy. ELEC8106/ELEC6102 Spring 2010 Hayden Kwok-Hay So Performance, Power & Energy ELEC8106/ELEC6102 Spring 2010 Hayden Kwok-Hay So Recall: Goal of this class Performance Reconfiguration Power/ Energy H. So, Sp10 Lecture 3 - ELEC8106/6102 2 PERFORMANCE EVALUATION

More information

Networked Embedded Systems WS 2016/17

Networked Embedded Systems WS 2016/17 Networked Embedded Systems WS 2016/17 Lecture 2: Real-time Scheduling Marco Zimmerling Goal of Today s Lecture Introduction to scheduling of compute tasks on a single processor Tasks need to finish before

More information

3. Scheduling issues. Common approaches 3. Common approaches 1. Preemption vs. non preemption. Common approaches 2. Further definitions

3. Scheduling issues. Common approaches 3. Common approaches 1. Preemption vs. non preemption. Common approaches 2. Further definitions Common approaches 3 3. Scheduling issues Priority-driven (event-driven) scheduling This class of algorithms is greedy They never leave available processing resources unutilized An available resource may

More information

Robust On-Chip Bus Architecture Synthesis for MPSoCs Under Random Tasks Arrival

Robust On-Chip Bus Architecture Synthesis for MPSoCs Under Random Tasks Arrival Robust On-Chip Bus Architecture Synthesis for MPSoCs Under Random Tasks Arrival Sujan Pandey NP Semiconductors Research Eindhoven, The Netherlands pandey@informatik.uni-bremen.de Rolf Drechsler Dept. of

More information

Xarxes de distribució del senyal de. interferència electromagnètica, consum, soroll de conmutació.

Xarxes de distribució del senyal de. interferència electromagnètica, consum, soroll de conmutació. Xarxes de distribució del senyal de rellotge. Clock skew, jitter, interferència electromagnètica, consum, soroll de conmutació. (transparències generades a partir de la presentació de Jan M. Rabaey, Anantha

More information

Annotation Integration and Trade-off Analysis for Multimedia Applications

Annotation Integration and Trade-off Analysis for Multimedia Applications Annotation Integration and Trade-off Analysis for Multimedia Applications Radu Cornea, Alex Nicolau, Nikil Dutt School of Information & Computer Science University of California, Irvine Introduction and

More information

Non-preemptive multiprocessor scheduling of strict periodic systems with precedence constraints

Non-preemptive multiprocessor scheduling of strict periodic systems with precedence constraints Non-preemptive multiprocessor scheduling of strict periodic systems with precedence constraints Liliana Cucu, Yves Sorel INRIA Rocquencourt, BP 105-78153 Le Chesnay Cedex, France liliana.cucu@inria.fr,

More information

A Formal Model of Clock Domain Crossing and Automated Verification of Time-Triggered Hardware

A Formal Model of Clock Domain Crossing and Automated Verification of Time-Triggered Hardware A Formal Model of Clock Domain Crossing and Automated Verification of Time-Triggered Hardware Julien Schmaltz Institute for Computing and Information Sciences Radboud University Nijmegen The Netherlands

More information

Formal Verification of Systems-on-Chip

Formal Verification of Systems-on-Chip Formal Verification of Systems-on-Chip Wolfgang Kunz Department of Electrical & Computer Engineering University of Kaiserslautern, Germany Slide 1 Industrial Experiences Formal verification of Systems-on-Chip

More information

CycleTandem: Energy-Saving Scheduling for Real-Time Systems with Hardware Accelerators

CycleTandem: 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 information

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS Modeling, Analysis, and Hard Real-time Scheduling of Adaptive Streaming Applications Jiali Teddy Zhai, Sobhan Niknam, and Todor

More information

Instruction Set Extensions for Reed-Solomon Encoding and Decoding

Instruction Set Extensions for Reed-Solomon Encoding and Decoding Instruction Set Extensions for Reed-Solomon Encoding and Decoding Suman Mamidi and Michael J Schulte Dept of ECE University of Wisconsin-Madison {mamidi, schulte}@caewiscedu http://mesaecewiscedu Daniel

More information

School of EECS Seoul National University

School of EECS Seoul National University 4!4 07$ 8902808 3 School of EECS Seoul National University Introduction Low power design 3974/:.9 43 Increasing demand on performance and integrity of VLSI circuits Popularity of portable devices Low power

More information

Power-Aware Scheduling of Conditional Task Graphs in Real-Time Multiprocessor Systems

Power-Aware Scheduling of Conditional Task Graphs in Real-Time Multiprocessor Systems Power-Aware Scheduling of Conditional Task Graphs in Real-Time Multiprocessor Systems Dongkun Shin School of Computer Science and Engineering Seoul National University sdk@davinci.snu.ac.kr Jihong Kim

More information

Schedulability analysis of global Deadline-Monotonic scheduling

Schedulability analysis of global Deadline-Monotonic scheduling Schedulability analysis of global Deadline-Monotonic scheduling Sanjoy Baruah Abstract The multiprocessor Deadline-Monotonic (DM) scheduling of sporadic task systems is studied. A new sufficient schedulability

More information

Shedding the Shackles of Time-Division Multiplexing

Shedding the Shackles of Time-Division Multiplexing Shedding the Shackles of Time-Division Multiplexing Farouk Hebbache with Florian Brandner, 2 Mathieu Jan, Laurent Pautet 2 CEA List, LS 2 LTCI, Télécom ParisTech, Université Paris-Saclay Multi-core Architectures

More information

Analysis of Software Artifacts

Analysis of Software Artifacts Analysis of Software Artifacts System Performance I Shu-Ngai Yeung (with edits by Jeannette Wing) Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 2001 by Carnegie Mellon University

More information

Cool Shapers: Shaping Real-Time Tasks for Improved Thermal Guarantees

Cool Shapers: Shaping Real-Time Tasks for Improved Thermal Guarantees Cool Shapers: Shaping Real-Time Tasks for Improved Thermal Guarantees Pratyush Kumar and Lothar Thiele Computer Engineering and Networks Laboratory, ETH Zürich {pratyush.kumar, lothar.thiele}@tik.ee.ethz.ch

More information

Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2

Real-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 information

High Performance Computing

High Performance Computing Master Degree Program in Computer Science and Networking, 2014-15 High Performance Computing 2 nd appello February 11, 2015 Write your name, surname, student identification number (numero di matricola),

More information

CS 700: Quantitative Methods & Experimental Design in Computer Science

CS 700: Quantitative Methods & Experimental Design in Computer Science CS 700: Quantitative Methods & Experimental Design in Computer Science Sanjeev Setia Dept of Computer Science George Mason University Logistics Grade: 35% project, 25% Homework assignments 20% midterm,

More information

Binary Decision Diagrams and Symbolic Model Checking

Binary Decision Diagrams and Symbolic Model Checking Binary Decision Diagrams and Symbolic Model Checking Randy Bryant Ed Clarke Ken McMillan Allen Emerson CMU CMU Cadence U Texas http://www.cs.cmu.edu/~bryant Binary Decision Diagrams Restricted Form of

More information

SMT-based Scheduling for Multiprocessor Real-Time Systems

SMT-based Scheduling for Multiprocessor Real-Time Systems SMT-based Scheduling for Multiprocessor Real-Time Systems Zhuo Cheng, Haitao Zhang, Yasuo Tan, and Yuto Lim School of Information Science, Japan Advanced Institute of Science and Technology, Japan {chengzhuo,

More information

Finite Ready Queues As a Mean for Overload Reduction in Weakly-Hard Real-Time Systems

Finite Ready Queues As a Mean for Overload Reduction in Weakly-Hard Real-Time Systems Finite Ready Queues As a Mean for Overload Reduction in Weakly-Hard Real-Time Systems Sophie Quinton, Leonie Ahrendts, Rolf Ernst To cite this version: Sophie Quinton, Leonie Ahrendts, Rolf Ernst. Finite

More information

EXPLOITING NETWORK PROCESSORS FOR LOW LATENCY, HIGH THROUGHPUT, RATE-BASED SENSOR UPDATE DELIVERY. Kim Christian Swenson

EXPLOITING NETWORK PROCESSORS FOR LOW LATENCY, HIGH THROUGHPUT, RATE-BASED SENSOR UPDATE DELIVERY. Kim Christian Swenson EXPLOITING NETWORK PROCESSORS FOR LOW LATENCY, HIGH THROUGHPUT, RATE-BASED SENSOR UPDATE DELIVERY By Kim Christian Swenson A thesis submitted in partial fulfillment of the requirements for the degree of

More information

Energy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems

Energy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems Energy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems Jian-Jia Chen *, Chuan Yue Yang, Tei-Wei Kuo, and Chi-Sheng Shih Embedded Systems and Wireless Networking Lab. Department of Computer

More information

UC Santa Barbara. Operating Systems. Christopher Kruegel Department of Computer Science UC Santa Barbara

UC Santa Barbara. Operating Systems. Christopher Kruegel Department of Computer Science UC Santa Barbara Operating Systems Christopher Kruegel Department of Computer Science http://www.cs.ucsb.edu/~chris/ Many processes to execute, but one CPU OS time-multiplexes the CPU by operating context switching Between

More information

Worst-Case Execution Time Analysis. LS 12, TU Dortmund

Worst-Case Execution Time Analysis. LS 12, TU Dortmund Worst-Case Execution Time Analysis Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 02, 03 May 2016 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 53 Most Essential Assumptions for Real-Time Systems Upper

More information

Optimizing Loop Operation and Dataflow in FPGA Acceleration of Deep Convolutional Neural Networks

Optimizing Loop Operation and Dataflow in FPGA Acceleration of Deep Convolutional Neural Networks 2017 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays Optimizing Loop Operation and Dataflow in FPGA Acceleration of Deep Convolutional Neural Networks Yufei Ma, Yu Cao, Sarma Vrudhula,

More information

Performance, Power & Energy

Performance, Power & Energy Recall: Goal of this class Performance, Power & Energy ELE8106/ELE6102 Performance Reconfiguration Power/ Energy Spring 2010 Hayden Kwok-Hay So H. So, Sp10 Lecture 3 - ELE8106/6102 2 What is good performance?

More information

Mapping to Parallel Hardware

Mapping to Parallel Hardware - Mapping to Parallel Hardware Bruno Bodin University of Edinburgh, United Kingdom 1 / 27 Context - Hardware Samsung Exynos ARM big-little (Heterogenenous), 4 ARM A15, 4 ARM A7, 2-16 cores GPU, 5 Watt.

More information

Scheduling Periodic Real-Time Tasks on Uniprocessor Systems. LS 12, TU Dortmund

Scheduling Periodic Real-Time Tasks on Uniprocessor Systems. LS 12, TU Dortmund Scheduling Periodic Real-Time Tasks on Uniprocessor Systems Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 08, Dec., 2015 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 38 Periodic Control System Pseudo-code

More information

Real-Time Systems. Event-Driven Scheduling

Real-Time Systems. Event-Driven Scheduling Real-Time Systems Event-Driven Scheduling Marcus Völp, Hermann Härtig WS 2013/14 Outline mostly following Jane Liu, Real-Time Systems Principles Scheduling EDF and LST as dynamic scheduling methods Fixed

More information

Real-Time Scheduling

Real-Time Scheduling 1 Real-Time Scheduling Formal Model [Some parts of this lecture are based on a real-time systems course of Colin Perkins http://csperkins.org/teaching/rtes/index.html] Real-Time Scheduling Formal Model

More information

c 2010 Deepti Kumar Chivukula

c 2010 Deepti Kumar Chivukula c 2010 Deepti Kumar Chivukula BUS SCHEDULING IMPLEMENTATION ON THE CELL PROCESSOR BY DEEPTI KUMAR CHIVUKULA THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science

More information