Skip to main content

Representative Sampling Using SimPoint

  • Chapter
  • First Online:
Processor and System-on-Chip Simulation
  • 1823 Accesses

Abstract

SimPoint is a technique used to pick what parts of the program’s execution to simulate in order to have a complete picture of execution. SimPoint uses data clustering algorithms from machine learning to automatically find repetitive (similar) patterns in a program’s execution, and it chooses one sample to represent each unique repetitive behavior. Each sample is then simulated and weighted appropriately, and then together the results from these samples represent an accurate picture of the complete execution of the program.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Van Biesbrouck, M., Eeckhout, L., Calder, B.: “Efficient sampling startup for uniprocessor and simultaneous multithreading simulation.” In: International Conference on High Performance Embedded Architectures and Compilers, November (2005).

    Google Scholar 

  2. Van Biesbrouck, M., Sherwood, T., Calder, B.: A co-phase matrix to guide simultaneous multithreading simulation. In: IEEE International Symposium on Performance Analysis of Systems and Software, March (2004).

    Google Scholar 

  3. Burger, D.C., Austin, T.M.: The SimpleScalar tool set, version 2.0. Technical Report CS-TR-97-1342, University of Wisconsin, Madison, June (1997).

    Google Scholar 

  4. Dasgupta, S.: “Experiments with random projection.” In: Uncertainty in Artificial Intelligence: Proceedings of the Sixteenth Conference (UAI-2000), pages 143–151, (2000).

    Google Scholar 

  5. Lau, J., Sampson, J., Perelman, E., Hamerly, G., Calder, B.: “The strong correlation between code signatures and performance.” In: IEEE International Symposium on Performance Analysis of Systems and Software, March (2005).

    Google Scholar 

  6. Lau, J., Schoenmackers, S., Calder, B.: “Structures for phase classification.” In: IEEE International Symposium on Performance Analysis of Systems and Software, March (2004).

    Google Scholar 

  7. Lau, J., Schoenmackers, S., Calder, B.: “Transition phase classification and prediction.” In: 11th International Symposium on High Performance Computer Architecture, February (2005).

    Google Scholar 

  8. MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: LeCam, L.M., Neyman, J. (eds.) Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol 1, pp. 281–297, University of California Press. Berkeley, CA, (1967).

    Google Scholar 

  9. Patil, H., Cohn, R., Charney, M., Kapoor, R., Sun, A., Karunanidhi, A.: “Pinpointing representative portions of large Intel Itanium programs with dynamic instrumentation.” In: International Symposium on Microarchitecture, December (2004).

    Google Scholar 

  10. Perelman, E., Hamerly, G., Calder, B.: “Picking statistically valid and early simulation points.” In: International Conference on Parallel Architectures and Compilation Techniques,pp. 244–255,New Orleans, LA, September 27–October 1, (2003).

    Google Scholar 

  11. Schwarz, G.: Estimating the dimension of a model. The Ann Statis, 6(2), 461–464, (1978).

    Article  MATH  Google Scholar 

  12. Sherwood, T., Calder, B.: Time varying behavior of programs. In: Technical Report UCSD-CS99-630, UC San Diego, August (1999).

    Google Scholar 

  13. Sherwood, T., Perelman, E., Calder, B.: “Basic block distribution analysis to find periodic behavior and simulation points in applications.” In: International Conference on Parallel Architectures and Compilation Techniques,pp. 3–14, Barcelona, Spain, September 8–12 (2001).

    Google Scholar 

  14. Sherwood, T., Perelman, E., Hamerly, G., Calder, B.: “Automatically characterizing large scale program behavior.” In: 10th International Conference on Architectural Support for Programming, October (2002).

    Google Scholar 

  15. Sherwood, T., Sair, S., Calder, B.: “Phase tracking and prediction.” In: 30th Annual International Symposium on Computer Architecture, June (2003).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Brad Calder .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+business Media, LLC

About this chapter

Cite this chapter

Hamerly, G., Perelman, E., Sherwood, T., Calder, B. (2010). Representative Sampling Using SimPoint. In: Leupers, R., Temam, O. (eds) Processor and System-on-Chip Simulation. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6175-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-6175-4_10

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-6174-7

  • Online ISBN: 978-1-4419-6175-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics