Associative Processing of Non-Numerical Information

  • R. M. Lea
Conference paper
Part of the NATO Advanced Study Institutes Series book series (ASIC, volume 32)


A common misconception is that associative processing is a special mode of computation which can only be achieved at high expense with complex hardware components. Consequently, it is often maintained that associative processing can only be justified in certain dedicated computer applications for which conventional computer hardware is cost-ineffective. In truth, associative processing is a natural form of information processing and its features are independent of the machine on which it is implemented. Moreover, computer systems supporting the storage, retrieval and processing of non-numerical information are inevitably associative processing systems, whether or not this was intended by their designers. To understand this, perhaps controversial, contention it is helpful to reflect on the nature of information itself.


Associative Processing Inverted List Storage Allocation Hierarchic Data Structure Simple Data Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    C.T.Meadow, ‘The analysis of information systems — a programmers introduction to information retrieval’, Wiley, 1967.Google Scholar
  2. 2.
    H.Hellerman, ‘Digital computer system principles’, McGraw-Hill, 1967, pp. 134–159.Google Scholar
  3. 3.
    D. Lefkovitz, ‘File strucutres for on-line systems’, Spartan Books (New York), 1969.Google Scholar
  4. 4.
    C.W.Gear, ‘Computer orgnization and programming’, McGraw-Hill, 1974, pp. 376–409.Google Scholar
  5. 5.
    M.F.Lynch, ‘Computer-based information services in science and technology — principles and techniques’, Peter Peregrinus, 1974.Google Scholar
  6. 6.
    L.R.Johnson, ‘An indirect chaining method for addressing on secondary keys’. Coram. ACM, pp. 218–222, May 1961.Google Scholar
  7. 7.
    S.H.Unger, ‘A computer oriented toward spatial problems’, Proc. WJCC, pp. 234–239, 1958.Google Scholar
  8. 8.
    E.S. Schwartz, ‘Large parallel computers’, J. ACM, 13, 1, pp. 25–31, 1966.MATHCrossRefGoogle Scholar
  9. 9.
    L.J. Koczela, ‘The distributed processor organization’, Advances in Computers, 9, pp. 285–353, 1968.MATHCrossRefGoogle Scholar
  10. 10.
    D.L.Slotnick, W.C. Borck, R.C. McReynolds, ‘The Soloman computer’, Proc. AFIPS, (FJCC), pp. 97–107, 1962.Google Scholar
  11. 11.
    G.H.Barnes, R.M.Brown, M.Kato, D.J.Kuck, D.L.Slotnick, R.A.Stokes, ‘The Illiac IV computer’. Trans. IEEE, C-17, pp. 746–757, 1968.Google Scholar
  12. 12.
    S.F.Reddaway, ‘DAP — A distributed array processor’, Proc. 1st Annual Symposium on Computer Architecture, Florida, pp. 61–65, 1973.Google Scholar
  13. 13.
    R.M. Lea, ‘Information processing with an associative parallel processor’, Computer, 8, pp. 25–32, Nov. 1975.CrossRefGoogle Scholar
  14. 14.
    M.H. Lewin, ‘Retrieval of ordered lists from a content- addressed memory’, RCA Review, 23, pp. 215–229, 1962.Google Scholar
  15. 15.
    R.M. Lea, ‘Toward a low-cost cell design for high-speed MOS associative memories’, Datafair Research Papers, 11, pp. 418–424, 1973.Google Scholar
  16. 16.
    A.E. Hanlon, ‘Content addressable and associative memory systems - a survey’, IEEE - TC, EC-15, pp. 509–521, 1966.Google Scholar
  17. 17.
    J. Minker, ‘An overview of associative or content- addressable memory systems and a KWIC index to the literature 1956-1970’, Computing Reviews, 12, pp. 453–504, Oct. 1971.Google Scholar
  18. 18.
    B. Parhami, ‘Associative manories and processors - an overview and selected bibliography’, Proc. IEEE, 61, pp. 722–730, June 1973.CrossRefGoogle Scholar
  19. 19.
    R.G. Ewing, P.M.Davies, ‘An associative processor’, Proc. AFIPS (FJCC), 26, pp. 147–158, 1964.Google Scholar
  20. 20.
    R.H. Fuller, ‘Associative parallel processing’, Proc. AFIPS (SJCC) 30, pp. 471–475, 1967.Google Scholar
  21. 21.
    J.D. Feldman, L.C.Fulmer, ‘RADCAP — An operational parallel processing facility’, Proc. AFIPS (NCC), 43, pp. 7–15, 1974.Google Scholar
  22. 22.
    K.J. Thurber, R.O.Berg, ‘Applications of associative processors’. Computer Design, pp. 103–110, Nov. 1971.Google Scholar
  23. 23.
    J.A. Rudolph, L.C.Fulmer, W.C.Meilander, ‘With associative memory, speed limit is no barrier’, Electronics, pp. 96–101, 22 June 1970.Google Scholar
  24. 24.
    J.A. Rudolph, L.C.Fulmer, W.C.Meilander, ‘The coming of age of the associative processor’. Electronics, pp. 91–96, 15 February 1971.Google Scholar
  25. 25.
    J.A. Rudolph, ‘A production implementation of an associative array processor — STARAN’, Proc.AFIPS (FJCC), pp. 229, 241, 1972.Google Scholar
  26. 26.
    K.E. Batcher, ‘STARAN parallel processor system hardware’, Proc. AFIPS (NCC), 43, pp. 405–410, 1974.Google Scholar
  27. 27.
    K.E. Batcher, ‘STARAN/RADCAP hardware architecture’, Proc. 1973 Sagamore Computer Conf. on Parallel Processing, pp. 147–152, 1973.Google Scholar
  28. 28.
    E.W. Davis, ‘STARAN parallel processor system software’, Proc. AFIPS (NCC), 43, pp. 17–22, 1974.Google Scholar
  29. 29.
    R.M. Lea, ‘A design for a high speed MOS associative memory’, Electronics Letters, 8, pp.391–393, 27 July 1972.Google Scholar
  30. 30.
    C.J. Shead, ‘The associative memory — a versatile circuit element’, GEC J. of Science and Technology, 40, pp.119–125, No. 3, 1973.Google Scholar
  31. 31.
    R.M. Lea, ‘The cost of associative memory’, Brunel University Tech.Memo. CE/SR/031, Aug.1975.Google Scholar
  32. 32.
    R.M. Lea, ‘A design for a low-cost high-speed MOS associative memory’. The Radio and Electronic Engineer, 45, 6, pp. 177–182, Apr.1975.CrossRefGoogle Scholar
  33. 33.
    R.M.Lea, ‘Low-cost high-speed associative memory’, IEEE J. of Solid-State Circuits, SC-10, 3, pp. 179–181, June 1975.CrossRefGoogle Scholar
  34. 34.
    R.M. Lea, ‘A NAND-gate implementation for high-speed associative memory’. Digital Processes, 2, 1, pp. 83–88, Spring 1976.Google Scholar
  35. 35.
    C.R. DeFiore, A.A.Vito, L.Bauer, ‘Toward the development of a higher order language for RADCAP’, Proc. of the 1972 Sagamore Computer Conf., pp. 99–112, 1972.Google Scholar
  36. 36.
    R.R. Linde, R.Gates, T.Peng, ‘Associative processor applications to real-time data management’, Proc. AFIPS (NCC), 42, pp. 187–195, 1973.Google Scholar
  37. 37.
    W.W. Patterson, ‘Some thoughts on associative processing languages’, Proc. AFIPS (NCC), 43, pp. 23–26, 1974.Google Scholar
  38. 38.
    H.K. Resnick, A.G.Larson, ‘DMAP — A COBOL extension for associative array processors’, SIGPLAN Notices, 10, 3, pp. 54–61, 1965.CrossRefGoogle Scholar
  39. 39.
    G.G. Dodd, ‘APL — A language for associative data handling in PL/I’, Proc. AFIPS (FJCC), 29 pp. 677–694, 1966.Google Scholar
  40. 40.
    R.Moulder, ‘An implementation of a data management system on an associative processor’, Proc. AFIPS (MCC), 42, pp. 171–176, 1973.Google Scholar
  41. 41.
    R.R.Seeber, ‘Symbol manipulation with an associative memory’, Proc. 16th National ACM Meeting, P. 5, Sept. 1961.Google Scholar
  42. 42.
    N.V.Findler, ‘On a computer language which simulates associative memory and parallel processing’, Cybernetica, X, pp. 229–254, 1967.Google Scholar
  43. 43.
    N.V.Findler, W.R.McKenzie, ‘On a new tool in artificial intelligence research: associative memory, parallel processing language ANPPL-11’, Proc. Int. Joint Conf. on Artificial Intelligence, pp. 259–270, May 1969.Google Scholar
  44. 44.
    B.A.Savitt, H.H.Love, R.E.Troop, ‘ASP — a new concept in language and machine organization’, Proc. AFIPS (SJCC), 30, pp. 87–102, 1967.Google Scholar
  45. 45.
    J.A.Feldman, ‘Aspects of associative processing’, MIT Lincoln Labs., Tech.Note, 1965 - 13, 1965.Google Scholar
  46. 46.
    J.A.Feldman, P.D.Rovner, ‘An ALGOL-based associative language’. Comm. ACM, 12, pp. 439–449, 1969.MATHCrossRefGoogle Scholar
  47. 47.
    W.L.Ash, F.H.Sibley, ‘TRAMP: An interpretive associative processor with deductive capabilities’, Proc. ACM 23rd MAT. Conf. Nevada 1968, pp. 143–156, 1968.Google Scholar
  48. 48.
    M.V.Wilkes, ‘Associative tabular data structures’, Int. J. Comput. and Inf. Sci., 1, 3, pp. 225–233, Sept.1972.MATHCrossRefGoogle Scholar
  49. 49.
    M.V.Wilkes, W.D.Manville, ‘The associative language AL-1’, Int. J. Comput. and Inf. Sci., 1, 4, pp. 315–327, Dec.1972.MATHCrossRefGoogle Scholar
  50. 50.
    M.J.Harrison, W.H.Harrison, ‘The implementation of APL on an associative processor’, Proc. of the 1974 Sagamore Computer Conf., pp. 75–96, 1974.Google Scholar
  51. 51.
    C.Y.Lee, ‘Intercommunicating cells - basis for a distributed logic computer’, Proc. AFIPS (FJCC), 22, pp. 130–136, Dec.1962.Google Scholar
  52. 52.
    C.Y.Lee, M.C.Paull, ‘A content addressable distributed logic memory with applications to information retrieval’, Proc. IEEE, 51, pp. 924–932, June 1963.CrossRefGoogle Scholar
  53. 53.
    R.S.Gaines, C.Y.Lee, ‘An improved cell memory’, IEEE Trans., EC-14, pp. 72–75, 1965.Google Scholar
  54. 54.
    K.N.Levitt, W.H.Kautz, ‘Cellular Arrays for the solution of graph problems’, Commun. ACM, 15, 9, pp. 789–801, Sept. 1972.MATHCrossRefGoogle Scholar
  55. 55.
    J.N.Sturman, ‘An iteratively structured general purpose digital computer’, IEEE Trans. EC-17, pp. 2–9, 1968.Google Scholar
  56. 56.
    A.P.Kisylia, ‘An associative processor for information retrieval’, Co-ordinated Science Lab. (Illinois University), Report R-390 (AD 675310), Aug.1968.Google Scholar
  57. 57.
    G.J.Lipovski, ‘The architecture of a large associative processor’, Proc. AFIPS (SJCC), 36, pp. 385–396, 1970.Google Scholar
  58. 58.
    G.J.Lipovski, ‘On data structures in associative memories’, SIGPLAN Notices, 6, 2, pp. 346–365, 1971.CrossRefGoogle Scholar
  59. 59.
    G.J.Lipovski, ‘Data structures on content addressed cellular memories’, Int. J. Comput. and Inf. Sci., 1, 4, pp. 329–353, Dec.1972.MATHCrossRefGoogle Scholar
  60. 60.
    J.S.Wright, D.W.Lewin, ‘A draft specification for a symbol processor’, IEE Conf. Computer Science and Technology (IEE Pub. No. 55 ), pp. 282–295, 1969.Google Scholar
  61. 61.
    D.W.Lewin, ‘A technology independent information processing machine’, The New Technologies: INFOTECH - Int. Conf. State-of-the-art Report No. 5, pp. 233–251, 1971.Google Scholar
  62. 62.
    P.A.Beaven, D.W.Lewin, ‘An associative parallel processing system for non-numerical computation’, The Computer Journal, 15, 4, pp. 343–349, 1973.CrossRefGoogle Scholar
  63. 63.
    R.M.Lea, ‘An associative parallel processing system for the memory structure of a symbol processing machine’, Brunel University, Tech.Memo. No. C/SP/014, 1972.Google Scholar
  64. 64.
    R.M.Lea, J.S.Wright, ‘A novel memory concept for information processing’. Datafair Research Papers, 11, pp. 413–417, 1973.Google Scholar
  65. 65.
    R.M.Lea, ‘Micro-APP: A building block for low-cost high-speed associative parallel processors’, Brunel University Tech.Memo. No. CE/R/0 34, Jan.1976.Google Scholar
  66. 66.
    R.K.Donnelly, ‘List processing using an associative processor’, Brunel University Tech.Memo. No. C/R/040 March 1976.Google Scholar
  67. 67.
    G.F.Coulouris, J.M.Evans, R.W.Mitchell, ‘Towards content- addressing in data bases’, The Computer Journal, 15, 2, pp. 95–98, May 1972.MATHGoogle Scholar
  68. 68.
    R.W.Mitchell, ‘New hardware for information systems’, Conf. on Computer Systems and Technology, pp. 11–18, Oct.1972.Google Scholar
  69. 69.
    B.Parhami, ‘A highly parallel computer system for information retrieval’, Proc. AFIPS (FJCC), 41, pp. 681–690, 1972.Google Scholar
  70. 70.
    D.L.Slotnick, ‘Logic per track devices’. Advances in Computers, 10, pp. 291–296, 1970.CrossRefGoogle Scholar
  71. 71.
    L.D.Heaty, G.J.Lipovski, K.L.Doty, ‘The architecture of a context addressed segment-sequential storage’, Proc. AFIPS 9FJCC), 41, pp. 691–701, 1972.Google Scholar
  72. 72.
    E.A.Ozkarahan, S.A.Schuster, K.C.Smith, ‘RAP - An associative processor for data base management’, Proc.AFIPS (NCC), 44, pp.379–387 - 1975.Google Scholar
  73. 73.
    S.Y.W.Su, G.P.Copeland, G.J.Lipovski, ‘Retrieval operations and data representations in a context-addressed disc system’, SIGPLAN Notices, 10, 1, pp. 144–153, Jan.1975.CrossRefGoogle Scholar
  74. 74.
    H.H.Love, ‘An efficient associative processor using bulk storage’, Proc. 1973 Sagamore Comp. Conf. on Parallel Processing, pp. 103–112, 1973.Google Scholar
  75. 75.
    R.M.Lea, ‘An associative parallel processor for efficient and flexible file-searching’. International Symposium on Technology for SDI, San Marino, Sept.1976.Google Scholar
  76. 76.
    J.G.Dyke, R.M.Lea, ‘An associative parallel processor for local editing applications’. Digital Processes, 1, pp. 89–101, 1975.MATHGoogle Scholar
  77. 77.
    R.M.Lea, ‘Text compression with an associative parallel processor’, Brunel University Tech.Memo No. C/R/o38, March 1976.Google Scholar
  78. 78.
    C.R.DeFiore, N.J.Stillman, P.B.Berra, ‘Associative Techniques in the solution of data management problems’, Proc. ACM Annual Conf., 1971, pp. 28–36, 1971.Google Scholar
  79. 79.
    C.R.DeFiore, P.B.Berra, ‘A data management system utilizing an associative memory’, Proc. AFIPS (NCC), 42, pp. 181–185, 1973.Google Scholar
  80. 80.
    C.R.DeFiore, P.B.Berra, ‘A quantitative analysis of the utilization of associative memories in data management’, IEEE Trans. Comp., C-23, 2, pp. 121–133, Feb.1974.CrossRefGoogle Scholar

Copyright information

© D. Reidel Publishing Company, Dordrecht-Holland 1977

Authors and Affiliations

  • R. M. Lea
    • 1
  1. 1.Brunel UniversityUK

Personalised recommendations