A probabilistically analysable cache implementation on FPGA

Conference Proceedings - 13th IEEE International NEW Circuits and Systems Conference, NEWCAS 2015

Volumn , Issue , 2015, Pages

  Anwar, Hassan ^a   Chen, Chao ^a   Beltrame, Giovanni ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY ACCURACY; CONFIDENCE INTERVAL; DATA CACHES; LEAST-RECENTLY-USED POLICIES; RANDOM PLACEMENT; REPLACEMENT POLICY; TIMING ANALYSIS; WORST-CASE EXECUTION TIME;

COMPUTER ARCHITECTURE;

EID: 84945144106     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NEWCAS.2015.7181984     Document Type: Conference Paper

References (16)

1. F. J. Cazorla et al., "Proartis: Probabilistically analyzable real-time systems," ACM Trans. Embed. Comput. Syst., vol. 12, no. 2s, pp. 94:1-94:26, May 2013.
2. R. Wilhelm et al., "The worst-case execution-time problem-overview of methods and survey of tools," ACM Trans. Embed. Comput. Syst., vol. 7, no. 3, pp. 36:1-36:53, May 2008.
3. "Cortex-M Series. " [Online]. Available: http://www. arm. com/products/ processors/cortex-m/
4. L. Kosmidis et al., "A cache design for probabilistically analysable realtime systems," in Proceedings of the Conference on Design, Automation and Test in Europe, ser. DATE '13, 2013, pp. 513-518.
5. N. Topham and A. González, "Randomized cache placement for eliminating conflicts," IEEE Trans. Comput., vol. 48, no. 2, pp. 185-192, Feb. 1999.
6. J. Reineke, D. Grund, C. Berg, and R. Wilhelm, "Timing predictability of cache replacement policies," Real-Time Syst., vol. 37, no. 2, pp. 99-122, Nov. 2007.
7. L. David and I. Puaut, "Static determination of probabilistic execution times," in Proceedings of the 16th Euromicro Conference on Real-Time Systems, ser. ECRTS '04, 2004, pp. 223-230.
8. G. Cucu et al., "Measurement-based probabilistic timing analysis for multi-path programs," in Real-Time Systems (ECRTS), 2012 24th Euromicro Conference on, 2012, pp. 91-101.
9. "Ion-MIPS compatible CPU core. " [Online]. Available: https: //github. com/jaruiz/ION
10. M. Matsumoto et al., "Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator," ACM Trans. Model. Comput. Simul., vol. 8, no. 1, pp. 3-30, Jan. 1998.
11. "Complex gaussian pseudo-random number generator. ". Available: http://opencores. org/project/ complex-gaussian-pseudo-random-number-generator
12. S. Bandyopadhyay and R. Bhattacharya, Discrete and Continuous Simulation: Theory and Practice. CRC Press, 2015.
13. M. Goresky and A. Klapper, "Efficient multiply-with-carry random number generators with maximal period," ACM Trans. Model. Comput. Simul., vol. 13, no. 4, pp. 310-321, Oct. 2003.
14. J. Gustafsson, A. Betts, A. Ermedahl, and B. Lisper, "The Mälardalen WCET benchmarks-past, present and future," in WCET2010, B. Lisper, Ed. Brussels, Belgium: OCG, Jul. 2010, pp. 137-147.
15. F. Amoset et al., "Worst-case execution time analysis for a java processor," Journal of Algorithms, vol. 12, no. 4, pp. 685-6-99, 1991.
16. S. Boslaugh and P. A. Watters, Statistics in a nutshell-a desktop quick reference. O'Reilly, 2008.