The Parallel L-Machine for Symbolic Computation

@inproceedings{Buchberger1985ThePL,
  title={The Parallel L-Machine for Symbolic Computation},
  author={B. Buchberger},
  booktitle={European Conference on Computer Algebra},
  year={1985}
}
  • B. Buchberger
  • Published in
    European Conference on…
    1985
  • Computer Science
In this lecture we report on the present state of a parallel machine project pursued in the CAMP-LINZ working group since 1978 (see (Buchberger 1978)). Four basic components have been developed that can be combined f lex ib ly for building large parallel machines of arbitrary interconnection topology (Buchberger 1983). On these machines the parallelism inherent in (symbolic) algorithms should be completely exploitable. For example, in (Bibel, Buchberger 19B4) and (Aspetsberger 1985) some… Expand
12 Citations
Bounded parallelism in computer algebra
  • 28
  • PDF
A case study of multi-threaded Gröbner basis completion
  • 42
Applying parallel/distributed computing to advanced algebraic computations
  • Iyad A. Ajwa, P. Wang
  • Computer Science
  • Proceedings of the IEEE 1997 National Aerospace and Electronics Conference. NAECON 1997
  • 1997
  • 7
Relaxation and Hybrid Approaches for E cient Polynomial Basis Computation onDistributed Memory Machines
A case study of Grid Computing and computer algebra: parallel Gröbner Bases and Characteristic Sets
  • Iyad A. Ajwa
  • Computer Science
  • The Journal of Supercomputing
  • 2007
  • 4
  • Highly Influenced
...
1
2
...

References

SHOWING 1-3 OF 3 REFERENCES
The L-Language for the Parallel L-Machine
  • 4
Towards a connection machine for logical inference
  • 16
Substitution Expressions: Extracting Solutions of Non-Horn Clause Proofs
  • K. Aspetsberger
  • Mathematics, Computer Science
  • European Conference on Computer Algebra
  • 1985
  • 3