Path: utzoo!attcan!uunet!lll-winken!xanth!ames!pasteur!ucbvax!ucsfcgl!seibel
From: seibel@cgl.ucsf.edu (George Seibel)
Newsgroups: comp.arch
Subject: Re: What kinds of problems...
Message-ID: <11458@cgl.ucsf.EDU>
Date: 19 Mar 89 03:43:05 GMT
References: <471@estevax.UUCP> <15347@winchester.mips.COM> <7137@phoenix.Princeton.EDU> <24888@amdcad.AMD.COM>
Sender: daemon@cgl.ucsf.edu
Reply-To: seibel@cgl.ucsf.edu (George Seibel)
Distribution: na
Organization: Computer Graphics Lab, UCSF
Lines: 15

In article <24888@amdcad.AMD.COM> tim@amd.com (Tim Olson) writes:
|In article <7137@phoenix.Princeton.EDU> mbkennel@phoenix.Princeton.EDU (Matthew B. Kennel) writes:
|| Are there any really big jobs out there that are seriously bounded
|| by integer CPU performance?  (Excuse me, but I'm probably very naive)
|
|Oh, yes.  Our machines here are loaded with simulations to do.  We could
|always use more integer performance.

What kinds of simulations are these?   I don't doubt that they exist,
I've just never seen one and am genuinely curious.   Would there be any
commercial interest in a really fast integer box that had only fair
floating pt performance?

George Seibel, UCSF
seibel@cgl.ucsf.edu