Hot spot (computer programming): Difference between revisions

Revision as of 11:46, 25 November 2013

Revision as of 03:33, 2 February 2014

Line 2:

A '''hot spot''' in [[computer science]] is most usually defined as a region of a [[computer program]] where a high proportion of executed instructions occur or where most time is spent during the program's execution (not necessarily the same thing since some instructions are faster than others).

If a program is stopped randomly, the [[program counter]] (the [[pointer (computer programming)|pointer]] to the next instruction to be executed) is frequently found to contain the address of an instruction within a certain range, possibly indicating code that is in need of optimization or even indicating the existence of a 'tight' [[CPU]] [[Program loop|loop]]. This simple technique can actually be used as a method of detecting highly used instructions although somewhat more sophisticated methods, such as [[instruction set simulator]]s or [[PerformanceProfiling analysis(computer programming)|performance analyzeranalyzers]]s, achieve this more accurately and consistently.

==History of hot spot detection==

Line 14:

==See also==

* [[Algorithmic efficiency#Hot spot analyzers|Hot spot analyzers]]

* [[Profiling (computer programming)|Performance analysis]]

==References==