Skip to main content
SpringerLink
Log in

A master-slave approach to parallel term rewriting on a hierarchical multiprocessor

  • Conference paper
  • First Online:
Design and Implementation of Symbolic Computation Systems (DISCO 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1128))

Abstract

We report on a parallel implementation of an unfailing term completion procedure on a network of multiprocessor workstations. Our parallelization concept integrates distributed search parallelism on the network, based on a master-slave approach, with the parallel execution of each search on a multiprocessor. Both levels of parallelism are realized by a uniform fork /join paradigm using multi-threading. In many of our examples we are able to combine the benefits of distributed and shared-memory approaches for superior overall speed-ups.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Anantharaman and N. Andrianarievelo. Heuristical criteria in refutational theorem proving. In A. Miola, editor, Design and Implementation of Symbolic Computation Systems, 1994. Springer-Verlag.

    Google Scholar 

  2. G. Attardi and C. Traverso. A strategy-accurate parallel Buchberger algorithm. In Hong [19].

    Google Scholar 

  3. J. Avenhaus and J. Denzinger. Distributing equational theorem proving..

    Google Scholar 

  4. L. Bachmair, N. Dershowitz, and D. Plaisted. Completion without failure. In H. Aït-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, volume 2 of Rewriting Techniques, chapter 1. Academic Press, 1989.

    Google Scholar 

  5. M. Bonacina and J. Hsiang. Distributed Deduction by Clause-Diffusion: Distributed Contraction and the Acquarius Prover. J. Symbolic Computation, 19(1/2/3), 1995.

    Google Scholar 

  6. M. Bonacina and J. Hsiang. Completion procedures as semidecision procedures. In S. Kaplan and M. Okada, editors, Conditional Term Rewriting Systems, 1990. Springer-Verlag.

    Google Scholar 

  7. M. Bonacina and J. Hsiang. Parallelization of deduction strategies: An analytical study. J. Automated Reasoning, 13:1–33, 1994.

    Google Scholar 

  8. T. Bubeck, M. Hiller, W. Küchlin, and W. Rosenstiel. Distributed symbolic computation with DTS. In A. Ferreira and J. Rolim, editors, Parallel Algorithms for Irregularly Structured Problems, 2nd Intl. Workshop, IRREGULAR'95, 1995.

    Google Scholar 

  9. R. Bündgen. Reduce the redex → ReDuX..

    Google Scholar 

  10. R. Bündgen, M. Göbel, and W. Küchlin. A fine-grained parallel completion procedure. In J. von zur Gathen and M. Giesbrecht, editors, Proc. 1994 International Symposium on Symbolic and Algebraic Computation: ISSAC'94, 1994. ACM Press.

    Google Scholar 

  11. R. Bündgen, M. Göbel, and W. Küchlin. Multi-threaded AC term rewriting. In Hong [19].

    Google Scholar 

  12. R. Bündgen, M. Göbel, and W. Küchlin. Parallel ReDuX → PaReDuX. In J. Hsiang, editor, Rewriting Techniques and Applications, 6th Intl. Conf., RTA-95, 1995. Springer-Verlag.

    Google Scholar 

  13. R. Bündgen, M. Göbel, and W. Küchlin. Strategy compliant multi-threaded term completion. J. Symbolic Computation, 1996. To appear.

    Google Scholar 

  14. J. Denzinger. Teamwork: Eine Methode zum Entwurf verteilter, wissensbasierter Theorembeweiser. PhD thesis, Universität Kaiserslautern, 1993.

    Google Scholar 

  15. J. Denzinger and D. Fuchs. Goal oriented equational theorem proving using teamwork. In Proc. 18th KI-94, 1994. Springer-Verlag.

    Google Scholar 

  16. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Formal Models and Semantics, volume 2 of Handbook of Theoretical Computer Science, chapter 6. Elsevier, 1990.

    Google Scholar 

  17. B. Fronhöfer and G. Wrightson, editors. Parallelization in Inference Systems, 1990. Springer-Verlag.

    Google Scholar 

  18. M. Fuchs. Learning proof heuristics by adapting parameters. Technical report, Fachbereich Informatik, Universiät Kaiserslautern, 1995.

    Google Scholar 

  19. H. Hong, editor. First Intl. Symp. Parallel Symbolic Computation PASCO'94, 1994. World Scientific.

    Google Scholar 

  20. J. Hsiang and M. Rusinowitch. On word problems in equational theories. In T. Ottmann, editor, Automata, Languages and Programming, 1987. Springer-Verlag.

    Google Scholar 

  21. C. Kirchner, editor. Rewriting Techniques and Applications, volume 690 of LNCS, Montreal, Canada, 1993. Springer-Verlag.

    Google Scholar 

  22. C. Kirchner and P. Viry. Implementing parallel rewriting. In Fronhöfer and Wrightson [17].

    Google Scholar 

  23. D. Knuth and P. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebra. Pergamon Press, 1970.

    Google Scholar 

  24. W. Küchlin. A theorem-proving approach to the Knuth-Bendix completion algorithm. In J. Calmet, editor, Computer Algebra, 1982. Springer-Verlag.

    Google Scholar 

  25. W. Küchlin. PARSAC-2: A parallel SAC-2 based on threads. In S. Sakata, editor, Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes: 8th International Conference, AAECC-8, 1990. Springer-Verlag.

    Google Scholar 

  26. W. Küchlin. The S-threads environment for parallel symbolic computation. In R. Zippel, editor, Computer Algebra and Parallelism, 1992. Springer-Verlag.

    Google Scholar 

  27. W. Küchlin. PARSAC-2: Parallel computer algebra on the desk-top. In J. Fleischer, J. Grabmeier, F. Hehl, and W. Küchlin, editors, Computer Algebra in Science and Engineering, 1995. World Scientific.

    Google Scholar 

  28. W. Küchlin and J. Ward. Experiments with virtual C Threads. In Proc. Fourth IEEE Symp. on Parallel and Distributed Processing, 1992. IEEE Press.

    Google Scholar 

  29. E. Lusk and W. McCune. Experiments with ROO, a parallel automated deduction system. In Fronhöfer and Wrightson [17].

    Google Scholar 

  30. E. Lusk and R. Overbeek. Reasoning about equality. J. Automated Reasoning, 1:209–228, 1985.

    Google Scholar 

  31. P. Maier, M. Göbel, and R. Bündgen. Multi-threaded unfailing completion. Technical Report WSI 95-06, Universität Tübingen, D-72076 Tübingen, 1995.

    Google Scholar 

  32. J. Schumann. SiCoTHEO — simple competive parallel theorem provers based on SETHEO. 1995. Proc. PPAI'95, Montreal, Canada, 1995.

    Google Scholar 

  33. V. Sunderam. PVM: A framework for parallel distributed computing. Concurrency: Practice and Experience, 2(4):315–339, 1990.

    Google Scholar 

  34. G. Sutcliffe, C. Suttner, and T. Yemenis. The TPTP problem library. In A. Bundy, editor, Automated Deduction-CADE-12, 1994. Springer-Verlag.

    Google Scholar 

  35. C. Suttner and J. Schumann. Parallel automated theorem proving. In L. Kanal, V. Kumar, H. Kitano, and C. Suttner, editors, Parallel Processing for Artificial Intellegence. Elsevier, 1994.

    Google Scholar 

  36. A. Tarski. Logic, Semantics, Metamathematics. Oxford University Press, 1956.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut, Universität Tübingen, Sand 13, D-72076, Tübingen, Germany

    Reinhard Bündgen, Manfred Göbel & Wolfgang Küchlin

Authors
  1. Reinhard Bündgen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manfred Göbel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wolfgang Küchlin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jacques Calmet Carla Limongelli

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bündgen, R., Göbel, M., Küchlin, W. (1996). A master-slave approach to parallel term rewriting on a hierarchical multiprocessor. In: Calmet, J., Limongelli, C. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1996. Lecture Notes in Computer Science, vol 1128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61697-7_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-61697-7_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61697-9

  • Online ISBN: 978-3-540-70635-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation