Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields

We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. Our implementation can be run on a network cluster of SPARC-20 computers and on an SP-2 multiprocessor. Detailed timings are presented for experiments with systems that arise in RSA challenge integer factoring efforts. For example, we can solve a 252, 222

• Type: Journal
• Year: 1999
• Where: ALGORITHMICA
• Authors: Erich Kaltofen, A. Lobo
• Keywords: ALGORITHMICA 1999, Challenge Integer Factoring, Coarse-grain Parallel Software, Homogeneous Solution