DOC PREVIEW
Berkeley ELENG C249A - Lecture Notes

This preview shows page 1-2-3-4-5-6-44-45-46-47-48-49-50-89-90-91-92-93-94 out of 94 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 94 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

OutlineDiscrete EventSimultaneous Events in DESlide 4Co-Design Finite State Machines: Combining FSM and Discrete EventCodesign Finite State MachineSynchrony: Basic OperationSynchrony: Basic Operation (2)Synchrony: Triggering and OrderingSynchrony: System SolutionSynchrony: Implementation CostPure Asynchrony: Basic OperationAsynchrony: Triggering and OrderingAsynchrony: System SolutionAsynchrony: Implementation CostAsynchrony vs. Synchrony in System DesignCombining Synchrony and AsynchronyCFSM OverviewCFSM Overview (2)Network of CFSMs: Depth-1 BuffersIntroducing a CFSMCFSM Rules: phasesSlide 23Communication PrimitivesCommunication Primitives (2)Signals and CFSMCFSM networksScheduling MechanismTiming BehaviorTiming Behavior: Mathematical ModelTiming Behavior: Transition PointEvent/Data SeparationAtomicityNon Atomic Data Value ReadingAtomicity of Event ReadingFunctional BehaviorFunctional Behavior (2)CFSM and Process NetworksCFSM NetworksBuffer OverwriteExample of CFSM BehaviorsEquivalent Classes of CFSM BehaviorEquivalent Classes of CFSM Behavior (2)Equivalent Classes of CFSM Behavior (3)Equivalent Classes of CFSM Behavior (4)Some Possibility of Equivalent ClassesConclusionSlide 48Data-flow networksSlide 50A bit of historyData-flow networkIntuitive semanticsSlide 54Slide 55Slide 56Slide 57Slide 58Slide 59Slide 60Slide 61Slide 62Slide 63Slide 64QuestionsFormal semantics: sequencesOrdering of sequencesChains of sequences(Least) Upper BoundComplete Partial OrderProcessesContinuity and MonotonicityLeast Fixed Point semanticsFrom Kahn networks to Data Flow networksExamples of Data Flow actorsStatic scheduling of DFStatic scheduling of SDFBalance equationsSlide 79Slide 80Slide 81Static SDF schedulingAdmissibility of schedulesSlide 84From repetition vector to scheduleFrom schedule to implementationCompilation optimizationCode size minimizationBuffer size minimizationDynamic scheduling of DFExample of Boolean DFExample of general DFSummary of DF networksSlide 941OutlineOutlinePart 3: Models of ComputationPart 3: Models of ComputationFSMsFSMsDiscrete Event SystemsDiscrete Event Systems CFSMsCFSMsData Flow ModelsData Flow ModelsPetri Nets Petri Nets The Tagged Signal ModelThe Tagged Signal Model2Discrete EventDiscrete EventExplicit notion of time (global order…)Explicit notion of time (global order…)Events can happen at any time asynchronouslyEvents can happen at any time asynchronouslyAs soon as an input appears at a block, it may be executedAs soon as an input appears at a block, it may be executedThe execution may take non zero time, the output is marked with a The execution may take non zero time, the output is marked with a time that is the sum of the arrival time plus the execution timetime that is the sum of the arrival time plus the execution timeTime determines the order with which events are processedTime determines the order with which events are processedDE simulator maintains a global event queue (Verilog and VHDL)DE simulator maintains a global event queue (Verilog and VHDL)DrawbacksDrawbacksglobal event queue => tight coordination between partsglobal event queue => tight coordination between partsSimultaneous events => non-deterministic behaviorSimultaneous events => non-deterministic behaviorSome simulators use delta delay to prevent non-determinacySome simulators use delta delay to prevent non-determinacy3Simultaneous Events in DE Simultaneous Events in DE AABBCCttttFire B or C?Fire B or C?AABBCCttAABBCCttttB has 0 delayB has 0 delayB has delta delayB has delta delayFire C once? or twice?Fire C once? or twice?t+t+Fire C twice.Fire C twice.Still have problem with 0-delay Still have problem with 0-delay (causality) loop(causality) loopCan be refinedCan be refinedE.g. introduce timing constraintsE.g. introduce timing constraints(minimum reaction time 0.1 s)(minimum reaction time 0.1 s)4OutlineOutlinePart 3: Models of ComputationPart 3: Models of ComputationFSMsFSMsDiscrete Event Systems Discrete Event Systems CFSMsCFSMsData Flow ModelsData Flow ModelsPetri Nets Petri Nets The Tagged Signal ModelThe Tagged Signal Model5Co-Design Finite State Machines:Co-Design Finite State Machines:Combining FSM and Discrete EventCombining FSM and Discrete EventSynchrony and asynchronySynchrony and asynchronyCFSM definitionsCFSM definitionsSignals & networksSignals & networksTiming behaviorTiming behaviorFunctional behaviorFunctional behaviorCFSM & process networksCFSM & process networksExample of CFSM behaviorsExample of CFSM behaviorsEquivalent classesEquivalent classes6Codesign Finite State MachineCodesign Finite State MachineUnderlying MOC of Polis and VCCUnderlying MOC of Polis and VCCCombine aspects from several other MOCsCombine aspects from several other MOCsPreserve formality and efficiency in implementationPreserve formality and efficiency in implementationMix Mix synchronicitysynchronicityzero and infinite timezero and infinite timeasynchronicityasynchronicitynon-zero, finite, and bounded timenon-zero, finite, and bounded timeEmbedded systems often contain both aspectsEmbedded systems often contain both aspects7Synchrony: Basic OperationSynchrony: Basic OperationSynchrony is often implemented with clocksSynchrony is often implemented with clocksAt clock ticksAt clock ticksModule reads inputs, computes, and produce outputModule reads inputs, computes, and produce outputAll synchronous events happen simultaneouslyAll synchronous events happen simultaneouslyZero-delay computationsZero-delay computationsBetween clock ticksBetween clock ticksInfinite amount of time passedInfinite amount of time passed8Synchrony: Basic Operation (2)Synchrony: Basic Operation (2)Practical implementation of synchronyPractical implementation of synchronyImpossible to get zero or infinite delayImpossible to get zero or infinite delayRequire: computation time <<< clock periodRequire: computation time <<< clock periodComputation time = 0, w.r.t. reaction time of environmentComputation time = 0, w.r.t. reaction time of environmentFeature of synchronyFeature of synchronyFunctional behavior independent of timingFunctional behavior independent of timingSimplify verificationSimplify verificationCyclic dependencies may cause problemCyclic dependencies may cause problemAmong (simultaneous) synchronous eventsAmong (simultaneous) synchronous


View Full Document

Berkeley ELENG C249A - Lecture Notes

Documents in this Course
Load more
Download Lecture Notes
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Lecture Notes and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture Notes 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?