Efficient sampling startup for sampled processor simulation
- Author
- Michael VanBiesbrouck, Lieven Eeckhout (UGent) and Brad Calder
- Organization
- Abstract
- Modern architecture research relies heavily on detailed pipeline simulation. Simulating the full execution of an industry standard benchmark can take weeks to months. Statistical sampling and sample techniques like SimPoint that pick small sets of execution samples have been shown to provide accurate results while significantly reducing simulation time. The inefficiencies in sampling are (a) needing the correct memory image to execute the sample, and (b) needing a warm architecture state when simulating the sample. In this paper we examine efficient Sampling Startup techniques addressing two issues: how to represent the correct memory image during simulation, and how to deal with warmup. Representing the correct memory image ensures the memory values consumed during the sample's simulation are correct. Warmup techniques focus on reducing error due to the architecture state not being fully representative of the complete execution that proceeds the sample to be simulated. This paper presents several Sampling Startup techniques and compares them against previously proposed techniques. The end result is a, practical sampled simulation methodology that provides accurate performance estimates of complete benchmark executions in the order of minutes.
- Keywords
- ACCURATE
Downloads
-
(...).pdf
- full text
- |
- UGent only
- |
- |
- 315.88 KB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-336110
- MLA
- VanBiesbrouck, Michael, et al. “Efficient Sampling Startup for Sampled Processor Simulation.” LECTURE NOTES IN COMPUTER SCIENCE, edited by Tom Conte et al., vol. 3793, Springer Verlag Berlin, 2005, pp. 47–67, doi:10.1007/11587514_5.
- APA
- VanBiesbrouck, M., Eeckhout, L., & Calder, B. (2005). Efficient sampling startup for sampled processor simulation. LECTURE NOTES IN COMPUTER SCIENCE, 3793, 47–67. https://doi.org/10.1007/11587514_5
- Chicago author-date
- VanBiesbrouck, Michael, Lieven Eeckhout, and Brad Calder. 2005. “Efficient Sampling Startup for Sampled Processor Simulation.” Edited by Tom Conte, Nacho Navarro, Wen-Mei W Hwu, Mateo Valero, and Theo Ungerer. LECTURE NOTES IN COMPUTER SCIENCE 3793: 47–67. https://doi.org/10.1007/11587514_5.
- Chicago author-date (all authors)
- VanBiesbrouck, Michael, Lieven Eeckhout, and Brad Calder. 2005. “Efficient Sampling Startup for Sampled Processor Simulation.” Ed by. Tom Conte, Nacho Navarro, Wen-Mei W Hwu, Mateo Valero, and Theo Ungerer. LECTURE NOTES IN COMPUTER SCIENCE 3793: 47–67. doi:10.1007/11587514_5.
- Vancouver
- 1.VanBiesbrouck M, Eeckhout L, Calder B. Efficient sampling startup for sampled processor simulation. Conte T, Navarro N, Hwu W-MW, Valero M, Ungerer T, editors. LECTURE NOTES IN COMPUTER SCIENCE. 2005;3793:47–67.
- IEEE
- [1]M. VanBiesbrouck, L. Eeckhout, and B. Calder, “Efficient sampling startup for sampled processor simulation,” LECTURE NOTES IN COMPUTER SCIENCE, vol. 3793, pp. 47–67, 2005.
@article{336110,
abstract = {{Modern architecture research relies heavily on detailed pipeline simulation. Simulating the full execution of an industry standard benchmark can take weeks to months. Statistical sampling and sample techniques like SimPoint that pick small sets of execution samples have been shown to provide accurate results while significantly reducing simulation time. The inefficiencies in sampling are (a) needing the correct memory image to execute the sample, and (b) needing a warm architecture state when simulating the sample.
In this paper we examine efficient Sampling Startup techniques addressing two issues: how to represent the correct memory image during simulation, and how to deal with warmup. Representing the correct memory image ensures the memory values consumed during the sample's simulation are correct. Warmup techniques focus on reducing error due to the architecture state not being fully representative of the complete execution that proceeds the sample to be simulated. This paper presents several Sampling Startup techniques and compares them against previously proposed techniques. The end result is a, practical sampled simulation methodology that provides accurate performance estimates of complete benchmark executions in the order of minutes.}},
author = {{VanBiesbrouck, Michael and Eeckhout, Lieven and Calder, Brad}},
editor = {{Conte, Tom and Navarro, Nacho and Hwu, Wen-Mei W and Valero, Mateo and Ungerer, Theo}},
isbn = {{9783540303176}},
issn = {{0302-9743}},
journal = {{LECTURE NOTES IN COMPUTER SCIENCE}},
keywords = {{ACCURATE}},
language = {{eng}},
location = {{Barcelona, Spain}},
pages = {{47--67}},
publisher = {{Springer Verlag Berlin}},
title = {{Efficient sampling startup for sampled processor simulation}},
url = {{http://doi.org/10.1007/11587514_5}},
volume = {{3793}},
year = {{2005}},
}
- Altmetric
- View in Altmetric
- Web of Science
- Times cited: