Xref: utzoo comp.arch:19093 comp.benchmarks:4
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!yale!cmcl2!uupsi!sunic!news.funet.fi!uikku.tut.fi!neal
From: neal@uikku.tut.fi (Norwitz Neal)
Newsgroups: comp.arch,comp.benchmarks
Subject: Optimal Computer Architectures
Message-ID: <1990Nov8.212412.14317@funet.fi>
Date: 8 Nov 90 21:24:12 GMT
Sender: news@funet.fi (#News )
Reply-To: neal@uikku.tut.fi (Norwitz Neal)
Organization: Tampere University of Technology
Lines: 9


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!!  I was wondering if someone could suggest a couple of architectures that may suit this recursive algorithm better than others.  The program takes no memory (about 12K).  So all I need is speed.  There are no floating point operations, except a couple of increments.

Also, any information about speed ratings (in mips) from many different computers would be appreciated.

Thanks a lot.

Neal Norwitz
neal@tut.fi
Tampere University of Technology