Xref: utzoo comp.arch:19370 comp.benchmarks:57
Path: utzoo!utgpu!watserv1!watmath!att!att!linac!pacific.mps.ohio-state.edu!zaphod.mps.ohio-state.edu!think.com!mintaka!bloom-beacon!eru!hagbard!sunic!mcsun!unido!rwthinf!cip-s04!berg
From: berg@cip-s04.informatik.rwth-aachen.de (AKA Solitair)
Newsgroups: comp.arch,comp.benchmarks
Subject: Re: Optimal Computer Architectures
Message-ID: <3700@rwthinf.UUCP>
Date: 16 Nov 90 11:41:26 GMT
References: <1990Nov8.212412.14317@funet.fi>
Sender: news@rwthinf.UUCP
Reply-To: berg%cip-s01.informatik.rwth-aachen.de@unido.bitnet
Followup-To: comp.arch
Lines: 16

Norwitz Neal writes:
>I have a recursive algorithm that I would like to run as fast as possible.
>I am running a part of it on a SPARCstation SLC.  But at this rate, it might
>finnish in a couple of years!!

Why don't you have a look at the FORTH-chip (don't remember the manufacturer,
the part number should be something like 4016 if I recall correctly), the
processor has no general purpose registers, just a stack cache, the thing
was designed to execute *native* FORTH (a medium to high level threaded stack
based language) code.  Last I heard about it, they we're designing a
new one.  This processor was practically designed for recursive algorithms.
--
Sincerely,                 berg%cip-s01.informatik.rwth-aachen.de@unido.bitnet
           Stephen R. van den Berg.
"I code it in 5 min, optimize it in 90 min, because it's so well optimized:
it runs in only 5 min.  Actually, most of the time I optimize programs."