delorie.com/archives/browse.cgi   search  
Mail Archives: djgpp/1997/01/21/07:46:06

From: gpt20 AT thor DOT cam DOT ac DOT uk (G.P. Tootell)
Newsgroups: comp.os.msdos.djgpp
Subject: Re: Fixed Point (Optimization)
Date: 20 Jan 1997 22:46:13 GMT
Organization: University of Cambridge, England
Lines: 15
Sender: gpt20 AT hammer DOT thor DOT cam DOT ac DOT uk (G.P. Tootell)
Message-ID: <5c0sjl$jeo@lyra.csx.cam.ac.uk>
References: <32cd6b2c DOT 4726585 AT nntp DOT southeast DOT net> <01b9bb84$bc3275a0$e2c5b7c7 AT platko DOT ix DOT netcom DOT com> <32cedb2d DOT 17212822 AT ursa DOT smsu DOT edu> <5c0a9h$8ff AT tron DOT sci DOT fi>
NNTP-Posting-Host: hammer.thor.cam.ac.uk
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp

|> You must notice that while floating point ADDITION is very much slower
|> than integer addition, this doesn't prove that for ie. multipliction would
|> be equally more faster. In fact, floating point multipliction is at least
|> as fast (if not faster) than integer one.
|> 
|> Just some of my humble thoughts...

it is indeed faster :) 1-7 cycles for a fmul, 11 for a mul (on a pentium)
see my thread about floating point stuff being faster.

|> 
|> Aatu Koskensilta aka Sqrt(-1)
|> www.sci.fi/~zaphod

-- 

- Raw text -


  webmaster     delorie software   privacy  
  Copyright © 2019   by DJ Delorie     Updated Jul 2019