RE: Optimizing for speed

Matt Thomlinson (mattt@microsoft.com)
Wed, 18 Feb 1998 13:54:13 -0500

• Next message: Steve Salkin: "El Gamal strength by modulus length"
• Previous message: David Honig: "Re: Optimizing for speed (QueryPerformanceCounter)"

GetTickCount() is nice, but limited to 25 ms resolution.
You might be able to use QueryPerformanceCounter() and
QueryPerformanceFrequency() to get a higher resolution.

I usually used GetTickCount(), since it is easiest, and iterate over my
test.

mattt
> -----Original Message-----
> From: Chuck McManis [SMTP:cmcmanis@freegate.com]
> Sent: Tuesday, February 17, 1998 3:23 PM
> To: CodherPlunks@toad.com
> Subject: Optimizing for speed
>
> So I've got some algorithms that I'm trying to squeeze more speed
> out of, and while I'm not quite as fanatical as the DES search
> team I do find myself at a loss for tools. My environment is
> VC++5 on a Win95 platform and what I'd like is something like :
>
> long long t1, t2;
> t1 = snap_time(); /* time in nSecs */
> ... do something ...
> t2 = snap_time();
> printf("This run took %ld nS\n", (long)(t2 - t1));
>
> I've yet to find something in my search through various
> manuals...
>
> --Chuck

• Next message: Steve Salkin: "El Gamal strength by modulus length"
• Previous message: David Honig: "Re: Optimizing for speed (QueryPerformanceCounter)"