[prev] [up] [next]


Smalltalk allows multiple lightweight processes (also called threads or tasks) to execute pseudo concurrently. These run within the same address space (inside a single heavy weight operating system process) and can communicate via shared objects. Process scheduling is priority driven, with preemptive time slicing (multitasking) within each priority level. Scheduling is implemented fully in Smalltalk (i.e. all algorithms are open and can be changed if there is a need to do so).

Each process has its own automatically growing stack which is protected against overflow. No stack size definition is needed at process creation time - the system will allocate additional stack memory in reasonable small increments. The algorithm is a so called "segmented spaghetti stack", consisiting of chains of stack segments. Stack overflow is signalled as an exception and can be cought (see ``Exceptions and Signals'') and handled gracefully. It is even possible to restart or continue with more stack space after such an exception.

Also, multiple processes can be debugged simulatiously (using the symbolic Debugger) - even while executing concurrently. This means, that other processes continue to execute while other processes may be debugged.

The windowing interface makes use of processes, by executing each toplevel view's application in a separate process (the so called "Windowgroup Process". This means, that other windows are not locked up by one window being debugged or busy (which would be the case in pure event driven systems).

The interesting classes are:


Class Process represents a thread of control in Smalltalk. An arbitrary number (limited by memory) of processes can execute concurrently within the Smalltalk system. These processes (also called threads or lightweight processes) are not implemented as Unix/Windows processes, but instead are created, managed and scheduled by Smalltalk itself. They all run in within the same object (address-) space; therefore, the objects can be accessed by different processes. Processes are scheduled and preemted by the ProcessorScheduler.
Typical uses: Read ``Working with processes'' for detailed information on processes.

Details are found in the "Process class documentation".


Class ProcessorScheduler's sole instance (named Processor) is responsible for priority scheduling among running processes. In contrast to other Smalltalk and VM-based language implementations, scheduling is done completely at the Smalltalk language level. This allows for different schedulers to be implemented if required.

The basic scheduling is preemptive priority based. Preemptive means that a process may be suspended and resumed at any time as determined by the runnable state of higher priority processes. No cooperation (explicit yield) is required to be programmed into the code to give up control.

Time slicing (multi tasking) is done by a high-prio timeslicer process, which assigns time slots within a priority group in a round robin fashion. Thus, other processes within that priority group are able to make progress, even if a single process performs a long running operation.

Typical messages sent to Processor:

More details are found in the "ProcessorScheduler class documentation".

Semaphore and RecursionLock

Semaphores are used for process synchronization, nonBusy waits and mutual exclusion of processes from critical regions. A process can wait on a semaphore (and thereby be suspended from execution) until the semaphore is signalled (which resumes execution of the process).
Semaphores can also be installed for being signalled on I/O availability or timer expiration.

Notice that a critical region semaphore may be only only entered once, even if the aquiring process already owns it. This may lead to deadlocks or difficult coding style if your code is recursive or is entering the critical region in multiple places. For that, a so called RecursionLock is provided. This behaves like a Semaphore, except for the re-entering situation. It allows for the one process which already owns the lock, to reenter a critical region.

Typical use:

The I/O and timer messages are low level protocol; please use the protocol provided by Delay and ExternalStream for portability.
To wait for multiple events, use a SemaphoreSet.

More details are found in the "Semaphore" or "RecursionLock" class documentation.


Class Delay wraps the above timer based suspend into a portable interface.
Typical use:

More details are found in the "Delay class documentation".

Copyright 1996 Claus Gittinger Development & Consulting


Doc $Revision: 1.24 $ $Date: 2020/08/17 11:02:40 $