Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!romp!auschs!awdprime!doorstop.austin.ibm.com!tif
From: tif@doorstop.austin.ibm.com (Paul Chamberlain)
Newsgroups: comp.arch
Subject: Re: LINPACK 1000x1000 MFLOPS per $$$
Message-ID: <2821@awdprime.UUCP>
Date: 19 Jul 90 17:45:40 GMT
References: <MCCALPIN.90Jul18175935@pereland.cms.udel.edu> <5180@ethz.UUCP>
Sender: news@awdprime.UUCP
Reply-To: tif@doorstop.austin.ibm.com (Paul Chamberlain)
Organization: IBM AWD, Austin, TX
Lines: 15

In article <5180@ethz.UUCP> bloepfe@bernina.ethz.ch.UUCP (Bruno Loepfe) writes:
>In article <MCCALPIN.90Jul18175935@pereland.cms.udel.edu> mccalpin@pereland.cms.udel.edu (John D. McCalpin) writes:
>>Stardent has recently been running an advertisement in Supercomputing
>>Review which uses the measure of LINPACK 1000x1000 MFLOPS per Dollar ...
>... it's probably not feasible to watch the "real world"
>through a filter "$$$ per <something>" only, where <something> is your
>favorite attribute of a computer (or anything else)...

For this MFLOPS per Dollar to be useful you obviously have to begin
by eliminating those with less MFLOPS than you HAVE to have, and
by eliminating those with more DOLLARS that you can afford.  My
problem is that at that stage, I end up with the null set.

Paul Chamberlain | I do NOT represent IBM         tif@doorstop, sc30661@ausvm6
512/838-7008     | ...!cs.utexas.edu!ibmaus!auschs!doorstop.austin.ibm.com!tif