Jump to content

Talk:Hot spot (computer programming)

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Christian75 (talk | contribs) at 09:49, 6 June 2015 (Assessment: +Computing (assisted)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputing Unassessed
WikiProject iconThis article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
???This article has not yet received a rating on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's importance scale.

I'm not sure where this should be pointed out, but hot spots are not always performance problems, and vice versa. An example would be an O(N^2) algorithm that happened to invoke a lengthy call tree in its inner loop. There might or might not be a hot spot at the bottom of the call tree, but the problem is at mid-stack. Samples of the program counter would not show it, but samples of the call stack would. In my experience, the larger the software is, the more prevalent are such mid-stack performance problems. MikeDunlavey (talk) 23:18, 18 May 2009 (UTC)[reply]