Author: Eugene Nalimov
Date: 11:21:31 04/19/02
Go up one level in this thread
Even today for *some* programs you can see speedup on the desktop if you'll move some of your computations to the otherwise idle FP units. That happened, for example, on some cryptographic program where bottleneck was # of multiplications CPU can execute simultaneously. Eugene On April 19, 2002 at 11:16:41, Vincent Diepeveen wrote: >On April 19, 2002 at 08:47:40, Roy Eassa wrote: > >>On April 18, 2002 at 21:46:43, Robert Hyatt wrote: >> >>>On April 18, 2002 at 16:33:55, Martin Andersen wrote: >>> >>>>On April 18, 2002 at 16:10:02, Sally Weltrop wrote: >>>> >>>>>A Japanese machine records the fastest "floating point" calculation >>>>>speed - over 35 trillion calculations per second. This is five times >>>>>faster than the previous record holder, IBM's ASCI White system. >>>>> >>>>>http://www.processrequest.com/apps/redir.asp?link=XbddafaeBG >>>> >>>>I'm no expert, but I don't think chess programs use floating >>>>point calculations. >>>> >>>>Martin >>> >>> >>>Only because on PC machines, integer math is faster. If FP was faster, >>>we'd all be using that. On some machines, it is faster.. >> >> >>Interesting point! Could FP be faster than integer on the desktop in the >>not-too-distant future? Or will that remain the domain of "big" computers for >>many years to come? > >not a chance that ints are slower. >you can see fp as 64 bits ints, >you can't see ints as fp though
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.