ACM Home Page
Please provide us with feedback. Feedback
Design and performance measurements of a parallel machine for the unification algorithm
Full text PdfPdf (866 KB)
Source International Symposium on Microarchitecture archive
Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture table of contents
Dublin, Ireland
Pages: 21 - 30  
Year of Publication: 1989
ISBN:0-89791-324-8
Also published in ...
Authors
F. N. Sibai  Department of Electrical Engineering, Texas A&M University, College Station, Texas
L. Watson  Department of Electrical Engineering, Texas A&M University, College Station, Texas
M. Lu  Department of Electrical Engineering, Texas A&M University, College Station, Texas
Sponsors
IEEE-CS : Computer Society
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 7,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/75362.75398
What is a DOI?

ABSTRACT

Unification is known to be the most repeated operation in logic programming and PROLOG interpreters. To speed up the execution of logic programs, the performance of unification must be improved. We propose a parallel unification machine for speeding up the unification algorithm. The machine is simulated at the register transfer level and the simulation results as well as performance comparison with a serial unification coprocessor are presented.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
4
5
 
6
Paterson, M. S., Wegman, M. N., "Linear Unification," Journal Of Computer And System Sciences, vol. 16(2), pp. 158-167, April 1978.
7
 
8
Yssuura, H., ""On Parallel Computational Complexity Of Unification," in Proceedings Of The International Conference On Fifth Generation Computer Systems, pp. 235-248, Tokyo, Japan, November 1984.
 
9
 
10
Chang, S., Towards A Theorem Proving Architecture, Department Of Computer Science, California Institute Of Technology, Pasadena, CA, 1981.
 
11
Robinson, P., "The SUM: An AI Coprocessor," Byte, vol. 10(6), pp. 169-180, June 1985.
 
12
Gollakota, R., Design And Analysis Of UNIFIC: A Coprocessor For The Unification Algorithm, M. S. Thesis, Department Of Electrical Engineering, Texas A&M University, College Station, Texas, August 1986.
13
 
14
Chen, W., Hsieh, K., "An Overlapping Unification Algorithm And Its Hardware Implementation," in Proceedings Of The 1987 International Conference On Parallel Processing, pp. 803-805, University Park, Pennsylvania, 1987.
 
15
Shih, Y., Irani, K., "Large Scale Unification Using A Mesh-Connected Array Of Hardware Unifiers," in Proceedings Of The 1987 International Conference On Parallel Processing, pp. 787-794, University Park, Pennsylvania, 1987.
 
16
Inagawa, M. et al, "Unification Parallelism For Prolog Processing," Systems And Computers In Japan, vol. 19(l), pp. 37-46, January 1988.
 
17
Barbacci, M. et al, "ISPS Computer Description Language," Departments of Computer Science and Electrical Engineering, Carnegie-Mellon University, Pittsburg, Pennsylvania, 1981.


Peer to Peer - Readers of this Article have also read: