Article View: comp.lang.prolog
Article #892Re: Bogus! (was Re: Proof that Prolog can be faster than C)
From: Saumya K. Debray
Date: Wed, 13 Jun 1990 14:49
Date: Wed, 13 Jun 1990 14:49
33 lines
1611 bytes
1611 bytes
merlyn@iwarp.intel.com (Randal Schwartz) writes:
> In article <36986@ucbvax.BERKELEY.EDU>, vanroy@pisces writes:
> |
> | Benchmark timings:
> |
> | Benchmark Prolog C (no opt.) C (opt. 4)
> |
> | tak(24,16,8) 1.2 2.1 1.6
>
> Bogus.
>
> Comparing apples and oranges dude.
>
> The prolog version most likely saves results from tak(a,b,c) so that
> they can do a quick lookup the next time around.
Look -- a program either does something, or it doesn't [*]. To say that
it "most likely" does something is basically the same as saying
"I {didn't bother to | couldn't} understand the code, but here's a
wild guess", except that it's not quite as honest.
For the benchmark in question, Van Roy posted both the C and the Prolog
sources, so it's easy to verify whether or not there's any table lookups
going on. There isn't.
[*] Unless, I suppose, we're talking about randomization or true
nondeterminism. In this case, we aren't.
--
Saumya Debray CS Department, University of Arizona, Tucson
internet: debray@cs.arizona.edu
uucp: uunet!arizona!debray
Technical Details
Message-ID:
<22078@megaron.cs.arizona.edu>Path:
arc1-ca.pugleaf.net!utzoo!attcan!uunet!cs.utexas.edu!asuvax!noao!arizona!debrayReferences:
<36986@ucbvax.BERKELEY.EDU> <1990Jun12.212525.25551@iwarp.intel.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!cs.utexas.edu!asuvax!noao!arizona!debray From: debray@cs.arizona.edu (Saumya K. Debray) Newsgroups: comp.lang.prolog,comp.lang.c Subject: Re: Bogus! (was Re: Proof that Prolog can be faster than C) Summary: Huh?!? Message-ID: <22078@megaron.cs.arizona.edu> Date: 13 Jun 90 14:49:33 GMT References: <36986@ucbvax.BERKELEY.EDU> <1990Jun12.212525.25551@iwarp.intel.com> Followup-To: comp.lang.prolog Organization: U of Arizona CS Dept, Tucson Lines: 33