Re: Fastest way to read numbers in ascending order from array of i
- From: "Carl Daniel [VC++ MVP]" <cpdaniel_remove_this_and_nospam@xxxxxxxxxxxxxxx>
- Date: Tue, 8 Aug 2006 17:15:13 -0700
"Srini" <Srini@xxxxxxxxxxxxxxxxxxxxxxxxx> wrote in message
news:0516D532-0ADF-4762-9B27-8A34E55FE02E@xxxxxxxxxxxxxxxx
How do I control the cache utilization, prereading etc through my program
and
how do I veryify that it is using it correctly?
In the first place, you don't worry about it. If you're only
sorting/accessing a list of 10 or so items, you have nothing to worry about
with regard to cache issues.
When profiling your application shows you conclusively that you have a
performance issue that might be improved by careful consideration of cache
issues, then you worry about it - but seriously, the time to sort 10 items
by the worst sort imaginable is only a few microseconds - if that.
-cd
.
- References:
- Re: Fastest way to read numbers in ascending order from array of integ
- From: Jerry Coffin
- Re: Fastest way to read numbers in ascending order from array of i
- From: Jerry Coffin
- Re: Fastest way to read numbers in ascending order from array of integ
- Prev by Date: Re: Fastest way to read numbers in ascending order from array of i
- Next by Date: Keeping STL Containers in scope in Win32 C++
- Previous by thread: Re: Fastest way to read numbers in ascending order from array of i
- Next by thread: Keeping STL Containers in scope in Win32 C++
- Index(es):
Relevant Pages
|
