Strategy compliant multi-threaded term completion

被引：4

作者：

Bundgen, R

Gobel, M

Kuchlin, W

机构：

[1] Wilhelm-Schickard-Institut fur I., Universität Tübingen, 72076 Tubingen

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 1996年 / 21卷 / 4-6期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1006/jsco.1996.0027

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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

引用

页码：475 / 505

页数：31

共 59 条

[11]

Buchberger B, 1965, PH.D. thesis

[12]

Bundgen R., 1995, Rewriting Techniques and Applications. 6th International Conference, RTA-95. Proceedings, P408

[13]

Bundgen R., 1993, Rewriting Techniques and Applications. 5th International Conference, RTA-93 Proceedings, P446

[14]

Bundgen R., 1991, Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation. ISSAC '91, P70, DOI 10.1145/120694.120704

[15]

BUNDGEN R, 1992, LECT NOTES COMPUT SC, V623, P380

[16]

BUNDGEN R, 1994, 9405 U TUB W SCHICK

[17]

BUNDGEN R, 1994, P 1994 INT S SYMB AL, P269

[18]

CHAKRABARTI S, 1993, SIGPLAN NOTICES, V28, P169, DOI 10.1145/173284.155350

[19]

Christian J., 1989, Rewriting Techniques and Applications. 3rd International Conference, RTA-89. Proceedings, P551

[20]

COOPER EC, 1988, CMUCS88154 CARN U CO

← 1 2 3 4 5 6 →