redundancy free residual dispatch
play

Redundancy-free Residual Dispatch Using Ordered Binary Decision - PowerPoint PPT Presentation

Sep 18, 2022 •18 likes •408 views

Formula-based Dispatch BDD-based Dispatch Assessment Redundancy-free Residual Dispatch Using Ordered Binary Decision Diagrams for Efficient Dispatch Andreas Sewe Christoph Bockisch Mira Mezini Seventh International Workshop on Foundations

  1. Formula-based Dispatch BDD-based Dispatch Assessment Redundancy-free Residual Dispatch Using Ordered Binary Decision Diagrams for Efficient Dispatch Andreas Sewe Christoph Bockisch Mira Mezini Seventh International Workshop on Foundations of Aspect-Oriented Languages, 2008

  2. Formula-based Dispatch BDD-based Dispatch Assessment Example Aspect aspect SecurityMonitoring { before (): call ( void Connection.transmit(Text)) && (( target (LocalConnection) && args (PlainText) && ! cflow ( call ( void Log.debug()))) || (! target (LocalConnection) && args (PlainText))) { throw new PolicyViolation("Cipher text required."); } }

  3. Formula-based Dispatch BDD-based Dispatch Assessment Example Pointcut call ( void Connection.transmit(Text)) && (( target (LocalConnection) && args (PlainText) && ! cflow ( call ( void Log.debug()))) || (! target (LocalConnection) && args (PlainText))) . . . Connection connection = new RemoteConnection("www.st.informatik.tu − darmstadt.de"); Text text = new PlainText("Encrypt me!"); connection.transmit(text); . . .

  4. Formula-based Dispatch BDD-based Dispatch Assessment Example Pointcut call ( void Connection.transmit(Text)) && (( target (LocalConnection) && args (PlainText) && ! cflow ( call ( void Log.debug()))) || (! target (LocalConnection) && args (PlainText))) . . . Connection connection = new RemoteConnection("www.st.informatik.tu − darmstadt.de"); Text text = new PlainText("Encrypt me!"); connection.transmit(text); . . .

  5. Formula-based Dispatch BDD-based Dispatch Assessment Example Pointcut call ( void Connection.transmit(Text)) && (( target (LocalConnection) && args (PlainText) && ! cflow ( call ( void Log.debug()))) || (! target (LocalConnection) && args (PlainText))) target (LocalConnection)

  6. Formula-based Dispatch BDD-based Dispatch Assessment Example Pointcut call ( void Connection.transmit(Text)) && (( target (LocalConnection) && args (PlainText) && ! cflow ( call ( void Log.debug()))) || (! target (LocalConnection) && args (PlainText))) target (LocalConnection) ! target (LocalConnection)

  7. Formula-based Dispatch BDD-based Dispatch Assessment Example Pointcut call ( void Connection.transmit(Text)) && (( target (LocalConnection) && args (PlainText) && ! cflow ( call ( void Log.debug()))) || (! target (LocalConnection) && args (PlainText))) target (LocalConnection) args (PlainText) ! target (LocalConnection)

  8. Formula-based Dispatch BDD-based Dispatch Assessment Example Pointcut call ( void Connection.transmit(Text)) && (( target (LocalConnection) && args (PlainText) && ! cflow ( call ( void Log.debug()))) || (! target (LocalConnection) && args (PlainText))) before (); connection.transmit(text); target (LocalConnection) args (PlainText) ! target (LocalConnection)

  9. Formula-based Dispatch BDD-based Dispatch Assessment From Pointcuts to Formulas Example Pointcut call ( void Connection.transmit(Text)) && (( target (LocalConnection) && args (PlainText) && ! cflow ( call ( void Log.debug()))) || (! target (LocalConnection) && args (PlainText)))

  10. Formula-based Dispatch BDD-based Dispatch Assessment From Pointcuts to Formulas Example Pointcut call ( void Connection.transmit(Text)) && (( target (LocalConnection) && args (PlainText) && ! cflow ( call ( void Log.debug()))) || (! target (LocalConnection) && args (PlainText)))

  11. Formula-based Dispatch BDD-based Dispatch Assessment From Pointcuts to Formulas Example Pointcut call ( void Connection.transmit(Text)) && (( target (LocalConnection) && args (PlainText) && ! cflow ( call ( void Log.debug()))) || (! target (LocalConnection) && args (PlainText))) Example Formula φ = ( x 1 ∧ x 2 ∧ x 3 ) ∨ ( x 1 ∧ x 2 )

  12. Formula-based Dispatch BDD-based Dispatch Assessment From Formulas to Strategies Example Formula φ = ( x 1 ∧ x 2 ∧ x 3 ) ∨ ( x 1 ∧ x 2 ) ∨ ∧ ∧ x 1 x 2 x 3 x 1 x 2

  13. Formula-based Dispatch BDD-based Dispatch Assessment From Formulas to Strategies Example Formula φ = ( x 1 ∧ x 2 ∧ x 3 ) ∨ ( x 1 ∧ x 2 ) ∨ ∧ ∧ x 1 x 2 x 3 x 1 x 2 ⊤ ⊥

  14. Formula-based Dispatch BDD-based Dispatch Assessment From Formulas to Strategies Example Formula φ = ( x 1 ∧ x 2 ∧ x 3 ) ∨ ( x 1 ∧ x 2 ) x 1 x 2 x 3 x 1 x 2 ⊤ ⊥

  15. Formula-based Dispatch BDD-based Dispatch Assessment Partial Redundancy Elimination x 1 x 2 x 3 x 1 x 1 x 2 ⊤ ⊥

  16. Formula-based Dispatch BDD-based Dispatch Assessment Partial Redundancy Elimination x 1 x 2 x 3 x 1 x 1 x 2 ⊤ ⊥

  17. Formula-based Dispatch BDD-based Dispatch Assessment Partial Redundancy Elimination x 1 x 2 x 3 x 1 x 1 x 2 ⊤ ⊥

  18. Formula-based Dispatch BDD-based Dispatch Assessment Partial Redundancy Elimination x 1 x 2 x 3 x 1 x 1 x 2 ⊤ ⊥ Formulas may prevent complete redundancy elimination.

  19. Formula-based Dispatch BDD-based Dispatch Assessment Dispatch Functions Residual dispatch at a join point shadow can be viewed as the evaluation of a Boolean function. f φ : { 0 , 1 } n → { 0 , 1 } Whether the advice is applicable depends on the n atomic pointcuts x 1 , . . . , x n occurring in the residue φ .

  20. Formula-based Dispatch BDD-based Dispatch Assessment Two Assumptions on Advice Dispatch Evaluation is side-effect free. 1 Binding of parameters is not a side-effect. 2

  21. Formula-based Dispatch BDD-based Dispatch Assessment From Formulas to BDDs to Strategies Example Formula φ = ( x 1 ∧ x 2 ∧ x 3 ) ∨ ( x 1 ∧ x 2 ) x 2 1 x 1 x 2 x 3 0

  22. Formula-based Dispatch BDD-based Dispatch Assessment Full Redundancy Elimination x 2 1 x 1 x 2 x 3 0 Reduced ordered binary decision diagrams offer complete redundancy elimination.

  23. Formula-based Dispatch BDD-based Dispatch Assessment f φ 1 ( x ) 1 Example advice 1 ; 0 before () : joinPointShadow && φ 1 { advice 1 ; } f φ 2 ( x ) before () : joinPointShadow 1 && φ 2 { advice 2 ; } advice 2 ; 0 joinPointShadow;

  24. Formula-based Dispatch BDD-based Dispatch Assessment Extended Dispatch Functions Residual dispatch at a shared shadow can be viewed as the evaluation of an extended Boolean function. f Φ : { 0 , 1 } n → { 0 , 1 } m Which combination of the m advice is applicable depends on the n atomic pointcuts jointly occurring in the residues φ 1 , . . . , φ m .

  25. Formula-based Dispatch BDD-based Dispatch Assessment Three Assumptions on Advice Dispatch Evaluation is side-effect free. 1 Binding of parameters is not a side-effect. 2 Execution of an advice does not affect evaluation. 3

  26. Formula-based Dispatch BDD-based Dispatch Assessment f { φ 1 ,φ 2 } 00 joinPointShadow; Example 10 advice 1 ; before () : joinPointShadow 01 joinPointShadow; && φ 1 { advice 1 ; } before () : joinPointShadow advice 2 ; && φ 2 { advice 2 ; } 11 joinPointShadow; advice 1 ; advice 2 ; joinPointShadow;

  27. Formula-based Dispatch BDD-based Dispatch Assessment Example Formulas φ 1 = ( x 1 ∧ x 2 ∧ x 3 ) ∨ ( x 1 ∧ x 2 ) φ 2 = x 2 ∧ x 4 x 2 1 x 1 x 2 x 3 0 x 4 1 x 2 0

  28. Formula-based Dispatch BDD-based Dispatch Assessment Example Formulas φ 1 = ( x 1 ∧ x 2 ∧ x 3 ) ∨ ( x 1 ∧ x 2 ) φ 2 = x 2 ∧ x 4 x 2 10 x 1 x 2 x 3 00 x 4 01 x 2 00

  29. Formula-based Dispatch BDD-based Dispatch Assessment Example Formulas φ 1 = ( x 1 ∧ x 2 ∧ x 3 ) ∨ ( x 1 ∧ x 2 ) φ 2 = x 2 ∧ x 4 x 3 00 x 2 x 1 x 4 01 x 2 10

  30. Formula-based Dispatch BDD-based Dispatch Assessment Experimental Setup Formulas of signature � x 1 , . . . , x 5 � ∨ At most 6 propositional operators ( ∧ , ∨ , ¬ ) Non-trivial, i.e., not ∧ ∧ equivalent to ⊥ or ⊤ Simple, i.e., the laws of x 1 x 2 x 2 x 3 x 1 idempotence or boundedness are not applicable

  31. Formula-based Dispatch BDD-based Dispatch Assessment Experimental Setup (cont’d) Evaluation Cost x 2 1 x 1 args target cflow x 2 x 3 0 Compared by average evaluation cost BDDs � x 1 , . . . , x 5 � -ordered

  32. Formula-based Dispatch BDD-based Dispatch Assessment Experimental Setup (cont’d) Evaluation Cost x 2 1 x 1 x 1 x 2 x 3 x 4 x 5 x 2 x 3 0 Compared by average evaluation cost BDDs � x 1 , . . . , x 5 � -ordered

  33. Formula-based Dispatch BDD-based Dispatch Assessment Results Formulas better Ordered BDDs better Average Evaluation Cost (Ordered BDD) Average Evaluation Cost (Formula)

  34. Formula-based Dispatch BDD-based Dispatch Assessment Results Formulas better Ordered BDDs better > 0 . 5 % of formulas > 0 . 05 % of formulas > 0 . 005 % of formulas > 0 . 0005 % of formulas Average Evaluation Cost (Ordered BDD) BDD-based dispatch functions outperform formula-based ones 80% of the time. (Further 7.7% are tied.) Average Evaluation Cost (Formula)

  35. Formula-based Dispatch BDD-based Dispatch Assessment Conclusion Extended dispatch functions are a useful concept. BDD-based dispatch functions offer complete redundancy elimination. They clearly outperform formula-based dispatch functions.

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Pipeline Strategies and conversations behind securing a Residual Bequest Agenda 1. Why Residual?

Pipeline Strategies and conversations behind securing a Residual Bequest Agenda 1. Why Residual?

The Perpetual Pipeline Strategies and conversations behind securing a Residual Bequest Agenda 1. Why Residual? 2. Structured for Residual 3. Residual Results 4. Residual Strategy 5. Residual Relationships 6. Residual Data 7.

1.17k views • 43 slides
There's More Than One Way To Dispatch It

There's More Than One Way To Dispatch It

There's More Than One Way To Dispatch It 2009 There's More Than One Way To Dispatch It Topological sorting of a directed acyclic graph

496 views • 36 slides
METRO WEST AMBULANCE DISPATCH CENTER Presented by Kristen Hoover & Larry Boxman DISPATCH

METRO WEST AMBULANCE DISPATCH CENTER Presented by Kristen Hoover & Larry Boxman DISPATCH

METRO WEST AMBULANCE DISPATCH CENTER Presented by Kristen Hoover & Larry Boxman DISPATCH CENTER 8 dispatch stations 2 supervisor consoles 5 call taker stations Dispatch Center Average of 1,200 phone calls in/out daily

392 views • 10 slides
Constructive decision via redundancy-free proof-search Dominique Larchey-Wendling TYPES team,

Constructive decision via redundancy-free proof-search Dominique Larchey-Wendling TYPES team,

Constructive decision via redundancy-free proof-search Dominique Larchey-Wendling TYPES team, ANR TICAMORE LORIA CNRS Nancy, France Second TICAMORE meeting Marseille, Nov. 2017 1 Constructive termination of

517 views • 19 slides
CSE 341 Programming Languages Dynamic Dispatch vs. Closures OOP vs. Functional Decomposition

CSE 341 Programming Languages Dynamic Dispatch vs. Closures OOP vs. Functional Decomposition

CSE 341 Programming Languages Dynamic Dispatch vs. Closures OOP vs. Functional Decomposition Wrapping Up Zach Tatlock Spring 2014 Dynamic dispatch Dynamic dispatch Also known as late binding or virtual methods Call self.m2() in method

935 views • 55 slides
DSM Dispatch Conditions p Dr Richard Tooth 22 November 2012 2 Introduction Proposals in

DSM Dispatch Conditions p Dr Richard Tooth 22 November 2012 2 Introduction Proposals in

DSM Dispatch Conditions p Dr Richard Tooth 22 November 2012 2 Introduction Proposals in place affecting the dispatch of DSM Most notably, shift to unlimited hours of dispatch per year Also of relevance Minimum notice

500 views • 17 slides
j i u a l The Unreasonable Effectiveness of Multiple Dispatch Stefan Karpinski Multiple

j i u a l The Unreasonable Effectiveness of Multiple Dispatch Stefan Karpinski Multiple

j i u a l The Unreasonable Effectiveness of Multiple Dispatch Stefan Karpinski Multiple Dispatch? dispatch dispatched on selection syntax degree arguments power none f(x, y) { } O(1) single x.f(y) {x} O(|X|) multiple

646 views • 30 slides
An Overview of Deep Residual Learning Semih Yagcioglu 01.03.2016 Deep Residual Learning

An Overview of Deep Residual Learning Semih Yagcioglu 01.03.2016 Deep Residual Learning

An Overview of Deep Residual Learning Semih Yagcioglu 01.03.2016 Deep Residual Learning Microsoft Research Asia (MSRA) Kaiming He, Xiangyu Zhang, Shaoqing Ren, & Jian Sun. Deep Residual Learning for Image Recognition. arXiv

1.32k views • 54 slides
Partial Redundancy Elimination CS243 Review Session Full Redundancy x = b + c y = b + c z = b

Partial Redundancy Elimination CS243 Review Session Full Redundancy x = b + c y = b + c z = b

Partial Redundancy Elimination CS243 Review Session Full Redundancy x = b + c y = b + c z = b + c Partial Redundancy x = b + c z = b + c Partial Redundancy t = b + c x = t t = b + c z = t B1 B2 B3 u = a + b B4 Original graph B5

511 views • 40 slides
T echBrief Leveraging Redundancy to Leveraging Redundancy to Build Fault-T olerant Networks

T echBrief Leveraging Redundancy to Leveraging Redundancy to Build Fault-T olerant Networks

T echBrief Leveraging Redundancy to Leveraging Redundancy to Build Fault-T olerant Networks Introduction The high demands of e-commerce and Internet applications have required networks to exhibit the same reliability as the public switched

411 views • 8 slides
There's More Than One Way To Dispatch It Jonathan Worthington Nordic Perl Workshop 2009 There's

There's More Than One Way To Dispatch It Jonathan Worthington Nordic Perl Workshop 2009 There's

There's More Than One Way To Dispatch It Jonathan Worthington Nordic Perl Workshop 2009 There's More Than One Way To Dispatch It Single Dispatch We're used to writing subroutines with a name # Perl 6 sub taking one parameter $name sub

690 views • 43 slides
Chosen-Ciphertext Security Chosen-Ciphertext Security without Redundancy without Redundancy

Chosen-Ciphertext Security Chosen-Ciphertext Security without Redundancy without Redundancy

Chosen-Ciphertext Security Chosen-Ciphertext Security without Redundancy without Redundancy Duong Hieu Phan David Pointcheval ENS France CNRS-ENS France Asiacrypt '03 Taipei - Taiwan December 1 st 2003 Summary Summary Asymmetric

235 views • 21 slides
Costs 26 th May 2011 Agenda Introduction Overview of Dispatch Balancing Costs (30 mins)

Costs 26 th May 2011 Agenda Introduction Overview of Dispatch Balancing Costs (30 mins)

Operations Seminar Managing Dispatch Balancing Costs 26 th May 2011 Agenda Introduction Overview of Dispatch Balancing Costs (30 mins) Ongoing Management of Dispatch Balancing Costs (15 mins) Forecasting Dispatch Balancing Costs

1.15k views • 87 slides
Clarifying Residual Flow s for Surface Water Takes August 2017 Clarifying Residual Flow s

Clarifying Residual Flow s for Surface Water Takes August 2017 Clarifying Residual Flow s

Clarifying Residual Flow s for Surface Water Takes August 2017 Clarifying Residual Flow s Purpose of consultation is to clarify: The difference between residual and minimum flows Purpose of the plan change Who may be affected

517 views • 16 slides
Outline ROS Basics Plan Execution Very Simple Dispatch Very Simple Temporal

Outline ROS Basics Plan Execution Very Simple Dispatch Very Simple Temporal

Outline ROS Basics Plan Execution Very Simple Dispatch Very Simple Temporal Dispatch Conditional Dispatch Temporal and Conditional Dispatch together Dispatching More than a Single Plan Hierarchical and

1.69k views • 99 slides
Chittenden County Regional Dispatch Implementation Background 1. Why are we doing this? 2.

Chittenden County Regional Dispatch Implementation Background 1. Why are we doing this? 2.

Chittenden County Regional Dispatch Implementation Background 1. Why are we doing this? 2. DELTAWRX Recommendations 3. Governance Work Group Recommendations 4. Proposed next steps 5. Questions? 6. Dispatch Consolidation Roadmap PSAP

581 views • 57 slides
Automobile Intrusion Detection Jun Li Twitter @bravo_fighter UnicornTeam Qihoo360 2 What

Automobile Intrusion Detection Jun Li Twitter @bravo_fighter UnicornTeam Qihoo360 2 What

Automobile Intrusion Detection Jun Li Twitter @bravo_fighter UnicornTeam Qihoo360 2 What this talk is about? Automotive intrusion detection Automotive cyber-security architecture From the highest viewpoint J 3 Outline Quick

926 views • 63 slides
Multilevel and Adaptive Iterative Substructuring Methods Jan Mandel University of Colorado Denver

Multilevel and Adaptive Iterative Substructuring Methods Jan Mandel University of Colorado Denver

Multilevel and Adaptive Iterative Substructuring Methods Jan Mandel University of Colorado Denver The multilevel BDDC method is joint work with Bed rich Soused k, Czech Technical University, and Clark Dohrmann, Sandia. The adaptive BDDC

532 views • 34 slides
YOUNGS FARM AAWS MODELING May 27, 2016 1 INITIAL MODELING ADWR Sever & Transfer

YOUNGS FARM AAWS MODELING May 27, 2016 1 INITIAL MODELING ADWR Sever & Transfer

YOUNGS FARM AAWS MODELING May 27, 2016 1 INITIAL MODELING ADWR Sever & Transfer D&O 651.36 afa 12 POD wells withdrawing surface water PrAMA Model at ADWR direction Run PrAMA Model for 100 yrs POD wells capable

398 views • 14 slides
The DPLL algorithm Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodr

The DPLL algorithm Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodr

The DPLL algorithm Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodr guez-Carbonell May 22, 2020 Overview of the session Designing an efficient SAT solver DPLL: A Bit of History Abstract DPLL: Rules

916 views • 42 slides
A Hierarchical Analysis of Propositional Temporal Logic based on Intervals Ben Moszkowski

A Hierarchical Analysis of Propositional Temporal Logic based on Intervals Ben Moszkowski

A Hierarchical Analysis of Propositional Temporal Logic based on Intervals Ben Moszkowski Software Technology Research Laboratory De Montfort University Leicester Great Britain email: x@y , where x=benm and y=dmu.ac.uk

919 views • 52 slides
Are Low-Power SoCs Feasible for Heterogenous HPC Workloads? Max Plauth and Andreas Polze

Are Low-Power SoCs Feasible for Heterogenous HPC Workloads? Max Plauth and Andreas Polze

Are Low-Power SoCs Feasible for Heterogenous HPC Workloads? Max Plauth and Andreas Polze Operating Systems and Middleware Group Hasso Plattner Institute, University of Potsdam, Germany Introduction Operating Systems and Middleware Group

1k views • 20 slides
Secure By Design: Codified Controls For Cloud Services This talk will introduce the idea and

Secure By Design: Codified Controls For Cloud Services This talk will introduce the idea and

Secure By Design: Codified Controls For Cloud Services This talk will introduce the idea and method used by JPMorgan Chase & Co. to get cloud services approved for use in an accelerated timeline. This idea and method are now a project at

540 views • 24 slides
Evaluating the Impact of Interconnections in Quantum-dot Cellular Automata (QCA) Frank Sill Torres

Evaluating the Impact of Interconnections in Quantum-dot Cellular Automata (QCA) Frank Sill Torres

Evaluating the Impact of Interconnections in Quantum-dot Cellular Automata (QCA) Frank Sill Torres 1,2 , Robert Wille 1,3 , Marcel Walter 2 , Philipp Niemann 1,2 , Daniel Groe 1,2 , Rolf Drechsler 1,2 1 DFKI GmbH (Germany), 2 University of Bremen

379 views • 18 slides

More recommend