Re: Compilers and efficiency

Article View: comp.arch

Article #10277

#10277

From: Guy Harris
Date: Tue, 16 Apr 1991 17:35

7 lines
787 bytes

>If a hardware polynomial evaluation takes longer than an explicit loop,
>it is not the fault of the instruction, but of the implementation.

What if a hardware polynomial evaluation takes longer than an *unrolled*
loop, with the zero-coefficient terms taken out?  Or do you have an
implementation in mind that takes zero cycles to skip the terms with
zero coefficients?

Technical Details

Message-ID: <7207@auspex.auspex.com>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!auspex!guy

References: <27fa3350.6bc2@petunia.CalPoly.EDU> <7117@auspex.auspex.com> <10095@mentor.cc.purdue.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!auspex!guy
From: guy@auspex.auspex.com (Guy Harris)
Newsgroups: comp.arch
Subject: Re: Compilers and efficiency
Message-ID: <7207@auspex.auspex.com>
Date: 16 Apr 91 17:35:34 GMT
References: <27fa3350.6bc2@petunia.CalPoly.EDU> <7117@auspex.auspex.com> <10095@mentor.cc.purdue.edu>
Organization: Auspex Systems, Santa Clara
Lines: 7

Reply to Parent Message