Results 1 
6 of
6
A finegrained parallel completion procedure
 IN ISSAC ’94: PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION
, 1994
"... ..."
Parsac2: Parallel Computer Algebra On The DeskTop
, 1995
"... We give an introduction to programming methods, software systems, and algorithms, suitable for parallelizing Computer Algebra on modern multiprocessor workstations. As concrete examples we present multithreaded programming and its use in the PARSAC2 system for parallel symbolic computation, and we ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
We give an introduction to programming methods, software systems, and algorithms, suitable for parallelizing Computer Algebra on modern multiprocessor workstations. As concrete examples we present multithreaded programming and its use in the PARSAC2 system for parallel symbolic computation, and we present some examples of parallel algorithms useful for solving systems of polynomial equations.
Parallel Implementation
"... of some characteristics of softwares for parallel computer algebra. SBSH means Sugarbush. PCLBSTM means PACLIB/STURM and PCGVR PAC/GIVARO. Conclusions. Major problems that appears in the design and implementation of parallel computer algebra systems (online scheduling of tasks, distributed garbag ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
of some characteristics of softwares for parallel computer algebra. SBSH means Sugarbush. PCLBSTM means PACLIB/STURM and PCGVR PAC/GIVARO. Conclusions. Major problems that appears in the design and implementation of parallel computer algebra systems (online scheduling of tasks, distributed garbage collection) are studied in the more general context of modern parallel programming languages. Also, parallel computer algebra focus nowdays on two directions. First, a development effort has to be done to integrate a modern parallel language in a general purpose computer algebra system with its huge libraries of complex algorithms. Second, active research should be done in the design of efficient and portable parallel algorithms for more complex problems. Thierry Gautier (INRIA, LMCIMAG), Hoon Hong (NCSU), JeanLouis Roch (LMCIMAG), Gilles Villard (CNRS, LMCIMAG), Wolfgang Schreiner (RISCLinz) References ...
Parallel Computer Algebra on the DeskTop
, 1995
"... We report on the development of PARSAC2, a library of parallel algebraic algorithms designed specifically for networks of multiprocessor workstations. PARSAC2 is built upon the Sthreads system environment for multithreaded symbolic computation. Sthreads provides virtual parallelism by mapping t ..."
Abstract
 Add to MetaCart
We report on the development of PARSAC2, a library of parallel algebraic algorithms designed specifically for networks of multiprocessor workstations. PARSAC2 is built upon the Sthreads system environment for multithreaded symbolic computation. Sthreads provides virtual parallelism by mapping thousands of very lightweight processes onto the processors of a workstation. It is currently being extended with network functionality, so that heavyweight processes can be mapped across the network while preserving the Sthreads interface. The current goal of algorithm development in PARSAC is the construction of a parallel polynomial equation solver using GroebnerBases. We report on the design of a strategycompliant parallel GroebnerBasis computation with factorization. Introduction Symbolic computation is a highlevel computational task which makes it comparatively complex and slow. However, it is increasingly applied in science and engineering [FGHK94] and any significant increase i...
Parallel Buchberger Algorithms on Virtual Shared Memory KSR1
, 1994
"... We develop parallel versions of Buchbergers Gröbner Basis algorithm for a virtual shared memory KSR1 computer. A coarse grain version does Spolynomial reduction concurrently and respects the same critical pair selection strategy as the sequential algorithm. A fine grain version parallelizes polynom ..."
Abstract
 Add to MetaCart
We develop parallel versions of Buchbergers Gröbner Basis algorithm for a virtual shared memory KSR1 computer. A coarse grain version does Spolynomial reduction concurrently and respects the same critical pair selection strategy as the sequential algorithm. A fine grain version parallelizes polynomial reduction in a pipeline and can be combined with the parallel Spolynomial reduction. The algorithms are designed for a virtual shared memory architecture and a dynamic memory management with concurrent garbage collection implemented in the MAS computer algebra system. We discuss the achieved speedup figures for up to 24 processors on some standard examples.