This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
High-Speed CAM-Based Architecture for a Prolog Machine (ASCA)
November 1988 (vol. 37 no. 11)
pp. 1375-1383
ASCII Text
x 
 
J. Naganuma, T. Ogura, S.-I. Yamada, T. Kimura, "High-Speed CAM-Based Architecture for a Prolog Machine (ASCA)," IEEE Transactions on Computers, vol. 37, no. 11, pp. 1375-1383, November, 1988.
 
 
BibTex
x
 
@article{ 10.1109/12.8703,
author = {J. Naganuma and T. Ogura and S.-I. Yamada and T. Kimura},
title = {High-Speed CAM-Based Architecture for a Prolog Machine (ASCA)},
journal ={IEEE Transactions on Computers},
volume = {37},
number = {11},
issn = {0018-9340},
year = {1988},
pages = {1375-1383},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.8703},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - High-Speed CAM-Based Architecture for a Prolog Machine (ASCA)
IS - 11
SN - 0018-9340
SP1375
EP1383
EPD - 1375-1383
A1 - J. Naganuma,
A1 - T. Ogura,
A1 - S.-I. Yamada,
A1 - T. Kimura,
PY - 1988
KW - Prolog; content addressable memory; high-speed Prolog machine; Prolog execution performance; CAM-based backtracking scheme; CAM-based backtracking; garbage collection function; semantic information; inference depth; 100 KLIPS; deterministic append program; content-addressable storage; logic programming; performance evaluation; storage management.
VL - 37
JA - IEEE Transactions on Computers
ER -
 
A content addressable memory (CAM)-based machine architecture is proposed for a high-speed Prolog machine. This Prolog machine attempts to speed up the total Prolog execution performance by using a hierarchical pipelined scheme and a CAM-based backtracking scheme. The hierarchical pipelined scheme reduces the total number of Prolog execution steps to half of that using the conventional method.

[1] R. Kowalski,Logic for Problem Solving. New York: North-Holland, 1979.
[2] W. F. Clocksin and C. S. Mellish,Programming in Prolog. New York: Springer-Verlag, 1984.
[3] J. A. Robinson, "A machined-oriented logic based on the resolution principle,"J. Assoc. Comput. Mach., vol. 12, no. 1, pp. 23-41, Jan. 1965.
[4] D. H. D. Warren, "Implementing Prolog--Compiling predicate logic programs," Dep. Artif. Intell., Univ. Edinburgh, Res. Rep. 39 and 40, 1977.
[5] K. Takiet al., "Hardware design and implementation of the personal sequential inference machine (PSI)," inProc. Int. Conf. FGCS'84, Nov. 1984, pp. 398-409.
[6] N. Tamuraet al., "Sequential Prolog machine PEK," inProc. Int. Conf. FGCS'84, Nov. 1984, pp. 542-550.
[7] N. S. Woo, "A hardware unification unit: Design and analysis," inProc. 12th Annu. Symp. Comput. Architecture, June 1985, pp. 198-205.
[8] R. Nakazawaet al., "Design of a high-speed Prolog Machine (HPM)," inProc. 12th Annu. Symp. Comput. Architecture, June 1985, pp. 191-197.
[9] E. Tick and D. H. D. Warren, "Towards a pipeline Prolog processor," inProc. 1984 Int. Symp. Logic Programming, Feb. 1984, pp. 29- 40.
[10] T. P. Dobryet al., "Performance studies of a Prolog machine architecture," inProc. 12th Annu. Symp. Comput. Architecture, June 1985, pp. 180-190.
[11] D. H. D. Warren, "An abstract Prolog instruction set," Tech. Note 309, Artif. Intell. Center, SRI Int., Oct. 1983.
[12] K. Nakamura, "Associative evaluation of Prolog programs," WGSYM21-4-4, Inform. Processing Soc. Japan, Dec. 1982. Available as inImplementations of Prolog, C. A. Campbell, Ed. Chichester: Ellis Horwood, 1984, pp. 135-146.
[13] P. Robinson, "The SUM: An AI coprocessor,"Byte, vol. 10, pp. 169-180, June 1985.
[14] J. V. Oldfield and S. Mem, "Logic programs and an experimental architecture for their execution,"IEE Proc., vol. 133, pt. E, pp. 163- 167, May 1986.
[15] Y. Chu and K. Itano, "Architecture for a parallel associative Prolog machine," inProc. 19th Annu. Hawaii Int. Symp. Syst. Sci., Jan. 1986, pp. 9-23.
[16] I. Robinson, "A Prolog processor based on a pattern matching memory device," inProc. 3rd Int. Conf. Logic Programming, July 1986, pp. 172-179.
[17] H. Yasuuraet al., "A hardware algorithm for unification on logic programming languages," WGEC84-67-2, Instit. Electron. Inform. Commun. Eng., Japan, Mar. 1985.
[18] T. Oguraet al., "A 4-bit associative memory LSI,"IEEE J. Solid-State Circuits, vol. SC-20, pp. 1277-1282, Dec. 1985.
[19] T. Oguraet al., "A 20-kbit CMOS associative memory LSI for artificial intelligence machines," inProc. Int. Conf. Comput. Design, Oct. 1986, pp. 574-577.
[20] "MPROLOG Language Reference--Release 2.1," Logicware Inc. licensed by SzKI Hungary, Sept. 1985.
[21] E. Y. Shapiro, "A subset of concurrent Prolog and its interpreter," Tech. Rep. TR-003, Instit. for New Generation Comput. Technol., Jan. 1983.

Index Terms:
Prolog; content addressable memory; high-speed Prolog machine; Prolog execution performance; CAM-based backtracking scheme; CAM-based backtracking; garbage collection function; semantic information; inference depth; 100 KLIPS; deterministic append program; content-addressable storage; logic programming; performance evaluation; storage management.
Citation:
J. Naganuma, T. Ogura, S.-I. Yamada, T. Kimura, "High-Speed CAM-Based Architecture for a Prolog Machine (ASCA)," IEEE Transactions on Computers, vol. 37, no. 11, pp. 1375-1383, Nov. 1988, doi:10.1109/12.8703
Usage of this product signifies your acceptance of the Terms of Use.