Essential Issues in Codesign: Models

Slides:



Advertisements
Similar presentations
The Quest for Correctness Joseph Sifakis VERIMAG Laboratory 2nd Sogeti Testing Academy April 29th 2009.
Advertisements

Embedded System, A Brief Introduction
Chapter #8: Finite State Machine Design 8
Introduction to Sequential Circuits
ECOE 560 Design Methodologies and Tools for Software/Hardware Systems Spring 2004 Serdar Taşıran.
2-Hardware Design of Embedded Processors (cont.) Advanced Approaches.
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
SpecC and SpecCharts Reviewed and Presented by Heemin Park and Eric Kwan EE202A - Fall 2001 Professor Mani Srivastava.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
CSC 402 Requirements Engineering 1 Requirements Techniques, cont. Formal requirements analysis techniques include: – DFD (covered) – ERD (covered) – Finite.
Dr. Turki F. Al-Somani VHDL synthesis and simulation – Part 3 Microcomputer Systems Design (Embedded Systems)
Models of Computation for Embedded System Design Alvise Bonivento.
Requirements Techniques, cont. Brief review Formal Requirements Techniques –Finite State Machines –Petri Nets.
Winter-Spring 2001Codesign of Embedded Systems1 Introduction to HW/SW Co-Synthesis Algorithms Part of HW/SW Codesign of Embedded Systems Course (CE )
Winter-Spring 2001Codesign of Embedded Systems1 Introduction to HW/SW Codesign Part of HW/SW Codesign of Embedded Systems Course (CE )
Mahapatra-Texas A&M-Fall'001 Codesign Framework Parts of this lecture are borrowed from lectures of Johan Lilius of TUCS and ASV/LL of UC Berkeley available.
Real-Time System Requirements & Design Specs Shaw - Chapters 3 & 4 Homework #2: 3.3.1, 3.4.1, Add Error states to Fig 4.1 Lecture 4/17.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
02/06/05 “Investigating a Finite–State Machine Notation for Discrete–Event Systems” Nikolay Stoimenov.
Chapter 10 State Machine Diagrams
Computer Architecture Computational Models Ola Flygt V ä xj ö University
1 5-High-Performance Embedded Systems using Concurrent Process (cont.)
Extreme Makeover for EDA Industry
1 2-Hardware Design Basics of Embedded Processors (cont.)
Chapter 11: System Design Methodology Digital System Designs and Practices Using Verilog HDL and 2008, John Wiley11-1 Ders 8: FSM Gerçekleme ve.
Ch. 2. Specification and Modeling 2.1 Requirements Describe requirements and approaches for specifying and modeling embedded systems. Specification for.
Procedures for managing workflow components Workflow components: A workflow can usually be described using formal or informal flow diagramming techniques,
VHDL Discussion Finite State Machines
States.
Finite State Machines (FSM) OR Finite State Automation (FSA) - are models of the behaviors of a system or a complex object, with a limited number of defined.
Design & Co-design of Embedded Systems Sharif University of Technology Computer Engineering Dept. Fall-Winter 2005 Maziar Goudarzi.
What’s Ahead for Embedded Software? (Wed) Gilsoo Kim
Multiplexers Section Topics Multiplexers – Definition – Examples – Verilog Modeling.
Chapter 11: System Design Methodology Digital System Designs and Practices Using Verilog HDL and 2008, John Wiley11-1 Chapter 11: System Design.
Winter-Spring 2001Codesign of Embedded Systems1 Essential Issues in Codesign: Architectures Part of HW/SW Codesign of Embedded Systems Course (CE )
Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.
1 5-High-Performance Embedded Systems using Concurrent Process (cont.)
Winter-Spring 2001Codesign of Embedded Systems1 Essential Issues in Codesign: Models Part of HW/SW Codesign of Embedded Systems Course (CE )
George Mason University Finite State Machines Refresher ECE 545 Lecture 11.
Finite State Machines (part 1)
Requirements Techniques, cont.
Register Transfer Specification And Design
Introduction Introduction to VHDL Entities Signals Data & Scalar Types
System Design and Modeling
2-Hardware Design of Embedded Processors (cont.)
Graph Coverage for Specifications CS 4501 / 6501 Software Testing
CPRE 583 Reconfigurable Computing
ECE 448 Lecture 6 Finite State Machines State Diagrams vs. Algorithmic State Machine (ASM) Charts.
IP – Based Design Methodology
Introduction to cosynthesis Rabi Mahapatra CSCE617
Course supervisor: Lubna Siddiqui
States.
T Computer Architecture, Autumn 2005
CSE 370 – Winter Sequential Logic-2 - 1
VHDL Discussion Subprograms
Modeling Languages and Abstract Models
Graph Coverage for Specifications CS 4501 / 6501 Software Testing
Dynamic Modeling Lecture # 37.
States.
VHDL Discussion Subprograms
Finite State Machines (part 1)
Applying Use Cases (Chapters 25,26)
Lecture 20 Logistics Last lecture Today HW6 due Wednesday
Dr. Tassadaq Hussain Introduction to Verilog – Part-4 Expressing FSM in Verilog (contd) and FSM State Encoding Dr. Tassadaq Hussain.
EGR 2131 Unit 12 Synchronous Sequential Circuits
Digital Designs – What does it take
L25 – Final Review AU 15 Final Exam – Classroom – Journalism 300
STATE MACHINE AND CONCURRENT PROCESS MODEL
STATE MACHINE AND CONCURRENT
WRITING AN ALGORITHM, PSEUDOCODE, AND FLOWCHART LESSON 2.
Presentation transcript:

Essential Issues in Codesign: Models Part of HW/SW Codesign of Embedded Systems Course (CE 40-226) Winter-Spring 2001 Codesign of Embedded Systems

Codesign of Embedded Systems Today programme Essential issues in codesign Models Architectures Languages Winter-Spring 2001 Codesign of Embedded Systems

Codesign of Embedded Systems Models Model should be Formal => avoid ambiguity Complete => can describe entire system Comprehensible and easy-to-modify Model vs. Language We use a model to decompose a system into pieces (Model implies a way of thinking) We generate a specification by describing these pieces in a particular language (Language is a tool for description) Winter-Spring 2001 Codesign of Embedded Systems

Models: Finite-State Machines (FSM) A set of states and a set of transitions between them Most popular model for control systems Formal definition <S,I,O,f,h> Depending on output function (h) Mealy machine / Moore machine Winter-Spring 2001 Codesign of Embedded Systems

Models: Dataflow Graph (DFG) Most popular model for computation-intensive systems Its basic principles Asynchrony: all operations execute when and only when all its operands are available Functionality: operations are functions with no side-effects => execution order is not important Formal definition <N,A,V,v0,f> Winter-Spring 2001 Codesign of Embedded Systems

Models: FSM with Datapath (FSMD) Both control and computation are required in most systems FSMD is a combination of FSM and DFG models Formal definition <S,I,O,f,h> f = {fC,fD} h= {hC,hD} Winter-Spring 2001 Codesign of Embedded Systems

Models: FSM with Datapath (cont’d) Neither FSM nor FSMD are suitable for complex systems Concurrency Explosion in states Hierarchy Explosion in arcs Winter-Spring 2001 Codesign of Embedded Systems

Models: Hierarchical Concurrent FSMs Extension of FSM, supporting concurrency and hierarchy Like FSM: sets of states and transitions Unlike FSM: each state can consist of concurrent substates Transitions can be structured or unstructured An example language: Statecharts Winter-Spring 2001 Codesign of Embedded Systems

Models: Programming Languages Heterogeneous model support data, and control modeling Major PL types Imperative (C, Pascal) Control-driven model of execution Declarative Demand-driven / Pattern-driven model of execution Winter-Spring 2001 Codesign of Embedded Systems

Models: Programming Lang. (cont’d) Declarative languages No explicit order of execution Focus on defining target of the computation through a set of functions of logic rules Imperative Languages Variety of data-structures Support hierarchy (functions of procedures) Support control-flow Well-suited for modeling an algorithm Winter-Spring 2001 Codesign of Embedded Systems

Models: Programming Lang. (cont’d) Main disadvantage Do not explicitly model system states Winter-Spring 2001 Codesign of Embedded Systems

Models: Program-State Machines Combination of HCFSM with PL Consists of a hierarchy of Program-states Program-states Leaf / composite program-states Composite program-state concurrent / sequential program-substates Sequential program-substates Transition-on-Completion (TOC) arc / Transition-immediately (TI) arc Winter-Spring 2001 Codesign of Embedded Systems

Codesign of Embedded Systems What we learned today We use Models to decompose systems into pieces, then use Languages to generate a specification of those pieces. FSM, DFG, FSMD, HCFSM, PL, PSM, ... Winter-Spring 2001 Codesign of Embedded Systems

Complementary notes: Extra classes “Compiler Design Short Course” by Gh. Jaberi-Pur Date-Time: Thursday, Esfand 18th, 9-12 o’clock Place: “HW Synthesis Techniques Seminar” by S. Safari Date-Time: Saturday, Esfand 20th, 13-14:30 Place “HW design using RenoirTM workshop” by A. Ganjei Date-Time: Winter-Spring 2001 Codesign of Embedded Systems

Complementary notes (cont’d) Assignment 1.c becomes optional Course webpage is ready Subscribe to course mailing list Send an email from your desired email address to majordomo@ce.sharif.edu containing: subscribe ce226list Project Choose and announce your partner for the final project Winter-Spring 2001 Codesign of Embedded Systems