Re: Multiplication by a constant - how?

Christopher Glaeser <cdg@nullstone.com>
31 Mar 1997 15:22:14 -0500

          From comp.compilers

Related articles
[3 earlier articles]
Re: Multiplication by a constant - how? d.sand@ix.netcom.com (Duane Sand) (1997-03-16)
Re: Multiplication by a constant - how? harwood@trinidad.progress.com (1997-03-16)
Re: Multiplication by a constant - how? dlmoore@ix.netcom.com (David L Moore) (1997-03-16)
Re: Multiplication by a constant - how? preston@tera.com (1997-03-21)
Re: Multiplication by a constant - how? torbenm@diku.dk (1997-03-21)
Re: Multiplication by a constant - how? Sergey.Solyanik@bentley.com (Sergey Solyanik) (1997-03-27)
Re: Multiplication by a constant - how? cdg@nullstone.com (Christopher Glaeser) (1997-03-31)
Re: Multiplication by a constant - how? preston@cs.rice.edu (1997-04-02)
| List of all articles for this month |

From: Christopher Glaeser <cdg@nullstone.com>
Newsgroups: comp.compilers
Date: 31 Mar 1997 15:22:14 -0500
Organization: Nullstone Corporation
References: 97-03-062 97-03-092 97-03-114 97-03-150
Keywords: arithmetic, optimize

Sergey Solyanik wrote:


> By the way, with memoization it really runs very fast - factoring
> all 32K numbers took well under half a minute.


Those are excellent results. There are multiply constants with various
repeating bit sequences in the NULLSTONE suite to detect poor
algorithms, and I measured one compiler that required as much as forty
minutes of compile time for some constants.


Best regards,
Christopher Glaeser cdg@nullstone.com
Nullstone Corporation http://www.nullstone.com
--


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.