[comp.arch] Karp challenge

hes@ecsvax.UUCP (01/17/87)

The January 1987 issue of Communications of the ACM has some discussion
on the rules of this challenge.  (pages 7-9)  A letter to the editor
takes issue with some of the rules, and then an answering letter from
Karp explains his interest in a fair demonstration - "In summary,
several of the points you raise concern leoopholes in the rules.  I am
really interested in a comparison run by people of good faith who will
be fair. ..."
If you are interested in the challenge, you'll probably enjoy reading
these letters.

--henry schaffer  n c state univ

eugene@pioneer.arpa (Eugene N. Miya) (03/30/88)

I am still awaiting Alan Karp's release on Montry's paper (which Gary informs
me will be published by SIAM).  There is an important clarification which
I want to make and that is Gary's results DO meet the Karp challenge
with same-scale problems.  Don't get the impression that speed-up was
achieved by scaling the problem.  The SIAM paper will have same-scale as well as
differing scale problems.  My note in no way condemns the Sandia work.
There is lots of supercomputing marketing hype, but THIS work is valid.

From the Rock of Ages Home for Retired Hackers:

--eugene miya, NASA Ames Research Center, eugene@ames-aurora.ARPA
  "You trust the `reply' command with all those different mailers out there?"
  {uunet,hplabs,hao,ihnp4,decwrl,allegra,tektronix}!ames!aurora!eugene