[go: nahoru, domu]

Jump to content

Talk:Hot spot (computer programming)

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Widefox (talk | contribs) at 17:51, 15 January 2024 (Assessment (Low): Computing, +banner shell (Start) (Rater)). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Untitled[edit]

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]