🚀 go-pugleaf

In article <144@linus.UUCP> bs@linus.UUCP (Robert D. Silverman) writes:
>
>
>At the Crypto '86 conference I presented a new variation of the
>Quadratic Sieve algorithm for factoring large integers. The variation
>has been programmed on a STAR configuation of SUN-3's using ethernet
>connections. 

  Although this many be an interesting parallel algorithm, it is far
  from meeting Karp's challenge.  The point of Karp's challenge is that
  you must have a _general_ purpose parallel programming system - at least
  general purpose in the domain of numeric computation.  The programs that
  Dr. Karp proposes are much more complex than the program mentioned above.

  I have written parallel sorts and matrix multiplies for the Loral
  dataflow processor, but these are toy programs compared to what Karp
  proposes.  One of the problems with Karp's challenge (as others have
  pointed out) is that it will not be met unless someone foots the bill for
  a rather prodigious software development effort.  For parallel machines
  of the scale that Karp's challenge covers (e.g., 100 or more processing
  elements) software development is harder than it is for sequential
  processors.  For example, it took me a week to get a parallel matrix
  multiply program written and debugged on the Loral dataflow system.
  On a sequential processor this would be a trivial task.

  I believe that better programming environments will emerge, but they are
  a few years away.  Karp's challenge will be met, if it is met at all, as
  a side effect of another project.

		     Ian Kaplan
		     Loral Dataflow Group
		     Loral Instrumentation
	     USENET: {ucbvax,decvax,ihnp4}!sdcsvax!loral!ian
	     ARPA:   sdcc6!loral!ian@UCSD
	     USPS:   8401 Aero Dr. San Diego, CA 92123