Chess Review November 21, 2005 Berkeley, CA Edited and presented by Trading Latency for Composability Slobodan Matic UC Berkeley.

Slides:



Advertisements
Similar presentations
Coflow A Networking Abstraction For Cluster Applications UC Berkeley Mosharaf Chowdhury Ion Stoica.
Advertisements

The Fixed Logical Execution Time (FLET) Assumption Tom Henzinger University of California, Berkeley.
Edward A. Lee Designing a Relevant Lab for Introductory Signals and Systems Edward A. Lee UC Berkeley A computer without networking, audio, video, or real-time.
Luca de Alfaro Thomas A. Henzinger Ranjit Jhala UC Berkeley Compositional Methods for Probabilistic Systems.
Fault-Tolerant Real-Time Networks Tom Henzinger UC Berkeley MURI Kick-off Workshop Berkeley, May 2000.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Optimal Control of Stochastic Hybrid Systems Robin Raffard EECS Berkeley.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Interchange Format for Hybrid Systems Alessandro Pinto UC Berkeley.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by New results in Platform Modeling Tivadar Szemethy ISIS, Vanderbilt University.
Overview of PTIDES Project
Chess Review May 8, 2003 Berkeley, CA Classes and Inheritance in Actor- Oriented Models Stephen Neuendorffer Edward Lee UC Berkeley.
Berkeley, CA, March 12, 2002 Modal Models in Vehicle-Vehicle Coordination Control Xiaojun Liu The Ptolemy Group EECS Department, UC Berkeley.
Integrated Design and Analysis Tools for Software-Based Control Systems Shankar Sastry (PI) Tom Henzinger Edward Lee University of California, Berkeley.
Chess Review May 11, 2005 Berkeley, CA Advances In MIC Tools for Networked Embedded Systems Applications Edited and Presented by Janos Sztipanovits ISIS,
Chess Review May 10, 2004 Berkeley, CA Towards Distributed Diagnosis of Complex Physical Systems Presented by- Gautam Biswas Jyoti Gandhe Xenofon D. Koutsoukos.
Behavioral Types as Interface Definitions for Concurrent Components Center for Hybrid and Embedded Software Systems Edward A. Lee Professor UC Berkeley.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Hybrid Geometric Mechanics: Reduction and Going Beyond Zeno Aaron D. Ames UC Berkeley.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by A New Course in Hybrid and Embedded Systems Claire J. Tomlin UC Berkeley.
Chess Review October 4, 2006 Alexandria, VA Edited and presented by Advanced Tool Architectures Edward A. Lee UC Berkeley.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Advanced Tool Architectures Edward A. Lee UC Berkeley.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Platform Based Design for Wireless Sensor Networks Alvise Bonivento UC Berkeley.
Timed Simulation with Multiple Resource Schedulability Analysis Yang Zhao and Slobodan Matic University of California, BerkeleyDec 10, 2004.
Chess Review May 11, 2005 Berkeley, CA Composable Code Generation for Distributed Giotto Tom Henzinger Christoph Kirsch Slobodan Matic.
Chess Review May 10, 2004 Berkeley, CA Distributed Schedule-Carrying Code Tom Henzinger Slobodan Matic.
1 Formal Models for Distributed Negotiations Workflows, BizTalk and ZSN Roberto Bruni Dipartimento di Informatica Università di Pisa XVII Escuela de Ciencias.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Efficient Simulation Model for Hybrid Bond Graphs Christopher Beers ISIS, Vanderbilt.
Mixing Models of Computation Jie Liu Palo Alto Research Center (PARC) 3333 Coyote Hill Rd., Palo Alto, CA joint work with Prof. Edward.
Chess Review May 10, 2004 Berkeley, CA Platform-based Design for Mixed Analog-Digital Designs Fernando De Bernardinis, Yanmei Li, Alberto Sangiovanni-Vincentelli.
Interactive Query Processing in Scientific Applications David Liu UC Berkeley Computer Science Division.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Causality Interfaces and Compositional Causality Analysis Rachel Zhou UC Berkeley.
Hierarchical Reconfiguration of Dataflow Graphs Stephen Neuendorffer UC Berkeley Poster Preview May 10, 2004.
Giotto A Time-Triggered Language for Embedded Programming Thomas A. Henzinger, Benjamin Horowitz Christoph M. Kirsch, Rupak Majumdar UC Berkeley.
Ptolemy Miniconference May 9, 2003 Berkeley, CA Ptolemy Project Plans for the Future Edward A. Lee Professor Ptolemy Project Director.
NSF Foundations of Hybrid and Embedded Software Systems UC Berkeley: Chess Vanderbilt University: ISIS University of Memphis: MSI Hybrid Systems: From.
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.
Job Scheduling Lecture 19: March 19. Job Scheduling: Unrelated Multiple Machines There are n jobs, each job has: a processing time p(i,j) (the time to.
Department of Electrical Engineering and Computer Sciences University of California at Berkeley Concurrent Component Patterns, Models of Computation, and.
MoBIES Working group meeting, September 2001, Dearborn Ptolemy II The automotive challenge problems version 4.1 Johan Eker Edward Lee with thanks.
7th Biennial Ptolemy Miniconference Berkeley, CA February 13, 2007 PTIDES: A Programming Model for Time- Synchronized Distributed Real-time Systems Yang.
Chess Review May 11, 2005 Berkeley, CA Formal Semantics of Metamodeling Frameworks Ethan Jackson ISIS, Vanderbilt University Semantic Anchoring Infrastructure.
Designing Predictable and Robust Systems Tom Henzinger UC Berkeley and EPFL.
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Identity Management in Sensor Networks Hamsa Balakrishnan Stanford University.
1 Formal Models for Transactions: BizTalk as ZSN Roberto Bruni Dipartimento di Informatica Università di Pisa Models and Languages for Coordination and.
MOBIES Project Progress Report Engine Throttle Controller Design Using Multiple Models of Computation Edward Lee Haiyang Zheng with thanks to Ptolemy Group.
Chess Review May 11, 2005 Berkeley, CA Platform Modeling and Analysis Presented by Tivadar Szemethy ISIS, Vanderbilt University.
Composing Dataflow Analyses and Transformations Sorin Lerner (University of Washington) David Grove (IBM T.J. Watson) Craig Chambers (University of Washington)
Chess Review May 10, 2004 Berkeley, CA Fault Tolerant Design of Distributed Automotive Systems Claudio Pinello Prof. Sangiovanni-Vincentelli,
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Coupled Interface Modules for Heterogeneous Composition Ethan Jackson ISIS, Vanderbilt.
1 Correct and efficient implementations of synchronous models on asynchronous execution platforms Stavros Tripakis UC Berkeley and Verimag EC^2 Workshop,
A sequence is geometric if the ratios of consecutive terms are the same. That means if each term is found by multiplying the preceding term by the same.
Giotto A tool-supported design methodology for developing hard real-time applications Cyber Physical Systems Lab Ramtin Raji Kermani.
Aravind Venkataraman. Topics of Discussion Real-time Computing Synchronous Programming Languages Real-time Operating Systems Real-time System Types Real-time.
The 14 th IEEE Real-Time and Embedded Technology and Applications Symposium, April 2008 Real-Time Distributed Discrete-Event Execution with Fault Tolerance.
EUROPE Nov 27 –Dec 10 November 27 - Dec 10.
Real-Time Scheduling II: Compositional Scheduling Framework Insik Shin Dept. of Computer Science KAIST.
Incremental Checkpointing with Application to Distributed Discrete Event Simulation Thomas Huining Feng and Edward A. Lee {tfeng,
Defining Networking Services for a Network Architecture supporting Media-oriented Service Composition Namgon Kim Networked Media Lab.
VEST Tool Base Libraries SW OS Middleware Aspects Domain Code HW Infrastructures Product Library Composition Dependency Checks Analysis Configuration Tool.
B ERKELEY P AR L AB Lithe Composing Parallel Software Efficiently PLDI  June 09, 2010 Heidi Pan, Benjamin Hindman, Krste Asanovic  {benh,
Tools and Libraries for Manycore Computing Kathy Yelick U.C. Berkeley and LBNL.
Embedded Control System Development with Giotto Thomas A. Henzinger, Benjamin Horowitz, Christoph Meyer Kirsch UC Berkeley.
Shanna-Shaye Forbes Ben Lickly Man-Kit Leung
Concurrent Models of Computation
Interoperability with Existing PS-PS Instances
10:00.
ICS 252 Introduction to Computer Design
Daniel Alvarez BMW Research, New Technologies, Innovations
Distance – Time Graphs Time is usually the independent variable (plotted on the x-axis) Distance is usually the dependent variable (plotted on the y-axis)
8.5 Using Recursive Rules with Sequences
Line Graphs.
Research Issues in Middleware (Bhaskar)
Presentation transcript:

Chess Review November 21, 2005 Berkeley, CA Edited and presented by Trading Latency for Composability Slobodan Matic UC Berkeley

Chess Review, Nov. 21, 2005"Trading Latency for Composability", S. Matic2 Simulink vs Giotto Semantics RTW (Simulink) fast to slow connection LET (Giotto) every connection Sequence of n tasks RTW latency up to n times smaller

Chess Review, Nov. 21, 2005"Trading Latency for Composability", S. Matic3 Composable Real-time Systems Real-time assurance + Flexibility –hierarchical scheduling frameworks Independent task group abstraction –periodic resource model (P,C) guarantees C units in every P units Task precedence graphs –intragroup, intergroup, distributed precedence

Chess Review, Nov. 21, 2005"Trading Latency for Composability", S. Matic4 Intragroup Abstraction Task precedence within group, single resource Function c S tightly abstracts G if c S (P) is smallest C s.t. G is schedulable with S under (P,C) –smaller c S ! tighter abstraction ! better composability  For each G and P c RTW (P) ¸ c LET (P) P cScS c LET c RTW

Chess Review, Nov. 21, 2005"Trading Latency for Composability", S. Matic5 Distributed / Intergroup Abstraction Distributed task graph over m resources  There exist G and P c RTW (P) – c LET (P) ¸ (m-1)P Task precedence between groups –hierarchical task graph  LET compositional (c j ! c) RTW not compositional