article

Free access

KCM: a knowledge crunching machine

Authors:

M. Dorochevsky,

G. WatzlawikAuthors Info & Claims

ACM SIGARCH Computer Architecture News, Volume 17, Issue 3

Pages 186 - 194

https://doi.org/10.1145/74926.74947

Published: 01 April 1989 Publication History

Abstract

KCM (Knowledge Crunching Machine) is a high-performance back-end processor which, coupled to a UNIX^* desk-top workstation, provides a powerful and user-friendly Prolog environment catering for both development and execution of significant Prolog applications. This paper gives a general overview of the architecture of KCM stressing some new features like a 64-bit tagged architecture, shallow backtracking and an original memory management unit. Some early benchmark results obtained on prototype machines are presented. They show that KCM, which runs at a peak speed of 833 Klips on list concatenation, compares favorably with other dedicated Prolog machines and available commercial systems running on fast general purpose processors.

References

[1]

H. Benker. J. Noye. G. Watzlawik. ICM4. Technical report CA-25 ECRC, February, 1987.

[2]

Gaetano Borriello. Andrew R. Cherenson, Peter 8. Danzig and Michael N. Nelson. RISC vs. ClSCs for Probg: A Case Study. ASPLOS II. IEEE Computer Society, Cctober. 1987, pp. 136-l 45.

Digital Library

[3]

Tep Dobry. A Coprocessor for Al; LISP, Prolog and Data Bases. Proceedings of Spring Compcon' 87, IEEE Computer Society, February, 1987, pp. 396902.

[4]

T.P. Dobry, A.M. Despain and Y.N. Patt. Performance Studies of a Prolog Machine Architecture. The 12th Annual International Symposium on Computer Architecture, IEEE/ACM, June, 1965. pp. 160 - 190.

Digital Library

[5]

John Gabriel, Tim Lindholm. E.L Lusk, R.A Chrerbeek. A Tutorial on the Warren Abstract Machine for Computational Logic. ANL-64-64, Argonne National Laboratory, June, 1985.

[6]

S. Habata, R. Nakaxaki, A Konagaya, A Atarashi and M. Umemura. Co-Operative High Performance Sequential Inference Machine: CHI. Proceedings of ICCD'87. New York, 1987.

[7]

M. Hill, S. Eggers, J. Larus, G. Taybr, G. Adams, B.K. Bose, G. Gibson, P. Hansen, J. Keller, S. Kong, C. Lee, D. Lee, J. Pendleton. S. Ritchie, D. Wood, B. ibrn, p. Hilfinger, D. Hodges, R. Kerz, J. Ousterhout and D. Patterson. -Design Decisions in SPUR. computer 19 (November 1966), 8-22.

Digital Library

[8]

M. Meier, P. Dufresne, A Herold, D. de Villeneuve. Sepia: An Extendible Prolog System. To appear in the proceedings of IFlP89.

[9]

S. Kawakita, M. Saito, Y. Hoshino, Y. Bandai, Y. Kobayashi. An Integrated Al Environment for Industrial Expert Systems. International Workshop on Al for Industrial Applications 1968, IEEE Computer Society, 1988, pp. 258-263.

[10]

K. Kurosawal S. Yamaguchil S. Abel' T. Bandoh. Instruction Architecture for a High Performance tntegrated Prolog Processor IPP. Proceedings of the 5th International Conference L Symposium on Logic Programming, Hitachi Research Lab., August, 1988, pp. 1507-1530.

[11]

Hiroshi Nakashima and Katsuto Nakajima. Hardware architecture of the sequential inference machine: PSI-II. Proceedings - 1987 Symposium on Logic Programming, IEEE Computer Society, September, 1987. pp. 104 - 113.

[12]

J. Noye. J.C. Syre, et al. ICM3: Design and evaluation of an Inference Crunching Machine. Database Machines and Knowledge Base Machines, October, 1967, pp. p. 3-l 6.

[13]

M. Meier. Shalbw Backtracking in Prolog Programs. Technical Report TR-LP. ECRC, February, 1987.

[14]

A. Pudner. DLM - A Powerful Al Computer For Embedded Expert Systems. Frontiers in Computing, December, 1987, pp. 187 - 201.

[15]

M.L Ross, K. Rammaohanarao. Paging strategy for Prolog based on dynamic virtual memory. TR 86/8, University of Melbourne, August, 1986.

[16]

Leon Sterling and Ehud Shapiro. Advanced Prvgrammiw Techniques. Volume I: The Arf of Prog. The MIT Press, 1986.

Digital Library

[17]

Evan lick Frwtiers in Logk Pmgmmming Architecture and Machine De&n. Volume I: Memory Petfonnance of Prolog Atchiteduros. Kluwer Academic Publishers, 1988.

[18]

Herve Touati and Alvin Despain. An empirical study of the Warren Abstract Machine. Proceedings - 1987 Symposium on Logii Programming, IEEE Computer Society, September, 1987, pp. 114 - 124.

[19]

David H.D. Warren. Implementing Prolog. 49 and 50, University of Edinburgh, May, 1977.

[20]

David H. D. Warren. An abstract prolog instruction set. tn309. SRI. October. 1983.

[21]

A. Yamamoto. M. Mitsui. M. Yokota, K. Nakajiama. The Program Characteristics in Logic Programming Language ESP. OKI Electric, 1966.

Cited By

Jero SBurow NWard BSkowyra RKhazan RShrobe HOkhravi H(2022)TAG: Tagged Architecture GuideACM Computing Surveys10.1145/353370455:6(1-34)Online publication date: 11-May-2022
https://dl.acm.org/doi/10.1145/3533704
Rodohan DGlover RJalowiecki I(1994)An Implementation Of A Set Mode For Prolog On A Parallell Associative ProcessorProceedings. Second Euromicro Workshop on Parallel and Distributed Processing10.1109/EMPDP.1994.592521(413-419)Online publication date: 1994
https://doi.org/10.1109/EMPDP.1994.592521
Bland RCowie JKane TRattray CWilson I(2005)Using a prolog engine to integrate multiple knowledge sources: the KCM/Help-desk projectThe Next Generation of Information Systems: From Data to Knowledge10.1007/3-540-55616-8_45(134-147)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-55616-8_45
Show More Cited By

Index Terms

KCM: a knowledge crunching machine

Recommendations

KCM: a knowledge crunching machine
ISCA '89: Proceedings of the 16th annual international symposium on Computer architecture

KCM (Knowledge Crunching Machine) is a high-performance back-end processor which, coupled to a UNIX^* desk-top workstation, provides a powerful and user-friendly Prolog environment catering for both development and execution of significant Prolog ...
Virtual machine showdown: Stack versus registers

Virtual machines (VMs) enable the distribution of programs in an architecture-neutral format, which can easily be interpreted or compiled. A long-running question in the design of VMs is whether a stack architecture or register architecture can be ...
Machine-Description Driven Compilers for EPIC and VLIW Processors

In the past, due to the restricted gate count available on an inexpensive chip, embedded DSPs have had limited parallelism, few registers and irregular, incomplete interconnectivity. More recently, with increasing levels of integration, embedded VLIW ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGARCH Computer Architecture News

ACM SIGARCH Computer Architecture News Volume 17, Issue 3

Special Issue: Proceedings of the 16th annual international symposium on Computer Architecture

June 1989

400 pages

ISSN:0163-5964

DOI:10.1145/74926

Editor:
Jean-Claude Syre

Issue’s Table of Contents

ISCA '89: Proceedings of the 16th annual international symposium on Computer architecture
April 1989
426 pages
ISBN:0897913191
DOI:10.1145/74925
Chairman:
Jean-Claude Syre

Copyright © 1989 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1989

Published in SIGARCH Volume 17, Issue 3

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
741
Total Downloads

Downloads (Last 12 months)266
Downloads (Last 6 weeks)31

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Jero SBurow NWard BSkowyra RKhazan RShrobe HOkhravi H(2022)TAG: Tagged Architecture GuideACM Computing Surveys10.1145/353370455:6(1-34)Online publication date: 11-May-2022
https://dl.acm.org/doi/10.1145/3533704
Rodohan DGlover RJalowiecki I(1994)An Implementation Of A Set Mode For Prolog On A Parallell Associative ProcessorProceedings. Second Euromicro Workshop on Parallel and Distributed Processing10.1109/EMPDP.1994.592521(413-419)Online publication date: 1994
https://doi.org/10.1109/EMPDP.1994.592521
Bland RCowie JKane TRattray CWilson I(2005)Using a prolog engine to integrate multiple knowledge sources: the KCM/Help-desk projectThe Next Generation of Information Systems: From Data to Knowledge10.1007/3-540-55616-8_45(134-147)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-55616-8_45
Letz RStenz G(2001)Model elimination and connection tableau proceduresHandbook of automated reasoning10.5555/778522.778537(2015-2112)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.5555/778522.778537
De Gloria AFaraboschi P(1992)Instruction-level parallelism in PrologACM SIGARCH Computer Architecture News10.1145/146628.13973020:2(224-233)Online publication date: 1-Apr-1992
https://dl.acm.org/doi/10.1145/146628.139730
De Gloria AFaraboschi PGottlieb A(1992)Instruction-level parallelism in PrologProceedings of the 19th annual international symposium on Computer architecture10.1145/139669.139730(224-233)Online publication date: 19-May-1992
https://dl.acm.org/doi/10.1145/139669.139730
Holmer BSano BCarlton MVan Roy PHaygood RBush WDespain APendleton JDobry TBaer JSnyder LGoodman J(1990)Fast Prolog with an extended general purpose architectureProceedings of the 17th annual international symposium on Computer Architecture10.1145/325164.325154(282-291)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/325164.325154
Holmer BSano BCarlton MVan Roy PHaygood RBush WDespain APendleton JDobry T(1990)Fast Prolog with an extended general purpose architectureACM SIGARCH Computer Architecture News10.1145/325096.32515418:2SI(282-291)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/325096.325154

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Issue’s Table of Contents