Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!spool.mu.edu!uwm.edu!linac!att!news.cs.indiana.edu!uceng!minerva!dmocsny
From: dmocsny@minerva.che.uc.edu (Daniel Mocsny)
Newsgroups: comp.arch
Subject: Re: Compilers and efficiency
Message-ID: <8427@uceng.UC.EDU>
Date: 12 May 91 16:53:23 GMT
References: <12054@mentor.cc.purdue.edu> <1991May10.204426.24828@ingres.Ingres.COM> <12235@mentor.cc.purdue.edu>
Sender: news@uceng.UC.EDU
Organization: University of Cincinnati, Cin'ti., OH
Lines: 25

In article <12235@mentor.cc.purdue.edu> hrubin@pop.stat.purdue.edu (Herman Rubin) writes:
>In article <1991May10.204426.24828@ingres.Ingres.COM>, jpk@ingres.com (Jon Krueger) writes:
>> Why is it important to the general computing base that the distance
>> between bits can be determined efficiently?
>
>The summary points out the problems.  Does one have to go to great lengths
>to get a car which has features not in the "general driving base"?

I believe that Herman Rubin could solve his problem with these steps:

1. Develop a computer code which solves a reasonable set of problems,
and which relies extensively on a computer's ability to determine the
distance between bits.

2. Submit the code to SPEC and get it included in the standard
benchmark suite.

3. Watch panic-stricken marketroids scurry to protect their SPEC
ratings by further partitioning SPEC into an additional category:
SPECrubins.


--
Dan Mocsny				
Internet: dmocsny@minerva.che.uc.edu