Parallelism in algebraic computation and parallel algorithms for symbolic linear systems

Authors:
Tateaki Sasaki;Yasumasa Kanada
Affiliations:
-;-
Venue:
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Year:
1981

Citing 5
Cited 2

The Algebraic Solution of Sparse Linear Systems via Minor Expansion

ACM Transactions on Mathematical Software (TOMS)
Multiprocessor Organization—a Survey

ACM Computing Surveys (CSUR)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Explicit parallelism in LISP-like languages

LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Compilation techniques for a control-flow concurrent LISP system

LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming

Parallelism and algorithms for algebraic manipulation: current work

ACM SIGSAM Bulletin
A Parallel Symbolic Computation Environment: Structures and Mechanics

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parallel execution of algebraic computation is discussed in the first half of this paper. It is argued that, although a high efficiency is obtained by parallel execution of divide-and-conquer algorithms, the ratio of the throughput to the number of processors is still small. Parallel processing will be most successful for the modular algorithms and many algorithms in linear algebra. In the second half of this paper, parallel algorithms for symbolic determinants and linear equations are proposed. The algorithms manifest a very high efficiency in a simple parallel processing scheme. These algorithms are well usable in also the serial processing scheme.