Path: csiph.com!eternal-september.org!feeder.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Paul Rubin <no.email@nospam.invalid>
Newsgroups: comp.lang.forth
Subject: Re: Are stack machines inherently faster?
Date: Fri, 18 Nov 2016 20:27:10 -0800
Organization: A noiseless patient Spider
Lines: 15
Message-ID: <87k2c0ccwx.fsf@nightsong.com>
References: <40b9c778-3a98-450b-b65b-6cbaee444921@googlegroups.com> <o0bcvo$f3g$2@dont-email.me> <6a4467c7-1b3b-4e36-b10d-c6a4c98433c6@googlegroups.com> <o0dvao$kt9$1@dont-email.me> <0ebbb961-6537-4472-8170-f899bd801edb@googlegroups.com> <dae80a10-e734-433e-a6fa-1c44c8d09059@googlegroups.com> <34e47822-500b-421c-a53d-a9e0fcc1f6ae@googlegroups.com> <87vavld5g6.fsf@nightsong.com> <582ee232.719393556@news.eternal-september.org>
Mime-Version: 1.0
Content-Type: text/plain
Injection-Info: mx02.eternal-september.org; posting-host="e3ea742ecf16cb514721309f0067cdcc"; logging-data="2267"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18QqmxM3oezZLH6oW4lYRhM"
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/24.3 (gnu/linux)
Cancel-Lock: sha1:lwYCD8klsFIh3cw+DLtsg8uL2Co= sha1:qyOhOr0fxb4uq19I1Td2xt6i7kc=
Xref: csiph.com comp.lang.forth:52728

stephen@mpeforth.com (Stephen Pelc) writes:
> One of our clients has a recalculation that used to take 15 or so
> seconds on our DTC ProForth for Windows. The boss excitedly took
> me to his office to show that the conversion to VFX Forth took
> about 1.5 seconds. To him, that was important.

Of course this happens sometimes.  In the programs that most people I
know work on, it doesn't happen often: the resource constraints are
rarely computational.  

In the application you mentioned, if it's spreadsheet-like, I wonder
whether algorithmic improvements (like finding the dependency graph
between formulas and updating only the necessary cells after a change)
might have helped more than better code generation.  OTOH you may
already have been doing that.