Re: Euler 433 : analyzing euclids algo

From	anton@mips.complang.tuwien.ac.at (Anton Ertl)
Newsgroups	comp.lang.forth
Subject	Re: Euler 433 : analyzing euclids algo
Date	2013-07-02 07:30 +0000
Organization	Institut fuer Computersprachen, Technische Universitaet Wien
Message-ID	<2013Jul2.093015@mips.complang.tuwien.ac.at> (permalink)
References	<51d0db5a$0$3167$e4fe514c@dreader36.news.xs4all.nl> <2013Jul1.134316@mips.complang.tuwien.ac.at> <51d1d1ff$0$619$e4fe514c@dreader34.news.xs4all.nl>

Show all headers | View raw

albert@spenarnc.xs4all.nl (Albert van der Horst) writes:
>I don't suggest that Forth compilers must follow gcc, but
>you must admit that gcc is useful in this context:

Not at all.  The program is useless and it is written badly.
Generating surprisingly good code for it is not useful.  And even if
it was, it would have to be balanced against the cost (miscompiling
useful programs), and the balance is negative.

>Here speed is of the essence. My machine spent a total of
>4000 minutes in this code. (The total overhead in the calling
>Forth code was 2 seconds.)
>I used a pre-emptive thread to allow both of my processors to work for
>a wall clock time of 2000 minutes : 32 hours.
>
>The novice got it in about the same time, with probably a faster
>processor.

That's a factor of 2000 beyond the 1-minute rule, so the compiler
heroics (or crazyness) did not help here at all.

- anton
-- 
M. Anton Ertl  http://www.complang.tuwien.ac.at/anton/home.html
comp.lang.forth FAQs: http://www.complang.tuwien.ac.at/forth/faq/toc.html
     New standard: http://www.forth200x.org/forth200x.html
   EuroForth 2013: http://www.euroforth.org/ef13/

Back to comp.lang.forth | Previous | Next — Previous in thread | Next in thread | Find similar

Thread

Euler 433 : analyzing euclids algo albert@spenarnc.xs4all.nl (Albert van der Horst) - 2013-07-01 01:28 +0000
  Re: Euler 433 : analyzing euclids algo m.a.m.hendrix@tue.nl - 2013-07-01 01:03 -0700
    Re: Euler 433 : analyzing euclids algo Andrew Haley <andrew29@littlepinkcloud.invalid> - 2013-07-01 03:20 -0500
      Re: Euler 433 : analyzing euclids algo m.a.m.hendrix@tue.nl - 2013-07-01 01:30 -0700
      Re: Euler 433 : analyzing euclids algo albert@spenarnc.xs4all.nl (Albert van der Horst) - 2013-07-01 09:59 +0000
  Re: Euler 433 : analyzing euclids algo anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-07-01 11:43 +0000
    Re: Euler 433 : analyzing euclids algo albert@spenarnc.xs4all.nl (Albert van der Horst) - 2013-07-01 19:01 +0000
      Re: Euler 433 : analyzing euclids algo anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2013-07-02 07:30 +0000
  Re: Euler 433 : analyzing euclids algo "WJ" <w_a_x_man@yahoo.com> - 2013-07-01 15:19 +0000
    Re: Euler 433 : analyzing euclids algo Alex McDonald <blog@rivadpm.com> - 2013-07-01 09:14 -0700
    Re: Euler 433 : analyzing euclids algo albert@spenarnc.xs4all.nl (Albert van der Horst) - 2013-07-01 19:05 +0000
    Re: Euler 433 : analyzing euclids algo Mark Wills <markrobertwills@yahoo.co.uk> - 2013-07-02 00:02 -0700
    Re: Euler 433 : analyzing euclids algo "WJ" <w_a_x_man@yahoo.com> - 2013-07-03 01:32 +0000
  Re: Euler 433 : analyzing euclids algo Paul Rubin <no.email@nospam.invalid> - 2013-07-01 17:37 -0700

csiph-web