Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question for Gerd: reduce rbb lookup tables

Author: Russell Reagan

Date: 16:48:05 07/14/03

Go up one level in this thread


On July 14, 2003 at 19:38:40, Sune Fischer wrote:

>I once heard that working with byte size variables is slower than native
>integers (32 bit) sizes, so I'm not fully convinced 8 bit casting it that much
>faster(?).

Hi Sune,

You might find this site interesting, "C++ Optimization Strategies and
Techniques". Some 8-bit ops are the same speed as 32-bit ops, but some are
slower.

http://www.tantalon.com/pete/cppopt/main.htm

There is one section that covers "Relative Costs of Common Programming
Operations". It tells you approximate how long different operations take on
different types (8-bit, 32-bit, signed, unsigned, etc.). Below that table there
is also one regarding converting from one type to another. For instance, it says
converting from an 8-bit value to 32-bit value is 70% of the speed of 32-bit to
32-bit.

http://www.tantalon.com/pete/cppopt/appendix.htm#AppendixB_RelativeCosts



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.