Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Hardware memory management for large knowledge bases

  • Conference paper
  • First Online:
PARLE Parallel Architectures and Languages Europe (PARLE 1987)

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

  • 125 Accesses

Abstract

Large knowledge bases form an important applications area for parallel architectures. The special problems of this domain concern the movement and protection of large amounts of complex data in a hierarchy of storage devices and processing elements, in a manner which is sympathetic to the logical structure of the information. This structure is a reflection of the underlying knowledge representation formalism. An analysis of candidate formalisms leads to the specification of a memory architecture for large knowledge bases. The particular problems of paging are studied, and a scheme for semantic caching is proposed. The design of a fast cache employing highly-parallel pattern-directed searching is described. The performance of this cache in a multi-level memory hierarchy is given.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. S. E. Fahlman, G. E. Hinton and T. J. Sejnowski, "Massively parallel architectures for AI: NETL, THISTLE, and Boltzmann machines". Proc. National Conference on Artificial Intelligence (AAAI-83), Washington 1983, pages 109–113.

    Google Scholar 

  2. S. Peyton Jones, "Using Futurebus in a fifth-generation computer". Microprocessors and Microsystems, Vol. 10, no. 2, March 1986, pages 69–76.

    Google Scholar 

  3. D. R. McGregor and J. R. Malone, "An integrated high performance, hardware assisted, intelligent database system for large-scale knowledge bases", Proc. first Workshop on Architecture for Large Knowledge Bases, Manchester, May 1984. (Published by the Alvey Directorate, Millbank Tower, London, SWIP 4QU).

    Google Scholar 

  4. Y. J. Jiang and S. H. Lavington, "The qualified binary relationship model of information". Proc. fourth British National Conference on Databases, published by Cambridge University Press, July 1985, pages 61–79.

    Google Scholar 

  5. K. Ramamohanarao and J. Shepherd, "A superimposed codeword indexing scheme for very large Prolog databases". Proc. 3rd Int. Conf. on Logic Programming, London, July 1986, pages 569–576. (Springer-Verlag).

    Google Scholar 

  6. I. Robinson, "A Prolog processor based on a pattern matching memory device". Proc 3rd Int. Conf. on Logic Programming, London, July 1986, pages 172–179. (Springer-Verlag).

    Google Scholar 

  7. H. Matsumoto, "A static analysis of Prolog programs". University of Edinburgh, AI Applications Institute, report AIAI/PSG24/85, January 1985.

    Google Scholar 

  8. M. D. Cripps, A. J. Field and M. J. Reeve, "The design and implementation of ALICE: a parallel graph reduction machine". In: Functional Programming Languages, Tools and Architecture, ed. S. Eisenbach. Ellis Horwood, 1986.

    Google Scholar 

  9. F. C. N. Pereira and D. H. D. Warren, "An efficient easily adaptable system for interpreting natural language queries". American Journal of Computational Linguistics, Vol. 3, No. 3–4, July/December 1982.

    Google Scholar 

  10. C. J. Rawlings, W. R. Taylor, J. Nyakairu, J. Fox and M. J. E. Sternberg, "Using Prolog to represent and reason about protein structure". Proc. 3rd Int. Conf. on Logic Programming, London, July 1986, pages 536–543. (Springer-Verlag).

    Google Scholar 

  11. N. Miyazaki, T. Kakuta, S. Shibayama, H. Yokota and K. Muirakami, "An overview of relational database machine Delta". ICOTT Technical Report TR-074, 1984. (Published by ICOT, Tokyo 108, Japan).

    Google Scholar 

  12. H. Schweppe, "Some comments on semantical disk cache management for knowledge base systems". ICOT Technical Report TR-040, 1984. (Published by ICOT, Tokyo 108, Japan).

    Google Scholar 

  13. M. Azmoodeh, S. H. Lavington and M. Standring, "The semantic binary relationship model of information". Proc. third joint BCS/ACM symposium on R. and D. in Information Retrieval. Published by Cambridge University Press, July 1984, pages 133–151.

    Google Scholar 

  14. W. D. Hillis, "The Connection Machine". MIT Press 1985.

    Google Scholar 

  15. G. E. Hinton, T. Sejnowski and D. Ackley, "Boltzmann Machines: constraint satisfaction networks that learn". Report TR-CMU-CS-84119, Carnegie Mellon University, 1984.

    Google Scholar 

  16. M. Standring, S. H. Lavington and G. B. Rubner, "A 4Mbyte associative predicate store". Proc. first Workshop on Architectures for Large Knowledge Bases, Manchester, May 1984. (Published by the Alvey Directorate, Millbank Tower, London, SWIP 4QU).

    Google Scholar 

  17. W. N. Chin, "Concurrency control strategies for a database machine". M.Sc. thesis, University of Manchester, October 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. W. de Bakker A. J. Nijman P. C. Treleaven

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lavington, S.H., Standring, M., Jiang, Y.J., Wang, C.J., Waite, M.E. (1987). Hardware memory management for large knowledge bases. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds) PARLE Parallel Architectures and Languages Europe. PARLE 1987. Lecture Notes in Computer Science, vol 258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17943-7_131

Download citation

  • DOI: https://doi.org/10.1007/3-540-17943-7_131

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17943-6

  • Online ISBN: 978-3-540-47144-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics