Voicu Groza, 2008 SITE, 2008 - HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Hardware/Software Codesign of Embedded Systems Voicu Groza SITE Hall, Room.

Slides:

Advertisements

Similar presentations

Network II.5 simulator ..

Advertisements

Fakult ä t f ü r informatik informatik 12 technische universit ä t dortmund Data flow models Peter Marwedel TU Dortmund, Informatik 12 Graphics: © Alexandra.

Modelos de Computação Básicos Prof. Dr. César Augusto Missio Marcon Parcialmente extraído de trabalhos de Axel Jantch, Edward Lee e Alberto Sangiovanni-Vincentelli.

Hardware/ Software Partitioning 2011 年 12 月 09 日 Peter Marwedel TU Dortmund, Informatik 12 Germany Graphics: © Alexandra Nolte, Gesine Marwedel, 2003 These.

Electrical and Computer Department, North Dakota State University

Introduction to Petri Nets Hugo Andrés López

Structured Thread Models Kahn Process Networks, CSP, Go 1Dennis Kafura – CS5204 – Operating Systems.

Requirements on the Execution of Kahn Process Networks Marc Geilen and Twan Basten 11 April 2003 /e.

DATAFLOW PROCESS NETWORKS Edward A. Lee Thomas M. Parks.

1Outline u Part 3: Models of Computation s FSMs s Discrete Event Systems s CFSMs s Data Flow Models s Petri Nets s The Tagged Signal Model.

Addressing the System-on-a-Chip Interconnect Woes Through Communication-Based Design N. Vinay Krishnan EE249 Class Presentation.

Component Technologies for Embedded Systems Johan Eker.

Type System, March 12, Data Types and Behavioral Types Yuhong Xiong Edward A. Lee Department of Electrical Engineering and Computer Sciences University.

1 Discrete Event u Explicit notion of time (global order…) u DE simulator maintains a global event queue (Verilog and VHDL) u Drawbacks s global event.

SCORE - Stream Computations Organized for Reconfigurable Execution Eylon Caspi, Michael Chu, Randy Huang, Joseph Yeh, Yury Markovskiy Andre DeHon, John.

A denotational framework for comparing models of computation Daniele Gasperini.

Copyright © 2001 Stephen A. Edwards All rights reserved Dataflow Languages Prof. Stephen A. Edwards.

Mahapatra-Texas A&M-Fall'001 cosynthesis Introduction to cosynthesis Rabi Mahapatra CPSC498.

Review of “Embedded Software” by E.A. Lee Katherine Barrow Vladimir Jakobac.

FunState – An Internal Design Representation for Codesign A model that enables representations of different types of system components. Mixture of functional.

CS 267 Spring 2008 Horst Simon UC Berkeley May 15, 2008 Code Generation Framework for Process Network Models onto Parallel Platforms Man-Kit Leung, Isaac.

AR vs. CFSM Abdallah Tabbara. CFSM Overview 4 CFSM has: –a finite state machine part –a data computation part –a locally synchronous behavior transitions.

1 Quasi-Static Scheduling of Embedded Software Using Free-Choice Petri Nets Marco Sgroi, Alberto Sangiovanni-Vincentelli Luciano Lavagno University of.

Dataflow Process Networks Lee & Parks Synchronous Dataflow Lee & Messerschmitt Abhijit Davare Nathan Kitchen.

Design of Fault Tolerant Data Flow in Ptolemy II Mark McKelvin EE290 N, Fall 2004 Final Project.

Models of Computation for Embedded System Design Alvise Bonivento.

1 Petri Nets Marco Sgroi EE249 - Fall 2002.

A Denotational Semantics For Dataflow with Firing Edward A. Lee Jike Chong Wei Zheng Paper Discussion for.

(Page 554 – 564) Ping Perez CS 147 Summer 2001 Alternative Parallel Architectures  Dataflow  Systolic arrays  Neural networks.

Department of Electrical Engineering and Computer Sciences University of California at Berkeley Concurrent Component Patterns, Models of Computation, and.

February 12, 2009 Center for Hybrid and Embedded Software Systems Model Transformation Using ERG Controller Thomas H. Feng.

Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 8: February 11, 2009 Dataflow.

1 System Modeling. Models of Computation. System Specification Languages Alexandru Andrei.

CS294-6 Reconfigurable Computing Day 23 November 10, 1998 Stream Processing.

VLSI DSP 2008Y.T. Hwang3-1 Chapter 3 Algorithm Representation & Iteration Bound.

Models of Computation Reading Assignment: L. Lavagno, A.S. Vincentelli and E. Sentovich, “Models of computation for Embedded System Design”

Models of Computation as Program Transformations Chris Chang

October 18, 2001Cho & Kim 1 Software Synthesis EE202A Presentation October 18, 2001 Young H. Cho and Seung Hyun Kim.

1 Dataflow Networks Syntax and Semantics –actor, tokens and firing Static scheduling Other dataflow models.

University of Ottawa, SITE, 2008 VOICU GROZA - HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Hardware/Software Codesign of Embedded Systems TOPICS IN.

02/06/05 “Investigating a Finite–State Machine Notation for Discrete–Event Systems” Nikolay Stoimenov.

CMPE 511 DATA FLOW MACHINES Mustafa Emre ERKOÇ 11/12/2003.

High Performance Architectures Dataflow Part 3. 2 Dataflow Processors Recall from Basic Processor Pipelining: Hazards limit performance  Structural hazards.

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS 1 Hardware/Software Codesign of Embedded Systems DESIGN METHODOLOGIES Voicu.

- 1 - Embedded Systems - SDL Some general properties of languages 1. Synchronous vs. asynchronous languages Description of several processes in many languages.

Hardware/Software Co-design Design of Hardware/Software Systems A Class Presentation for VLSI Course by : Akbar Sharifi Based on the work presented in.

1 Multithreaded Architectures Lecture 3 of 4 Supercomputing ’93 Tutorial Friday, November 19, 1993 Portland, Oregon Rishiyur S. Nikhil Digital Equipment.

1 - CPRE 583 (Reconfigurable Computing): Compute Models Iowa State University (Ames) CPRE 583 Reconfigurable Computing Lecture 7: Wed 10/28/2009 (Compute.

- 1 - EE898_HW/SW Partitioning Hardware/software partitioning  Functionality to be implemented in software or in hardware? No need to consider special.

Conformance Test Experiments for Distributed Real-Time Systems Rachel Cardell-Oliver Complex Systems Group Department of Computer Science & Software Engineering.

The UML Formal Methods for SoC Design Sorin Manolache

School of Computer Science, The University of Adelaide© The University of Adelaide, Control Data Flow Graphs An experiment using Design/CPN Sue Tyerman.

1 Copyright  2001 Pao-Ann Hsiung SW HW Module Outline l Introduction l Unified HW/SW Representations l HW/SW Partitioning Techniques l Integrated HW/SW.

Actor Oriented Programming with CAL -designing embedded system components Johan Eker Department of Automatic Control, Lund University Chris Chang, Jörn.

Royal Institute of Technology System Specification Fundamentals Axel Jantsch, Royal Institute of Technology Stockholm, Sweden.

High Performance Embedded Computing © 2007 Elsevier Chapter 1, part 3: Embedded Computing High Performance Embedded Computing Wayne Wolf.

March 4, 2008http://csg.csail.mit.edu/arvindDF3-1 Dynamic Dataflow Arvind Computer Science & Artificial Intelligence Lab Massachusetts Institute of Technology.

High Performance Embedded Computing © 2007 Elsevier Lecture 4: Models of Computation Embedded Computing Systems Mikko Lipasti, adapted from M. Schulte.

Marilyn Wolf1 With contributions from:

Dataflow Machines CMPE 511

Prof. Onur Mutlu Carnegie Mellon University

2. Specification and Modeling

ESE532: System-on-a-Chip Architecture

Discrete Event Explicit notion of time (global order…)

Model Transformation with the Ptera Controller

Deadlock Detection for Distributed Process Networks

Well-behaved Dataflow Graphs

Samira Khan University of Virginia Jan 23, 2019

Advanced Computer Architecture Dataflow Processing

Prof. Onur Mutlu Carnegie Mellon University

Presentation transcript:

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Hardware/Software Codesign of Embedded Systems Voicu Groza SITE Hall, Room ext Dataflow Networks

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Dataflow networks A bit of history Syntax and semantics –actors, tokens and firings Scheduling of Static Data-flow –static scheduling –code generation –buffer sizing Other Data-flow models –Boolean Data-flow –Dynamic Data-flow

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Data-flow networks Powerful formalism for data-dominated system specification Partially-ordered model (no over-specification) Deterministic execution independent of scheduling Used for –simulation –scheduling –memory allocation –code generation for Digital Signal Processors (HW and SW)

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS A bit of history Karp computation graphs (‘ 66): seminal work Kahn process networks (‘ 58): formal model Dennis Data- flow networks (‘ 75): programming language for MIT DF machine Several recent implementations –graphical: Ptolemy (UCB), Khoros (U. New Mexico), Grape (U.Leuven) SPW (Cadence), COSSAP (Synopsys) –textual: Silage (UCB, Mentor) Lucid, Haskell

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Dataflow network A dataflow network is a network of concurrently executing processes or automata that can communicate by sending data over channels represented as a collection of functional nodes which are connected and communicate over unbounded queues Nodes are commonly called actors The bits of information that are communicated over the queues are commonly called tokens

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Intuitive semantics (Often stateless) actors perform computation Unbounded FIFOs perform communication via sequences of tokens carrying values –integer, float, fixed point –matrix of integer, float, fixed point –image of pixels State implemented as self-loop Determinacy: –unique output sequences given unique input sequences –Sufficient condition: blocking read (process cannot test input queues for emptiness) At each time, one actor is fired When firing, actors consume in tokens and produce out tokens Actors can be fired only if there are enough tokens in the input queues

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Intuitive semantics Example: FIR filter single input sequence i( n) single output sequence o( n) o( n) = c1 i( n) + c2 i( n- 1) i *c1 *c2 + o i(-1)

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Intuitive semantics Example: FIR filter single input sequence i( n) single output sequence o( n) o( n) = c1 i( n) + c2 i( n- 1) i *c1 *c2 + o i(-1)

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Intuitive semantics Example: FIR filter single input sequence i( n) single output sequence o( n) o( n) = c1 i( n) + c2 i( n- 1) i *c1 *c2 + o i(-1)

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Intuitive semantics Example: FIR filter single input sequence i( n) single output sequence o( n) o( n) = c1 i( n) + c2 i( n- 1) i *c1 *c2 + o i(-1)

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Intuitive semantics Example: FIR filter single input sequence i( n) single output sequence o( n) o( n) = c1 i( n) + c2 i( n- 1) i *c1 *c2 + o i(-1)

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Intuitive semantics Example: FIR filter single input sequence i( n) single output sequence o( n) o( n) = c1 i( n) + c2 i( n- 1) i *c1 *c2 + o i(-1)

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Intuitive semantics Example: FIR filter single input sequence i( n) single output sequence o( n) o( n) = c1 i( n) + c2 i( n- 1) i *c1 *c2 + o

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Intuitive semantics Example: FIR filter single input sequence i( n) single output sequence o( n) o( n) = c1 i( n) + c2 i( n- 1) i *c1 *c2 + o

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Intuitive semantics Example: FIR filter single input sequence i( n) single output sequence o( n) o( n) = c1 i( n) + c2 i( n- 1) i *c1 *c2 + o

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Intuitive semantics Example: FIR filter single input sequence i( n) single output sequence o( n) o( n) = c1 i( n) + c2 i( n- 1) i *c1 *c2 + o

Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Questions Does the order in which actors are fired affect the final result? Does it affect the “operation” of the network in any way?