The Bath Concurrent LISP machine

  • Jed Marti
  • John Fitch
Systems And Language Features
Part of the Lecture Notes in Computer Science book series (LNCS, volume 162)


The Bath Concurrent LISP machine is a general purpose multiprocessor designed for research in symbolic computation and expert systems. The system is particularly suited to tree structured computations with dynamic data requirements and complex interactions. It accepts conventional LISP programs, performs a data flow analysis on them, and creates a compiled module in which available concurrency is exploited. This paper presents an overview of the system hardware and software and the directions in which research is proceeding.


Task Schedule Memory Window Path Expression Garbage Collector Interprocessor Communication 
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.

List of References

  1. 1.
    Bowyer, A., Willis, P., Woodwark, J., ‘A multiprocessor architecture for solving spatial problems'. The Computer Journal, 24, No. 4, 1981, pp353–357.Google Scholar
  2. 2.
    Fitch, J. P., Marti, J. ‘NLARGEing a Z80 microprocessor'. Proceedings of EUROCAM 1982 in Lecture Notes in Computer Science 144, ‘Computer Algebra'. J. Calmet editor, Springer-Verlag, pp249–255, 1982.Google Scholar
  3. 3.
    Fitch, J. P., Norman, A. C., ‘Implementing LISP in a high-level language', Software-Practice and Experience. 7, pp713–725, 1977.Google Scholar
  4. 4.
    Hanson, J. B., Willis, P. J., ‘A graphics art computer system', Proceedings of Electronics Displays, 1982.Google Scholar
  5. 5.
    Hearn, A. C., Griss, M. L., ‘The portable LISP compiler', Software-Practice and Experience. 11, pp541–605, 1981.Google Scholar
  6. 6.
    Hewitt, C. ‘The Apiary network architecture for knowledgeable systems'. Proceedings of the 1980 LISP Conference, pp107–117.Google Scholar
  7. 7.
    Lindstrom, G., Soffa, M. L., ‘Referencing and retention in block-structured coroutines'. TOPLAS. 3, No. 3, July 1981.Google Scholar
  8. 8.
    Marti, J., ‘A concurrent processing system for LISP', Thesis. Department of Computer Science, University of Utah, 1980.Google Scholar
  9. 9.
    Marti, J., ‘Compilation techniques for a control-flow concurrent LISP system', Proceedings of the 1980 LISP Conference, pp203–207.Google Scholar
  10. 10.
    Marti, J., ‘An interprocedural data flow analysis for LISP', in preparation.Google Scholar
  11. 11.
    Richards, M., Aylword, A., Bond, P., Evans, R., Knight, B., ‘TRIPOS — A Portable Operating System for Mini-computers'. Software Practice and Experience, 9, pp513–526, 1979.Google Scholar
  12. 12.
    Tarjan, R. E., ‘Fast algorithms for solving path expression', Journal of the ACM, 28, No. 3, pp594–614, July 1981.Google Scholar
  13. 13.
    Willis, P., Milford, D., Woodwark, J., ‘Exploiting area coherence in raster scan displays'. Proc. Elec. Displays 1981, 3, pp34–46, 1981.Google Scholar
  14. 14.
    Willis, P. J., ‘An implementation of a token ring', Proceedings of the 6th International Conference on Computer Communications, pp149–153, 1982.Google Scholar
  15. 15.
    Woodward, M., et al. ‘A measure of control flow complexity in program text', IEEE Transactions on Software Engineering. SE-5-1, pp45–50, January 1979.Google Scholar
  16. 16.
    Bakti, Z., In preparation.Google Scholar

Copyright information

© Springer-Verlag 1983

Authors and Affiliations

  • Jed Marti
    • 1
  • John Fitch
    • 1
  1. 1.School of MathematicsUniversity of BathEngland

Personalised recommendations