Concurrency in Smalltalk

  • John Hunt


This chapter presents and explains a short example of how concurrency can be accomplished within Smalltalk. It also considers lazy evaluations (i.e. you only perform the evaluation if you absolutely have to), futures (you start an evaluation now which you will need later) and persistence.


Priority Queue Mutual Exclusion User Process Small Talk Lazy Evaluation 
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.

Copyright information

© Springer-Verlag London Limited 1997

Authors and Affiliations

  • John Hunt
    • 1
  1. 1.Computer Science DepartmentThe University of Wales, PenglaisAberystwyth, DyfedWales

Personalised recommendations