epc extended path coverage for measurement based
play

EPC: Extended Path Coverage for Measurement-based Probabilistic - PowerPoint PPT Presentation

EPC: Extended Path Coverage for Measurement-based Probabilistic Timing Analysis M. Ziccardi , E. Mezzetti and T. Vardanega J. Abella and F.J. Cazorla University of Padua BSC Spanish National Research Council


  1. EPC: Extended Path Coverage for Measurement-based Probabilistic Timing Analysis M. Ziccardi † , E. Mezzetti † and T. Vardanega † J. Abella § and F.J. Cazorla §‡ † University of Padua § BSC ‡ Spanish National Research Council Real-Time Systems Symposium This project and the research leading to these results www.proxima-project.eu has received funding from the European Community’s Seventh Framework Programme [FP7 / 2007-2013] under grant agreement n° 611085

  2. Overview of MBPTA ❏ Probabilistic execution time estimation ⊲ Based on measurements ⊲ Relies on solid probabilistic and statistical basis • Posing statistical requirements on the input data (i.i.d.) ⊲ Estimates are attached a probability of exceedance (user-provided threshold) W C E p T M B P T A c o l l e e c c t a i o r Block EVT projection T n Conver- selection (Inverse CDF) gence Exceedance Probability criteria Threshold e.g. 10 -16 EVT Curve fi tting Tail SETV HW Tracing exten- Execution time sion Support Randomized HW platform 2 Extended Path Coverage for MBPTA - RTSS 2015

  3. Overview of MBPTA ❏ Probabilistic execution time estimation ⊲ Based on measurements ⊲ Relies on solid probabilistic and statistical basis • Posing statistical requirements on the input data (i.i.d.) ⊲ Estimates are attached a probability of exceedance (user-provided threshold) W C E p T M B P T A c o l l e e c c t a i o r Block EVT projection T n Conver- selection (Inverse CDF) gence Exceedance Probability criteria Threshold e.g. 10 -16 EVT Curve fi tting Tail SETV HW Tracing exten- Execution time sion Support Randomized HW platform 2 Extended Path Coverage for MBPTA - RTSS 2015

  4. Overview of MBPTA ❏ Probabilistic execution time estimation ⊲ Based on measurements ⊲ Relies on solid probabilistic and statistical basis • Posing statistical requirements on the input data (i.i.d.) ⊲ Estimates are attached a probability of exceedance (user-provided threshold) W C E p T M B P T A c o l l e e c c t a i o r Block EVT projection T n Conver- selection (Inverse CDF) gence Exceedance Probability criteria Threshold e.g. 10 -16 EVT Curve fi tting Tail SETV HW Tracing exten- Execution time sion Support Randomized HW platform 2 Extended Path Coverage for MBPTA - RTSS 2015

  5. Overview of MBPTA ❏ Probabilistic execution time estimation ⊲ Based on measurements ⊲ Relies on solid probabilistic and statistical basis • Posing statistical requirements on the input data (i.i.d.) ⊲ Estimates are attached a probability of exceedance (user-provided threshold) W C E p T M B P T A c o l l e e c c t a i o r Block EVT projection T n Conver- selection (Inverse CDF) gence Exceedance Probability criteria Threshold e.g. 10 -16 EVT Curve fi tting Tail SETV HW Tracing exten- Execution time sion Support Randomized HW platform 2 Extended Path Coverage for MBPTA - RTSS 2015

  6. Overview of MBPTA ❏ Probabilistic execution time estimation ⊲ Based on measurements ⊲ Relies on solid probabilistic and statistical basis • Posing statistical requirements on the input data (i.i.d.) ⊲ Estimates are attached a probability of exceedance (user-provided threshold) W C E p T M B P T A c o l l e e c c t a i o r Block EVT projection T n Conver- selection (Inverse CDF) gence Exceedance Probability criteria Threshold e.g. 10 -16 EVT Curve fi tting Tail SETV HW Tracing exten- Execution time sion Support Randomized HW platform 2 Extended Path Coverage for MBPTA - RTSS 2015

  7. Overview of MBPTA ❏ Probabilistic execution time estimation ⊲ Based on measurements ⊲ Relies on solid probabilistic and statistical basis • Posing statistical requirements on the input data (i.i.d.) ⊲ Estimates are attached a probability of exceedance (user-provided threshold) W C E p T M B P T A c o l l e e c c t a i o r Block EVT projection T n Conver- selection (Inverse CDF) gence Exceedance Probability criteria Threshold e.g. 10 -16 EVT Curve fi tting Tail SETV HW Tracing exten- Execution time sion Support Randomized HW platform 2 Extended Path Coverage for MBPTA - RTSS 2015

  8. Overview of MBPTA ❏ Probabilistic execution time estimation ⊲ Based on measurements ⊲ Relies on solid probabilistic and statistical basis • Posing statistical requirements on the input data (i.i.d.) ⊲ Estimates are attached a probability of exceedance (user-provided threshold) W C E p T M B P T A c o l l e e c c t a i o r Block EVT projection T n Conver- selection (Inverse CDF) gence Exceedance Probability criteria Threshold e.g. 10 -16 EVT Curve fi tting Tail SETV HW Tracing exten- Execution time sion Support Randomized HW platform 2 Extended Path Coverage for MBPTA - RTSS 2015

  9. Representativeness of observations ❏ Inherent limitation of measurement-based approaches ⊲ Bounds are only valid for the set of paths and execution conditions for which observations were collected ❏ The same applies to MBPTA ⊲ Probabilistically captures variability from history of execution... ⊲ ...but results are only valid for the subset of observed paths bb 0 bb 1 a bb 1 b φ 0 φ 1 bb 2 bb 3 a bb 3 b bb 4 3 Extended Path Coverage for MBPTA - RTSS 2015

  10. Representativeness of observations ❏ Inherent limitation of measurement-based approaches ⊲ Bounds are only valid for the set of paths and execution conditions for which observations were collected ❏ The same applies to MBPTA ⊲ Probabilistically captures variability from history of execution... ⊲ ...but results are only valid for the subset of observed paths bb 0 φ 2 φ 3 bb 1 a bb 1 b φ 0 φ 1 bb 2 bb 3 a bb 3 b bb 4 3 Extended Path Coverage for MBPTA - RTSS 2015

  11. Extending the path coverage ❏ Synthetically extending the set observed paths M B P T A Measurements collected over o c l l a subset of the program paths e e c c t a i r o Block T n Conver- selection gence criteria EVT Curve fi tting Tail SETV exten- HW Tracing Synthetic measurements sion Support for unobserved paths Randomized HW platform W C E p T "Fully representative" distribution for all paths in a program obtained from both observed AND synthetic observations EPC Exceedance Probability Representativeness gap Distribution valid only for observed paths No EPC Execution time 4 Extended Path Coverage for MBPTA - RTSS 2015

  12. EPC building blocks ❏ Path-independence ⊲ Execution times (ET) can be made independent from the path through which they have been collected ⊲ EPC exploits probabilistic path independence at basic blocks level ❏ Synthetic measurements over unobserved paths ⊲ Path-independent ET can be combined to construct representative execution times for end-to-end (unobserved) paths ❏ Cannot naively sum up the maximum observed ET! ⊲ Collected observations are only relative to a particular path ⊲ Includes cache-level and core-level dependencies 5 Extended Path Coverage for MBPTA - RTSS 2015

  13. Probabilistic path independence ❏ Path-independent execution times for a basic block ⊲ Values does not depend on a particular path ⊲ Summing up a penalty or padding to each observed ET to compensate for any positive effect due to a specific path (e.g., cache behavior) ❏ Example of deterministic independence (caches) ⊲ Assume all accesses were hit and add a miss-hit latency to each observed value ⊲ For each memory access in a basic block: � pad I (@ I ) + � pad D (@ D ) Obs + ( bb i ) = Obs ( bb i , φ ) + @ I ∈ bb i @ D ∈ bb i ⊲ This is way overly pessimistic! ❏ Exploit the probabilistic framework ⊲ No need to enforce each observation to upper-bound the worst-case behavior 6 Extended Path Coverage for MBPTA - RTSS 2015

  14. ATPs and probabilistic padding ❏ On time-randomized single-core architectures ⊲ Randomized caches are the main source of variability � � L hit L miss ⊲ ATP (@ A , φ ) = P hit (@ A , φ ) P miss (@ A , φ ) ❏ Probabilistic padding of ATPs ⊲ Adding a probabilistic padding to negatively compensate potential positive effects of variability (e.g., a cache hit) on a specific path � � L hit L miss ⊲ ATP (@ A ) = P hit (@ A ) P miss (@ A ) ❏ Computing the padding probability ⊲ Ensure the resulting ATP distribution follows the worst ET distribution for that basic block (for any program path) ⊲ Cannot modify a set of observations to follow the exact distribution of the worst-case ATP s • Would require to selectively compensate the effects of cache hits on a subset of the collected observations 7 Extended Path Coverage for MBPTA - RTSS 2015

  15. Over-approximating the worst-case ATP ATP Cumulative ATP 1 1 0 0 L miss+pad L miss+pad L hit L miss L hit L miss ATP (@ A, φ ) ATP + (@ A ) ATP (@ A ) 8 Extended Path Coverage for MBPTA - RTSS 2015

  16. Over-approximating the worst-case ATP ATP Cumulative ATP 1 1 0 0 L miss+pad L miss+pad L hit L miss L hit L miss ATP (@ A, φ ) ATP + (@ A ) ATP (@ A ) 8 Extended Path Coverage for MBPTA - RTSS 2015

  17. Over-approximating the worst-case ATP ATP Cumulative ATP 1 1 0 0 L miss+pad L miss+pad L hit L miss L hit L miss ATP (@ A, φ ) ATP + (@ A ) ATP (@ A ) 8 Extended Path Coverage for MBPTA - RTSS 2015

  18. Over-approximating the worst-case ATP ATP Cumulative ATP 1 1 0 0 L miss+pad L miss+pad L hit L miss L hit L miss ATP (@ A, φ ) ATP + (@ A ) ATP (@ A ) 8 Extended Path Coverage for MBPTA - RTSS 2015

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


More recommend