Optimal speedups for parallel pattern matching in trees
on Rewriting techniques and applications
Journal of Symbolic Computation
Critical pair criteria for completion
Journal of Symbolic Computation
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
The portable common runtime approach to interoperability
SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
Parallelizing the closure computation in automated deduction
CADE-10 Proceedings of the tenth international conference on Automated deduction
Simulating Buchberger's algorithm by Knuth-Bendix completion
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Handbook of theoretical computer science (vol. B)
Completion of integral polynomials by AC-term completion
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
On the multi-threaded computation of integral polynomial greatest common divisors
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Modern operating systems
Implementing an irregular application on a distributed memory multiprocessor
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Handbook of logic in computer science (vol. 2)
Extended parallelism in the Gro¨bner basis algorithm
International Journal of Parallel Programming
Equational reasoning and term rewriting systems
Handbook of logic in artificial intelligence and logic programming (vol. 1)
PARSAC-2: A Parallel SAC-2 Based on Threads
AAECC-8 Proceedings of the 8th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The computation of Gröbner bases on a shared memory multiprocessor
DISCO '90 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Buchberger's Algorithm: The Term Rewriter's Point of View (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Distributing Equational Theorem Proving
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
The Design of the PACLIB Kernel for Parallel Algebraic Computation
Proceedings of the Second International ACPC Conference on Parallel Computation
The S-Threads Environment for Parallel Symbolic Computation
Proceedings of the Second International Workshop on Computer Algebra and Parallelism
A Parallel Completion Procedure for Term Rewriting Systems
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
An Abstract Concurrent Machine for Rewriting
Proceedings of the Second International Conference on Algebraic and Logic Programming
Some reduction strategies for algebraic term rewriting
ACM SIGSAM Bulletin
A note on leftmost innermost term reduction
ACM SIGSAM Bulletin
A case study of multi-threaded Gröbner basis completion
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Component-level parallelization of triangular decompositions
Proceedings of the 2007 international workshop on Parallel symbolic computation
| Hi-index | 0.00 |
We present a parallel Knuth-Bendix completion algorithm where the inner loop, deriving the consequences of adding a new rule to the system, is multi-threaded. The selection of the best new rule in the outer loop, and hence the completion strategy, is exactly the same as for the sequential algorithm. Our implementation, which is within the PARSAC-2 parallel symbolic computation system, exhibits good parallel speedups on a standard multi-processor workstation.