Strategy compliant multi-threaded term completion

We report on the design, implementation, and performance, of the parallel term-rewriting system PaReDuX. We discuss the parallelization of three term completion procedures: Knuth-Bendix completion, completion module AC, and unfailing completion. Our parallelization is strategy-compliant, i.e., the parallel code performs exactly the same work as the sequential code, but the work load is shared by many processors. PaReDuX is designed for shared memory parallel architectures, such as multi-processor workstations, where it shows good performance on a variety of examples. (C) 1996 Academic Press Limited