1 / 5

Trading Latency for Composability

Trading Latency for Composability. Slobodan Matic UC Berkeley. 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. Composable Real-time Systems. Real-time assurance + Flexibility

kimball
Download Presentation

Trading Latency for Composability

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Trading Latency for Composability Slobodan Matic UC Berkeley

  2. 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 "Trading Latency for Composability", S. Matic

  3. 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 "Trading Latency for Composability", S. Matic

  4. Intragroup Abstraction • Task precedence within group, single resource • Function cS tightly abstracts G if cS(P) is smallest C s.t. G is schedulable with S under (P,C) • smaller cS! tighter abstraction ! better composability • For each G and P cRTW(P) ¸ cLET(P) cRTW cS cLET P "Trading Latency for Composability", S. Matic

  5. Distributed / Intergroup Abstraction • Distributed task graph over m resources • There exist G and P cRTW(P) – cLET(P) ¸ (m-1)P • Task precedence between groups • hierarchical task graph • LET compositional (cj ! c) • RTW not compositional "Trading Latency for Composability", S. Matic

More Related