Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Parallel unification: Theory and implementations

  • Conference paper
  • First Online:
Parallelization in Inference Systems

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 590))

  • 166 Accesses

Abstract

This Chapter deals with parallel unification architectures and algorithms. We show how parallel unification can be exploited and we review a parallel unification algorithm. Static scheduling, binding environment, and memory representation of terms are also discussed. Finally, we review some of the parallel unification projects.

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. Dwork, C. et al.,“On the Sequential Nature of Unification,ℍ J. Logic Programming, vol. 1(1), pp. 35–50, June 1984.

    Google Scholar 

  2. Yasuura, H.,“On Parallel Computational Complexity of Unification,ℍ Proc. of the Int. Conf. on Fifth Generation Computer Systems,ℍ Tokyo, Japan, pp. 235–248, Nov. 1984.

    Google Scholar 

  3. Citrin, W.,“Parallel Unification Scheduling in Prolog,ℍ Ph.D. Dissertation, EECS Dept., University of California, Berkeley, 1988.

    Google Scholar 

  4. Robinson, J.A.,“A Machine-Oriented Logic Based on the Resolution Principle,ℍ J. of the ACM, vol. 12 (1), pp. 23–41, Jan. 1965.

    Google Scholar 

  5. Knight, K.,“Unification:A Multidisciplinary Survey,ℍ ACM Computing Surveys, vol. 21 (1), pp. 93–124, March 1989.

    Google Scholar 

  6. Paterson, M. S., and Wegman, M. N.,“Linear Unification,ℍ J. of Computer and Sys. Sciences, vol. 16 (2), pp. 158–167, April 1978.

    Google Scholar 

  7. De Champeaux, Dennis,“About the Paterson-Wegman Linear Unification Algorithm,ℍ J. of Computer and Sys.Sciences, vol. 32 (1), pp. 79–90, Feb. 1986.

    Google Scholar 

  8. Martelli, A., and Montanari, U.,“An Efficient Unification Algorithm,ℍ ACM Trans. on Prog. Lang. and Sys., vol. 4(2), pp. 258–282, April 1982.

    Google Scholar 

  9. Martelli, A., and Rossi, G., “Efficient Unification with Infinite Terms in Logic Programming,ℍ Proc. International Conf. on Fifth Generation Computer Systems, Tokyo, Japan, 1984.

    Google Scholar 

  10. Boriello, G., Cherenson, A., Danzig, P., and Nelson, M., “RISCs vs. CISCs for Prolog: A Case Study,ℍ Proc. of 2nd Int. Conf. on Architectural Support for Prog. Lang. and Operating Sys., Palo Alto, CA, Oct. 1987, pp. 136–145.

    Google Scholar 

  11. Diel, H., Lenz, N., and Welsch, H.,“An Experimental Computer Architecture for Supporting Expert Systems and Logic Programming,ℍ IBM J. of Research and Development, vol. 30 (1), Jan. 1986.

    Google Scholar 

  12. Taki, K. et al., “Hardware Design and Implementation of the Personal Sequential Inference Machine (PSI),ℍ Proc. International Conf. on Fifth Generation Computer Systems, Tokyo, Japan, 1984.

    Google Scholar 

  13. Carlsson, M., “A Microcoded Unifier for Lisp Machine Prolog,ℍ Proc. of the 2nd Symp. on Logic programming, July 1985.

    Google Scholar 

  14. Dobry, T., “A Prolog Machine Architecture,ℍ Ph.D. Dissertation, EECS Dept., University of California, Berkeley, May 1987. Also available as Tech. Report UCB/CSD 87/352.

    Google Scholar 

  15. Woo, N. S.,“A Hardware Unification Unit: Design and Analysis,ℍ 12th An. Int. Symp. on Computer Architecture, Boston, MA, pp. 198–205, June 1985.

    Google Scholar 

  16. Woo, N. S.,“The Architecture of the Hardware Unification Unit and an Implementation,ℍ Proc. 18th An. Workshop on Microprogramming, Pacific Grove, CA, pp. 89–98, 1985.

    Google Scholar 

  17. Chang, S.,“Towards a Theorem Proving Architecture,ℍ M.S. Thesis, CS Dept., California Institute of Technology, Pasadena, CA, 1981.

    Google Scholar 

  18. Robinson, P.,“The SUM:An AI Coprocessor,ℍ Byte, vol. 10(6), pp. 169–180, June 1985.

    Google Scholar 

  19. Gollakota, R.,“Design and Analysis of UNIFIC: A Coprocessor for the Unification Algorithm,ℍ M.S. Thesis, Dept. of EE, Texas A & M University, College Station, TX, August 1986.

    Google Scholar 

  20. Parikh, P.,“VLSI Design of the Controller for the UNIFIC — A Prolog Unification Coprocessor,ℍ M.S. Thesis, Dept. of EE, Texas A&M University, College Station, TX, May 1987.

    Google Scholar 

  21. Maluszynski, J., and Komorowski, H., “Unification-free execution of Horn-Clause Programs,ℍ Proc. of 2nd Logic Programming Symp., N.Y., 1985.

    Google Scholar 

  22. Ramesh, R. et al., “Term Matching on Parallel Computers,ℍ J. Logic Programming, vol. 6, pp. 213–228, 1989.

    Google Scholar 

  23. Vitter, J., and Simons, R.,“New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P,ℍ IEEE Trans. on Comp., vol. C-35 (5), pp. 403–418, May 1986.

    Google Scholar 

  24. Harland, J., and Jaffar, J., “On Parallel Unification for Prolog,ℍ New Generation Comp., vol. 5, 1987.

    Google Scholar 

  25. Robinson, J. A.,“Natural and Artificial Reasoning,ℍ in Natural and Artificial Parallel Computation, M. Arbib and J. A. Robinson, EDs., MIT Press, pp. 277–309, 1990.

    Google Scholar 

  26. Sibai, Fadi N., “A Parallel Machine for the Unification Algorithm: Design, Simulation, and Performance Evaluation,ℍ Ph.D. Dissertation, Dept. of EE, Texas A & M University, College Station, TX, December 1989.

    Google Scholar 

  27. Sibai, F. N., Watson, K. L., and Lu, M., “A Parallel Unification Machine,ℍ IEEE MICRO, Vol. 10 (4), pp.21–33, August 1990.

    Google Scholar 

  28. Sibai, F. N.,“Parallel Unification with Distributed Memory,ℍ The International Journal of Mini and Microcomputers, Vol. 12 (3), pp.113–118, 1990.

    Google Scholar 

  29. Sibai, F. N., “On Memory Organizations for Match Parallelism in Parallel Unification,ℍ submitted for publication.

    Google Scholar 

  30. Kale, L. V., Ramkumar, B., and Shu, W., “A Memory Organization Independent Binding Environment for AND and OR Parallel Execution of Logic Programs,ℍ Proc. of the fifth Int. Conf. and Symp. on Logic Programming, vol. II, MIT Press, pp. 1223–1240, 1988.

    Google Scholar 

  31. Robinson, Ian, “A Prolog Processor Based on a Pattern Matching Memory Device,ℍ Proc. of 3rd Conf. on Logic Programming,ℍ London, U.K., pp. 172–179, July 1986.

    Google Scholar 

  32. Chang, J.,“High Performance Execution of Prolog Programs Based on a Static Data Dependency Analysis,ℍ Ph.D. Dissertation, EECS Dept., University of California, Berkeley, October 1985.

    Google Scholar 

  33. Delcher, A., and Kasif, S., “Some Results on the Complexity of Exploiting Data Dependency in Parallel Logic Programs,ℍ J. Logic Programming, vol. 6, pp. 229–241, 1989.

    Google Scholar 

  34. Singhal, A., and Patt, Y. N.,“A High Performance Prolog Processor with Multiple Function Units,ℍ Proc. 16th AN. Int. Symp. on Comp. Architecture, Jerusalem, pp. 195–202, 1989.

    Google Scholar 

  35. Singhal, A., and Patt, Y. N., “Unification Parallelism: How Much Can We Exploit ?,ℍ Proc. of the North American Conf. on Logic Programming, vol. II, MIT Press, pp. 1135–1147, 1989.

    Google Scholar 

  36. Inagawa, M. et al.,“Unification Parallelism for Prolog Processing,ℍ Sys. and Comp. in Japan, vol. 19 (1), pp. 37–46, Jan. 1988.

    Google Scholar 

  37. Shobatake, Y., and Aiso, H.,“The Unification Processor Based on a Uniformly Structure Cellular Hardware,ℍ Proc. 13th An. Int. Symp. on Comp. Architecture, Tokyo, Japan, pp. 140–148, June 1986.

    Google Scholar 

  38. Shobatake, Y., and Aiso, H.,“A Prolog Machine Based on VLSI Algorithms,ℍ Sys. and Comp. in Japan, vol. 20 (2), pp. 15–24, 1989.

    Google Scholar 

  39. Chen, W., and Hsieh, K,“ An overlapping Unification Algorithm and its Hardware Implementation,ℍ Proc. Int. Conf. on Parallel Processing, University Park, PA, pp. 803–805, 1987.

    Google Scholar 

  40. Singhal, A.,“PUP: An Architecture to Exploit Parallel Unification in Prolog,ℍ M.S. Thesis, EECS Dept., University of California, Berkeley, 1987.

    Google Scholar 

  41. Shih, Y., and Irani, K.,“Large Scale Unification Using a Mesh-Connected Array of Hardware Unifiers,ℍ Proc. Int. Conf. on Parallel Processing, University Park, PA, pp. 787–794, 1987.

    Google Scholar 

  42. Tanabe, M., and Aiso, H.,“The Unification Processor by Pipeline Method,ℍ in Database Machines and Knowledge Base Machines, M. Kitsuregawa and H. Tanaka, EDs., Kluwer Acad. Pub., Boston, MA, pp. 627–639, 1988.

    Google Scholar 

  43. Ito, N. et al.,“Data-Flow Based Execution Mechanisms of Parallel and Concurrent Prolog,ℍ New Generation Comp., No. 3, pp. 15–41, 1985.

    Google Scholar 

  44. Beer, J., and Giloi, W.K., “POPE — A Parallel-Operating Prolog Engine,ℍ Tech. Report, GMD-FIRST/TU-Berlin.

    Google Scholar 

  45. Kogge, P. et al.,“ VLSI and Rule-Based Systems,ℍ in VLSI for Artificial Intelligence, J. Delgado-Frias and W. Moore, EDs., Kluwer, Norwell, MA, pp. 95–108, 1989.

    Google Scholar 

  46. Ng, Y. et al.,“Unify with Active Memory, ℍin VLSI for Artificial Intelligence, J. Delgado-Frias and W. Moore, EDs., Kluwer, Norwell, MA, pp. 109–118, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of Akron, 44325-3904, Akron, Ohio, USA

    Fadi N. Sibai

Authors
  1. Fadi N. Sibai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Fronhöfer G. Wrightson

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sibai, F.N. (1992). Parallel unification: Theory and implementations. In: Fronhöfer, B., Wrightson, G. (eds) Parallelization in Inference Systems. Lecture Notes in Computer Science, vol 590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55425-4_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-55425-4_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55425-7

  • Online ISBN: 978-3-540-47066-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation