Re: Will the Karp Problem Be Solved?

Article View: comp.arch

Article #12695

#12695

From: Robert D. Silverman
Date: Sat, 06 Dec 1986 03:18

18 lines
1326 bytes


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. I can demonstrate that N machines run N times as fast
(less perhaps 1-2%) as 1 machine. The algorithm requires miniscule I/O
between the central host and its satellites and it partitions itself
in a natural way such that each satellite can work totally independently
of the others. 

I don't have 200 SUN-3's to hook together, however.
 
I have submitted a paper describing the work to the Journal of
Supercomputing.
 

Bob Silverman

Technical Details

Message-ID: <144@linus.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!mnetor!seismo!rutgers!princeton!allegra!ulysses!gatech!linus!bs

References: <3302@curly.ucla-cs.UCLA.EDU>

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: arc1-ca.pugleaf.net!utzoo!mnetor!seismo!rutgers!princeton!allegra!ulysses!gatech!linus!bs
From: bs@linus.UUCP (Robert D. Silverman)
Newsgroups: comp.arch
Subject: Re: Will the Karp Problem Be Solved?
Message-ID: <144@linus.UUCP>
Date: Fri, 5-Dec-86 22:18:54 EST
Article-I.D.: linus.144
Posted: Fri Dec  5 22:18:54 1986
Date-Received: Tue, 9-Dec-86 04:01:36 EST
References: <3302@curly.ucla-cs.UCLA.EDU>
Organization: The MITRE Corp., Bedford, MA
Lines: 18
Summary: I already have an application on which I have demonstrated that N SUN microcomputers in a STAR configuration run N times as fast as 1.

Reply to Parent Message