1. Gathering Memory Hierarchy Statistics in QEMU
- Author
-
Deschamps, Cl., Pétrot, Frédéric, Burton, M., Jenn, Eric, GreenSocs, System Level Synthesis (SLS ), Techniques de l'Informatique et de la Microélectronique pour l'Architecture des systèmes intégrés (TIMA), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), IRT Saint Exupéry - Institut de Recherche Technologique, and BEN TITO, Laurence
- Subjects
cache simulation ,traduction binaire dynamique ,[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] ,simulation de cache ,PACS 85.42 ,dynamic binary translation ,[INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR] - Abstract
International audience; Fast functional verification using Transaction Level Modeling of hardware/software systems typically makes use of fast, dynamic binary translation based, processor models. When it comes to estimating performance figures, either higher level analytical models, or lower level cycle-accurate/approximate models are generally used. However, we believe that metrics relative to the memory hierarchy can be relatively accurately acquired while working with fast processor simulators at transaction level. This, of course, sacrifices some speed for accuracy, but lets the designer work in their usual environment and the resulting model only sacrifices about 30% in terms of performance, for a single core model. In this paper, we detail our level one cache modeling strategy and how we implement it. We then measure simulation speed overheads and compare our statistics with information gathered on the Cortex R5 PMU of Xilinx UltraScale-Plus board running the same benchmark.
- Published
- 2019