Using Interfaces to Analyze Compositionality Haiyang Zheng and Rachel Zhou EE290N Class Project Presentation Dec. 10, 2004.

Slides:



Advertisements
Similar presentations
Orthogonal Drawing Kees Visser. Overview  Introduction  Orthogonal representation  Flow network  Bend optimal drawing.
Advertisements

Architecture Representation
SOFTWARE TESTING. INTRODUCTION  Software Testing is the process of executing a program or system with the intent of finding errors.  It involves any.
Introduction to Training and Learning in Neural Networks n CS/PY 399 Lab Presentation # 4 n February 1, 2001 n Mount Union College.
IE 469 Manufacturing Systems
Introduction to Data Flow Graphs and their Scheduling Sources: Gang Quan.
Requirements on the Execution of Kahn Process Networks Marc Geilen and Twan Basten 11 April 2003 /e.
Parametric Throughput Analysis of Synchronous Data Flow Graphs
DATAFLOW PROCESS NETWORKS Edward A. Lee Thomas M. Parks.
Discrete Event Models: Getting the Semantics Right Edward A. Lee Robert S. Pepper Distinguished Professor Chair of EECS UC Berkeley With thanks to Xioajun.
Petri net modeling of biological networks Claudine Chaouiya.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
Towards Distributed Diagnosis of Complex Physical Systems J. Gandhe Embedded & Hybrid Systems Laboratory, EECS Dept & ISIS, Vanderbilt University Collaborators:
PTIDES: Programming Temporally Integrated Distributed Embedded Systems Yang Zhao, EECS, UC Berkeley Edward A. Lee, EECS, UC Berkeley Jie Liu, Microsoft.
7th Biennial Ptolemy Miniconference Berkeley, CA February 13, 2007 Causality Interfaces for Actor Networks Ye Zhou and Edward A. Lee University of California,
Chess Review May 8, 2003 Berkeley, CA Classes and Inheritance in Actor- Oriented Models Stephen Neuendorffer Edward Lee UC Berkeley.
Type System, March 12, Data Types and Behavioral Types Yuhong Xiong Edward A. Lee Department of Electrical Engineering and Computer Sciences University.
7th Biennial Ptolemy Miniconference Berkeley, CA February 13, 2007 Leveraging Synchronous Language Principles for Hybrid System Models Haiyang Zheng and.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 8 May 4, 2005
A denotational framework for comparing models of computation Daniele Gasperini.
Timing-Based Communication Refinement for CFSMs Presenters:Heloise Hse, Irene Po Mentors:Jonathan Martin, Marco Sgroi Professor:Alberto Sangiovanni-Vincentelli.
Causality Interface  Declares the dependency that output events have on input events.  D is an ordered set associated with the min ( ) and plus ( ) operators.
A Schedulability-Preserving Transformation of BDF to Petri Nets Cong Liu EECS 290n Class Project December 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.
1 Engineering Computation Part 4. 2 Enrique Castillo University of Cantabria An algorithm that permits solving many problems in Algebra. Applications.
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.
Discrete Event Models: Getting the Semantics Right Edward A. Lee Robert S. Pepper Distinguished Professor Chair of EECS UC Berkeley With special thanks.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Causality Interfaces and Compositional Causality Analysis Rachel Zhou UC Berkeley.
A Denotational Semantics For Dataflow with Firing Edward A. Lee Jike Chong Wei Zheng Paper Discussion for.
1 Petri Nets Marco Sgroi EE249 - Fall 2001 Most slides borrowed from Luciano Lavagno’s lecture ee249 (1998)
Hierarchical Reconfiguration of Dataflow Graphs Stephen Neuendorffer UC Berkeley Poster Preview May 10, 2004.
Code and Decoder Design of LDPC Codes for Gbps Systems Jeremy Thorpe Presented to: Microsoft Research
Heterochronous Dataflow in Ptolemy II Brian K. Vogel EE249 Project Presentation, Dec. 4, 1999.
Department of Electrical Engineering and Computer Sciences University of California at Berkeley System-Level Types for Component-Based Design Edward A.
February 12, 2009 Center for Hybrid and Embedded Software Systems Model Transformation Using ERG Controller Thomas H. Feng.
Chess Review May 11, 2005 Berkeley, CA Discrete-Event Systems: Generalizing Metric Spaces and Fixed-Point Semantics Adam Cataldo Edward Lee Xiaojun Liu.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 8: February 11, 2009 Dataflow.
Joint Minimization of Code and Data for Synchronous Dataflow Programs Kaushik Ravindran EE 249 – Presentation.
System-Level Types for Component-Based Design Paper by: Edward A. Lee and Yuhong Xiong Presentation by: Dan Patterson.
Router modeling using Ptolemy Xuanming Dong and Amit Mahajan May 15, 2002 EE290N.
Models of Computation as Program Transformations Chris Chang
Introduction to Data Flow Graphs and their Scheduling Sources: Gang Quan.
Inverting Amplifier. Introduction An inverting amplifier is a type of electrical circuit that reverses the flow of current passing through it. This reversal.
Composing Models of Computation in Kepler/Ptolemy II
CMSC 345 Fall 2000 Unit Testing. The testing process.
An Ontological Framework for Web Service Processes By Claus Pahl and Ronan Barrett.
Lyra – A service-oriented and component-based method for the development of communicating systems (by Sari Leppänen, Nokia/NRC) Traditionally, the design,
C. André, J. Boucaron, A. Coadou, J. DeAntoni,
Fall 2004EE 3563 Digital Systems Design EE 3563 VHSIC Hardware Description Language  Required Reading: –These Slides –VHDL Tutorial  Very High Speed.
Run-time Adaptive on-chip Communication Scheme 林孟諭 Dept. of Electrical Engineering National Cheng Kung University Tainan, Taiwan, R.O.C.
ELEC692 VLSI Signal Processing Architecture Lecture 3
CSCI1600: Embedded and Real Time Software Lecture 11: Modeling IV: Concurrency Steven Reiss, Fall 2015.
Royal Institute of Technology System Specification Fundamentals Axel Jantsch, Royal Institute of Technology Stockholm, Sweden.
Pipelined and Parallel Computing Partition for 1 Hongtao Du AICIP Research Nov 3, 2005.
Chapter 8: Adaptive Networks
1 “Figures and images used in these lecture notes by permission, copyright 1997 by Alan V. Oppenheim and Alan S. Willsky” Signals and Systems Spring 2003.
Multi-Objective Optimization for Topology Control in Hybrid FSO/RF Networks Jaime Llorca December 8, 2004.
Neural Networks. Background - Neural Networks can be : Biological - Biological models Artificial - Artificial models - Desire to produce artificial systems.
T imed Languages for Embedded Software Ethan Jackson Advisor: Dr. Janos Szitpanovits Institute for Software Integrated Systems Vanderbilt University.
Network Management Lecture 13. MACHINE LEARNING TECHNIQUES 2 Dr. Atiq Ahmed Université de Balouchistan.
Marilyn Wolf1 With contributions from:
Modelling and Solving Configuration Problems on Business
Teknik kendali.
CPE555A: Real-Time Embedded Systems
From C to Elastic Circuits
Dynamically Scheduled High-level Synthesis
Deadlock Detection for Distributed Process Networks
Parallel Exact Stochastic Simulation in Biochemical Systems
Presentation transcript:

Using Interfaces to Analyze Compositionality Haiyang Zheng and Rachel Zhou EE290N Class Project Presentation Dec. 10, 2004

Outline Introduction and motivation. Study and development of several interfaces for discrete-event models. Applying the previously developed interfaces on dataflow and process network models. Conclusion.

Introduction What is a composition? –A product of mixing or combining various elements or ingredients. (From Merriam-Webster Online.) What is a valid composition? –The interface of a composition should be indistinguishable from its elements. An interface of an actor can be a set of ports and parameters. –The behavior of a composition should be the same as that of before being composed. A behavior includes not only ports and parameters but also the signals going through the ports. Can we reason about the behavioral validity of a composition by analyzing its interfaces only?

An Example without Composition A discrete-event model that has a unique behavior. A delta-causal process.

An Example with Composition What about the existence and uniqueness of the behavior of the following model (modified from the previous example by introducing a hierarchy)? The causality property is missing. An interface only consisting of ports and parameters is insufficient to reason about the behavior of the composite actor.

A Refined Interface This interface includes function dependencies of an actor. –A function dependency of an actor is a data dependency relation that an output port has on an input port of the same actor in the same firing. This interface is a graph, where nodes are ports and directed edges represent data dependencies. Function Dependency (No data dependency.) Interfaces Function Dependency (Output depends on input.)

A Refined Interface (Continued) Abstraction Communication Dependency Interfaces (graphs) of component actors can be composed with communication dependencies to construct another graph. The interface of a composite actor is an abstraction of the resulted graph.

Revisiting Example What about the existence and uniqueness of the behavior of the following model (modified from the previous example by introducing a hierarchy)? A strictly causal process. The new interface containing function dependency is still insufficient to reason about the behavior of the composite actor.

A Weighted Interface This interface contains weighted function dependencies. Each input-output pair has a directed edge going from input to output. Each edge has a weight, where the weight represents the amount of delay between input and output. A directed edge with weight 1.0. A directed edge with weight 0.0. A directed edge with weight infinity. A directed edge with weight x infinity x

A Weighted Interface (Cont.) This interface distinguishes delta causality from strict causality. If an edge has a weight depending on states, this interface may not help much. Abstraction Sum Abstraction 0.0 x x Sum Replace TimedDelay with

Revisiting Example What about the existence and uniqueness of the behavior of the following model (modified from the previous example by introducing a hierarchy)? A delta causal process. The new interface containing weighted function dependency is sufficient to reason about the behavior of the composite actor.

A More Complex DE Model We can conclude from the analysis of interfaces that the following model has a unique behavior and it is a valid composition according to the DE semantics. –A DE simulator may complain about a direct feedback loop. –However, if a DE simulator can simulate the model, it does give the same behavior as that of a flattened model. p1p3p2 p4 0.0 p5 0.0 p6 0.0 p1 p2 p3 p4 (t, 1, 1) a  a  (t, 1, 2)  a  a (t, 2, 1) b  b  (t, 2, 2)  b  b p1 p2 p3 p4 (t, 1) a a a a (t, 2) b b b b Before composition After composition Index for Firings of Composite Firing order of Actors

Where are we… Introduction and motivation. Study and improvement of several interfaces for discrete-event models. Applying the previously developed interfaces on dataflow and process network models. Conclusion.

B E 2 D A F C SDF B E 2 D A F C Composition Example 1 in Dataflow Composition in SDF adds constraints on the number of firings of actor B and E in the firing vector. A consistent SDF graph. This makes the whole model inconsistent. This is an invalid composition.

B E 2 D A F C SDF B E 2 D A F C Schedules for actor B and E are actually independent, but composition adds constraint on them. Decomposition using Function Dependency One solution is to perform function dependency analysis and decomposition. Only necessary decomposition is performed so maximum compositionality is preserved.

Composition Example 2 in Dataflow A consistent SDF graph. Schedulability is lost if hierarchy is introduced. The graph becomes deadlock.

Weighted Interface for Dataflow Nodes represent ports and directed edges represent data and communication dependencies. Each node has a weight, which represents the number of initial tokens available at this node (port). A directed edge represents dependency between the weight of its sink node on that of its source node. kk+1kk k k 0

Dataflow Example 2 Revisited Abstraction kkk +1 k The interface exposes the necessary information to analyze deadlock correctly.

Dataflow Example 3 A {0} 2 B 3 32 k When k = 1, Therefore, actor B has enough tokens to fire and the deadlock is resolved. A symbolic representation of the interface.

Dataflow Example 1 Revisited B E 2 D A F C SDF m n m n Similarly, we can use symbolic representation (weighted interfaces) for the rate signature of the composite actor. The variable m and n give 2 degrees of freedom on the composite actor schedule. m and n can be determined by the outside constraint (balance equations) and the minimum solution requirement.

Artificial Local Deadlock in Process Network B ED A F C PN B ED A F C One solution is to introduce a new hierarchy for each disconnected graph. Each inside PN director is responsible to detect its own deadlock. Artificial local deadlock is not handled by Parks’ algorithm.

Conclusion We developed several interfaces to analyze compositionality of models with different models of computation. Future work will be to develop more useful interfaces.

The End. Thanks!