Kahn Process Networks and a Reactive Extension - Lorentz Center

More documents

Recommendations

Info

42 Every SDF is a KPN The repeated firing of an actor can be captured as a recursive function that is continuous challenges models kpn rpn the hierarchy the future RPN DDF KPN SADF BDF CSDF SDF HSDF
43 i ii iii iv v vi vii Simple scheduling analysis Example: pipeline with feedbacks a 4 i 4 b 4 ii 2 c 2 iii 2 d 2 v 2 e 2 vii 1 f 2 1 iv 1 vi 1 topology matrix (consumption per actor per channel) a b c d e f -4 0 0 0 0 0 0 4 -4 0 0 0 2 0 0 2 -2 0 0 0 0 0 0 2 -1 -2 0 0 0 0 0 0 2 -1 -2 challenges models kpn rpn the hierarchy the future 0 0 0 0 0 0 1 1 1 2 2 2 4 a b c d e f = 0 0 0 0 0 0 0 i ii iii iv v vi vii firing rates are consistent iff repetition vector exists minimal (non-zero) number of actor firings that has no net effect on the initial token distribution repetition vector can be computed by solving the so-called balance equations
Page 1 and 2: Kahn Process Networks and a Reactiv
Page 3 and 4: 3 The problem: an example • Use-c
Page 5 and 6: 5 Objectives • Reliable, resource
Page 7 and 8: 7 Objectives • Reliable, resource
Page 9 and 10: 9 Scientific challenges • Reliabl
Page 11 and 12: 11 Computational models
Page 13 and 14: 13 A gaming example scene graph & p
Page 15 and 16: 15 Essential challenges predictabil
Page 17 and 18: 17 Dataflow expressiveness hierarch
Page 19 and 20: 19 Kahn Process Networks processes
Page 21 and 22: 21 Denotational semantics processes
Page 23 and 24: 23 Computing the function of a netw
Page 25 and 26: 25 U i Kleene iteration U 0 = ε U
Page 27 and 28: 27 U i Kleene iteration U 0 = ε U
Page 29 and 30: 29 Strengths & weaknesses • compo
Page 31 and 32: 31 Operational semantics operationa
Page 33 and 34: 33 The Kahn Principle “ But hey,
Page 35 and 36: 35 A run-time environment (RTE) req
Page 37 and 38: 37 Dataflow function in a KPN actor
Page 39 and 40: 39 Dataflow function in a KPN 22 34
Page 41: 41 Synchronous DataFlow: actor firi
Page 45 and 46: 45 i ii iii iv v vi vii Simple sche
Page 47 and 48: 47 Reactive Process Networks [M.C.W
Page 49 and 50: 49 A gaming example challenges mode
Page 51 and 52: 51 Reactive Process Networks challe
Page 53 and 54: 53 Operational semantics challenges
Page 55 and 56: 55 1.5 Prototype implementation •
Page 57 and 58: 57 An analyzable subclass of RPN Sc
Page 59 and 60: 59 Scenario-Aware DataFlow (SADF) H
Page 61 and 62: 61 Scenario-aware performance analy
Page 63 and 64: 63 The dataflow hierarchy
Page 65 and 66: 65 Dataflow expressiveness hierarch
Page 67 and 68: 67 SDF 2 ‘equivalent’ HSDF tran
Page 69 and 70: 69 Boolean DataFlow (BDF [Buck 1993
Page 71 and 72: 71 Looking Forward
Page 73 and 74: 73 SDF3 toolkit challenges models k
Page 75: 75 Thank you ! Questions ? More inf

Kahn Process Networks and a Reactive Extension - Lorentz Center

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?