Process Scheduling in DSC and the Large Sparse Linear Systems Challenge

✍ Scribed by A. Dı́az; M. Hitz; E. Kaltofen; A. Lobo; T. Valente

• Book ID: 102975301
• Publisher: Elsevier Science
• Year: 1995
• Tongue: English
• Weight: 548 KB
• Volume: 19
• Category: Article
• ISSN: 0747-7171
• DOI: 10.1006/jsco.1995.1015

✦ Synopsis

New features of our DSC system for distributing a symbolic computation task over a network of processors are described. A new scheduler sends parallel subtasks to those compute nodes that are best suited in handling the added load of CPU usage and memory. Furthermore, a subtask can communicate back to the process that spawned it by a co-routine style calling mechanism. Two large experiments are described in this improved setting. In the first we have implemented an algorithm that can prove a number of more than 1,000 decimal digits prime in about 2 months elapsed time on some 20 computers. In the second a parallel version of a sparse linear system solver is used to compute the solution of sparse linear systems over finite fields. We are able to find the solution of a 100,000 by 100,000 linear system with about 10.3 million non-zero entries over the Galois field with 2 elements using 3 computers in about 54 hours CPU time.