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

Slides:



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

Digital Logic Design Week 7 Encoders, Decoders, Multiplexers, Demuxes.
Based on: Petri Nets and Industrial Applications: A Tutorial
Decoders/DeMUXs CS370 – Spring Decoder: single data input, n control inputs, 2 outputs control inputs (called select S) represent Binary index of.
DATAFLOW PROCESS NETWORKS Edward A. Lee Thomas M. Parks.
Component Technologies for Embedded Systems Johan Eker.
7th Biennial Ptolemy Miniconference Berkeley, CA February 13, 2007 Causality Interfaces for Actor Networks Ye Zhou and Edward A. Lee University of California,
Type System, March 12, Data Types and Behavioral Types Yuhong Xiong Edward A. Lee Department of Electrical Engineering and Computer Sciences University.
A denotational framework for comparing models of computation Daniele Gasperini.
Using Interfaces to Analyze Compositionality Haiyang Zheng and Rachel Zhou EE290N Class Project Presentation Dec. 10, 2004.
February 12, 2009 Center for Hybrid and Embedded Software Systems Encapsulated Model Transformation Rule A transformation.
FunState – An Internal Design Representation for Codesign A model that enables representations of different types of system components. Mixture of functional.
An Extensible Type System for Component-Based Design
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.
Balancing Expressiveness and Analyzability in Stream Formalisms Edward A. Lee Robert S. Pepper Distinguished Professor EECS Department, UC Berkeley Invited.
A Denotational Semantics For Dataflow with Firing Edward A. Lee Jike Chong Wei Zheng Paper Discussion for.
Heterochronous Dataflow in Ptolemy II Brian K. Vogel EE249 Project Presentation, Dec. 4, 1999.
SEC PI Meeting Annapolis, May 8-9, 2001 Component-Based Design of Embedded Control Systems Edward A. Lee & Jie Liu UC Berkeley with thanks to the entire.
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.
The Caltrop Actor Language Johan Eker UC Berkeley MoBIES group, Carnegie Mellon, November 30, 2001.
CS294-6 Reconfigurable Computing Day 23 November 10, 1998 Stream Processing.
ECE 301 – Digital Electronics Multiplexers and Demultiplexers (Lecture #12)
Models of Computation Reading Assignment: L. Lavagno, A.S. Vincentelli and E. Sentovich, “Models of computation for Embedded System Design”
Institut für Computertechnik ICT Institute of Computer Technology Interaction of SystemC AMS Extensions with TLM 2.0 Markus Damm, Christoph.
Voicu Groza, 2008 SITE, HARDWARE/SOFTWARE CODESIGN OF EMBEDDED SYSTEMS Hardware/Software Codesign of Embedded Systems Voicu Groza SITE Hall, Room.
Composing Models of Computation in Kepler/Ptolemy II
1 Multithreaded Architectures Lecture 3 of 4 Supercomputing ’93 Tutorial Friday, November 19, 1993 Portland, Oregon Rishiyur S. Nikhil Digital Equipment.
Mux 2.1 Multiplexers and De-Multiplexers 2: ©Paul Godin Updated November 2007.
C. André, J. Boucaron, A. Coadou, J. DeAntoni,
ECE 331 – Digital System Design Multiplexers and Demultiplexers (Lecture #13)
Different parallel processing architectures Module 2.
Quantitative Evaluation of Embedded Systems. Given a dataflow graph with execution times E a Determine the MCM and choose a period μ ≥ MCM Determine start-times.
Chapter 7 Dataflow Architecture. 7.1 Dataflow Models  A dataflow program: the sequence of operations is not specified, but depends upon the need and.
Multiplexers and De-Multiplexers 1
What can BX make from Sense? Arend Rensink, University of Twente Banff, December 2013.
Ptolemy & Models of Computation -by Hao Chen, Zhuang Fan, Jin Xiao School of Computer Science University of Waterloo Claudius Ptolemaeus, the second century.
Actor Oriented Programming with CAL -designing embedded system components Johan Eker Department of Automatic Control, Lund University Chris Chang, Jörn.
Multiplexers and De-Multiplexers
Multiplexers Section Topics Multiplexers – Definition – Examples – Verilog Modeling.
March 4, 2008http://csg.csail.mit.edu/arvindDF3-1 Dynamic Dataflow Arvind Computer Science & Artificial Intelligence Lab Massachusetts Institute of Technology.
Multiplexers & Decoders By: Jason Pitts CS 147 Spring 2010.
AND Gate Inputs Output Input A (Switch) Input B (Switch) Output Y (Lamp) 0 (Open) 0 (OFF) A B Lamp.
High Performance Embedded Computing © 2007 Elsevier Lecture 4: Models of Computation Embedded Computing Systems Mikko Lipasti, adapted from M. Schulte.
Autumn 2006CSE P548 - Dataflow Machines1 Von Neumann Execution Model Fetch: send PC to memory transfer instruction from memory to CPU increment PC Decode.
Computer Architecture: Dataflow (Part I) Prof. Onur Mutlu Carnegie Mellon University.
May 5, 2004Slide 2 OmnAuto TMS Solution May 5, 2004Slide 3 OmnAuto TMS Dataflow.
Dataflow Machines CMPE 511
ENG2410 Digital Design “Combinational Logic Design”
EKT 124 MUX AND DEMUX.
Prof. Onur Mutlu Carnegie Mellon University
2. Specification and Modeling
Fall 2012 Parallel Computer Architecture Lecture 22: Dataflow I
ESE532: System-on-a-Chip Architecture
Multiplexers and Demultiplexers,
The Multiplexer Multi what?
Packet Switching (basics)
Code Generation for Ptolemy II
Topic B (Cont’d) Dataflow Model of Computation
Model Transformation with the Ptera Controller
CSP-Style Rendezvous Communication Thomas Feng, Edward Lee, Yang Zhao
Petri nets.
Objective- To graph a relationship in a table.
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:

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

slide -ASV-UCB2

3

4 Intuitive Semantics

slide -ASV-UCB5

6

7

8

9

10

slide -ASV-UCB11

slide -ASV-UCB12

slide -ASV-UCB13

slide -ASV-UCB14

slide -ASV-UCB15

slide -ASV-UCB16

slide -ASV-UCB17

slide -ASV-UCB18

slide -ASV-UCB19

slide -ASV-UCB20

slide -ASV-UCB21

slide -ASV-UCB22

slide -ASV-UCB23

Mahapatra- Texas A&M- Fall0024 Summary of function class Summary of function class and their relationship for the function F: S p  S q Sequential  continuous  monotonic

slide -ASV-UCB25

slide -ASV-UCB26

slide -ASV-UCB27

slide -ASV-UCB28

slide -ASV-UCB29

slide -ASV-UCB30

slide -ASV-UCB31

slide -ASV-UCB32

slide -ASV-UCB33

Mahapatra-Texas A&M-Fall'0034 Tagged Token DFM Arvind and Gostelow 80’s Each token has a tag, firing is enabled when tokens have matching tags. –No need of FIFO discipline in the channel

Mahapatra-Texas A&M-Fall'0035 Boolean Dataflow Actors have Boolean control ports which may control input and output ports. All other ports obey SDF semantics Ex. Switch (de-multiplexing), Select (Mux) Boolean control ports are read first and then other input ports. Switch and select can be used to data-dependent iteration. Allows conditional flow of data.

slide -ASV-UCB36

slide -ASV-UCB37