E1AR0002@SMUVM1.BITNET.UUCP (02/21/87)
Seminar Announcement, Friday February 27, 1987, 315 SIC, 1:30 PM, Southern Methodist University Stephen Watt ABSTRACT: PARALLEL TECHNIQUES IN COMPUTER ALGEBRA This talk presents techniques for exploiting parallel proc- essing in symbolic mathematical computation. We examine the use of high-level parallelism when the number of processors is fixed and independent of the problem size, as in existing multiprocessors. Since seemingly small changes to the inputs can cause dra- matic changes in the execution times of many algorithms in computer algebra, it is not generally useful to use static scheduling. We find it is possible, however, to exploit the high-level parallelism in many computer algebra problems us- ing dynamic scheduling methods in which subproblems are treated homogeneously. An OR-parallel algorithm for integer factorization will be presented along with AND-parallel al- gorithms for the computation of multivariate polynomial GCDs and the computation of Groebner bases. A portion of the talk will be used to present the design of a system for running computer algebra programs on a multi- processor. The system is a version of Maple able to dis- tribute processes over a local area network. The fact that the multiprocessor is a local area network need not be con- sidered by the programmer.