304 Hits in 5.6 sec

Static Probabilistic Timing Analysis of Random Replacement Caches using Lossy Compression

David Griffin, Benjamin Lesage, Alan Burns, Robert I. Davis
2014 Proceedings of the 22nd International Conference on Real-Time Networks and Systems - RTNS '14  
Introduction  Static analysis gives absolute guarantees  … but it's massively pessimistic  … and most people don't need absolute guarantees Lossy CompressionLossy Compression is used to find what  ...  strategies with distribution compression  16-way Random Replacement Cache with cache line size 8  Traces from Mälardalen Benchmarks  Fixed parameters α = 10 9 , t = 10 6  Variety of parameters for  ... 
doi:10.1145/2659787.2659809 dblp:conf/rtns/GriffinLBD14a fatcat:km5bqjsaufg75d7i6saofthyoa

Lossy Compression for Worst-Case Execution Time Analysis of PLRU Caches

David Griffin, Benjamin Lesage, Alan Burns, Robert I. Davis
2014 Proceedings of the 22nd International Conference on Real-Time Networks and Systems - RTNS '14  
Time analysis problem.  ...  useful analysis can be derived.  ...  In future we aim to use the Lossy Compression approach to provide analysis for Probabilistic Real-Time Systems [13] , that use caches with an evict-on-miss random replacement policy [14] , [2] .  ... 
doi:10.1145/2659787.2659807 dblp:conf/rtns/GriffinLBD14 fatcat:43hwzantfnhjbe2egcpcgi65sq

A Survey of Probabilistic Timing Analysis Techniques for Real-Time Systems

Robert I. Davis, Liliana Cucu-Grosjean
2018 Leibniz Transactions on Embedded Systems  
A detailed review is provided covering the main subject areas: static probabilistic timing analysis, measurement-based probabilistic timing analysis, and hybrid methods.  ...  This survey covers probabilistic timing analysis techniques for real-time systems.  ...  The authors would like to thank David Griffin and Alan Burns for their comments on an earlier draft of this survey.  ... 
doi:10.4230/lites-v006-i001-a003 dblp:journals/lites/DavisC19 fatcat:g6ngxcyk4baq5camynactxxr3m

Static Probabilistic Timing Analysis for Multi-path Programs

Benjamin Lesage, David Griffin, Sebastian Altmeyer, Robert I. Davis
2015 2015 IEEE Real-Time Systems Symposium  
The analysis estimates the temporal contribution of an evict-on-miss, random replacement cache to the probabilistic Worst-Case Execution Time (pWCET) distribution of multi-path programs.  ...  This paper introduces an effective Static Probabilistic Timing Analysis (SPTA) for multi-path programs.  ...  ACKNOWLEDGEMENT This work was partially funded by the EU FP7 Integrated Project PROXIMA (611085), the Inria International Chair program, and ICT COST Action IC1202: Timing Analysis On Code-Level (TACLe  ... 
doi:10.1109/rtss.2015.41 dblp:conf/rtss/LesageGAD15 fatcat:pmphpt5fvngp7mik7l6cs7jubm

An Adaptive Markov Model for the Timing Analysis of Probabilistic Caches

Chao Chen, Giovanni Beltrame
2017 ACM Transactions on Design Automation of Electronic Systems  
[Griffin et al. 2014 ] propose a methodology from the field of Lossy Compression and they use a fully-associative cache for timing analysis throughout their work.  ...  Based Probabilistic Timing Analysis (MBPTA) and Static Probabilistic Timing Analysis (SPTA) respectively.  ... 
doi:10.1145/3123877 fatcat:aeyhhyzdrngbpcyikuhvsnqxwm

Static probabilistic timing analysis in presence of faults

Chao Chen, Luca Santinelli, Jerome Hugues, Giovanni Beltrame
2016 2016 11th IEEE Symposium on Industrial Embedded Systems (SIES)  
Two timing analysis techniques are proposed for systems with random caches: the Measurement Based Probabilistic Timing Analysis (MBPTA) and the Static Probabilistic Timing Analysis (SPTA).  ...  [15] propose a methodology from the field of Lossy Compression and compare it with the method in [9] : by using May and Must Analysis, the result is more accurate with appropriate parameters.  ... 
doi:10.1109/sies.2016.7509422 dblp:conf/sies/ChenSHB16 fatcat:b37jpdq4bvf27odutil2uferje

On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs

Benjamin Lesage, David Griffin, Sebastian Altmeyer, Liliana Cucu-Grosjean, Robert I. Davis
2017 Real-time systems  
Probabilistic hard real-time systems, based on hardware architectures that use a random replacement cache, provide a potential means of reducing the hardware over-provision required to accommodate pathological  ...  The analysis estimates the temporal contribution of an evict-on-miss, random replacement cache to the pWCET distribution of multi-path programs.  ...  The timing behaviour of programs running on a processor with a cache using a random replacement policy can be determined using static probabilistic timing analysis (SPTA).  ... 
doi:10.1007/s11241-017-9295-2 fatcat:3whchd6f5jdifafgb3ljm4ysru

A framework for the evaluation of measurement-based timing analyses

Benjamin Lesage, David Griffin, Frank Soboczenski, Iain Bate, Robert I. Davis
2015 Proceedings of the 23rd International Conference on Real Time and Networks Systems - RTNS '15  
The effectiveness of the framework is demonstrated by evaluating the impact of imperfect structural coverage on an existing measurement-based probabilistic timing analysis.  ...  This framework uses abstract models of synthetic tasks to provide realistic execution time data as input to the analyses, while ensuring that a corresponding AWCET can be computed.  ...  Acknowledgement The authors would like to thank Liliana Cucu-Grosjean and Adriana Gogonel from Inria Paris-Rocquencourt for their help in the implementation of the MBPTA analysis.  ... 
doi:10.1145/2834848.2834858 dblp:conf/rtns/LesageGSBD15 fatcat:3c7jcrt43nbttpun44jj2r57rm

Modelling fault dependencies when execution time budgets are exceeded

David Griffin, Benjamin Lesage, Iain Bate, Frank Soboczenski, Robert I. Davis
2015 Proceedings of the 23rd International Conference on Real Time and Networks Systems - RTNS '15  
Hence this paper presents a new application of Markov Chain based modelling techniques combined with forecasting techniques to determine an appropriate fault model, using Lossy Compression to fit the model  ...  In addition, a new algorithm, DepET, for generating job execution times with dependencies is given for use in task simulators.  ...  Lossy Compression, previously used on models of real time systems by Griffin et al., has been applied to static analyses of PLRU caches [16, 18] and random replacement caches [17] .  ... 
doi:10.1145/2834848.2834870 dblp:conf/rtns/GriffinLBSD15 fatcat:covh4tdbfjehzoitllmd7ok6ay

Design Tradeoffs of Data Access Methods

Manos Athanassoulis, Stratos Idreos
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
Throughout the evolution of the structures and techniques used to access data, access methods adapt to the ever changing hardware and workload requirements.  ...  The fundamental challenges that every researcher, systems architect, or designer faces when designing a new access method are how to minimize, i) read times (R), ii) update cost (U), and iii) memory (or  ...  Example categories include compression techniques and lossy index structures such as Bloom filters [12] , lossy hash-based indexes like count-min sketches [16] , bitmaps with lossy encoding [51] , and  ... 
doi:10.1145/2882903.2912569 dblp:conf/sigmod/AthanassoulisI16 fatcat:u5kgptph3jdbfhni262uxg6rre

Exploiting Errors for Efficiency: A Survey from Circuits to Algorithms [article]

Phillip Stanley-Marbell and Armin Alaghi and Michael Carbin and Eva Darulova and Lara Dolecek and Andreas Gerstlauer and Ghayoor Gillani and Djordje Jevdjic and Thierry Moreau and Mattia Cacciotti and Alexandros Daglis and Natalie Enright Jerger and Babak Falsafi and Sasa Misailovic and Adrian Sampson and Damien Zufferey
2018 arXiv   pre-print
We present, for the first time, a synthesis of research results on computing systems that only make as many errors as their users can tolerate, from across the disciplines of computer aided design of circuits  ...  We survey tradeoffs for individual layers of computing systems from the circuit level to the operating system level and illustrate the potential benefits of end-to-end approaches using two illustrative  ...  A recent study leverages data similarity between cache blocks to perform lossy compression in networks-on-chip (NoCs) [21] .  ... 
arXiv:1809.05859v1 fatcat:7dbs7eduxvgetew2cc6z3cy7ie

Exploiting Errors for Efficiency

Phillip Stanley-Marbell, Armin Alaghi, Michael Carbin, Eva Darulova, Lara Dolecek, Andreas Gerstlauer, Ghayoor Gillani, Djordje Jevdjic, Thierry Moreau, Mattia Cacciotti, Alexandros Daglis, Natalie Enright Jerger (+4 others)
2020 ACM Computing Surveys  
A recent study leverages data similarity between cache blocks to perform lossy compression in networks-on-chip (NoCs) [21] .  ...  The key idea is in simple data-type aware approximation using approximate matching between data to be sent and data items that have been recently sent to perform a quick lossy compression.  ... 
doi:10.1145/3394898 fatcat:k3h6kzolbvgtndeypcb3bx3aoq

Compression in wireless sensor networks

M. A. Razzaque, Chris Bleakley, Simon Dobson
2013 ACM transactions on sensor networks  
In this article, we take a step in that direction by presenting a survey of the literature in the area of compression and compression frameworks in WSNs.  ...  It is high time that these individual efforts are put into perspective and a more holistic view taken.  ...  is static.  ... 
doi:10.1145/2528948 fatcat:priodvou25c3locplk3is4al4m

Probabilistic Counting with Randomized Storage

Benjamin Van Durme, Ashwin Lall
2009 International Joint Conference on Artificial Intelligence  
Previous work by Talbot and Osborne [2007] explored the use of randomized storage mechanisms in language modeling.  ...  These structures trade a small amount of error for significant space savings, enabling the use of larger language models on relatively modest hardware.  ...  Acknowledgements The first author benefited from conversations with David Talbot concerning the work of Morris and Bloom, as well as with Miles Osborne on the emerging need for randomized storage.  ... 
dblp:conf/ijcai/DurmeL09 fatcat:w7isyzy6hbccdpk5644ldg3rna

Probabilistic analysis for mixed criticality systems using fixed priority preemptive scheduling

Dorin Maxim, Robert I. Davis, Liliana Cucu-Grosjean, Arvind Easwaran
2017 Proceedings of the 25th International Conference on Real-Time Networks and Systems - RTNS '17  
is paper introduces probabilistic analysis for xed priority preemptive scheduling of mixed criticality systems on a uniprocessor using the Adaptive Mixed Criticality (AMC) and Static Mixed Criticality  ...  Further, we provide an alternative analysis (in Section 4.4) and show how support for LO-criticality tasks can be improved via increased execution time budgets (in Section 4.6).  ...  , the FR BGLE funded Departs project, the FR LEOC Capacites project, the FR FUI Waruna project, the ESPRC grant MCCps (EP/P003664/1), the Inria International Chair program, and the Singapore Ministry of  ... 
doi:10.1145/3139258.3139276 dblp:conf/rtns/MaximDCE17 fatcat:d7sht3f6y5hh3fuhsztiqtfvqu
« Previous Showing results 1 — 15 out of 304 results