Object-oriented concurrent programming in CST

Abstract

CST is a programming language based on Smalltalkthat supports concurrency using locks, asynchronous messages, and distributed objects. Distributed objects have their state distributed across many nodes of a machine, but are referred to by a single name. Distributed objects are capable of processing many messages simultaneously and can be used to efficiently connect together large collections of objects. They can be used to construct a number of useful abstractions for concurrency. This paper describes the CST language, gives examples of its use, and discusses an initial implementation.

Scalable Concurrent B-Trees Using Multi-Version Memory

“…On a distributed-memory architecture, such as the J-machine [19] or the CM-5 [52], we might instead maintain in software a fixed number of copies on different processors, which serve to spread out the load and reduce contention. Dally's ''distributed objects'' [18] or Chien's ''concurrent aggregates'' [14,13] might be useful substrates for implementing a multi-version memory on a distributed-memory machine.…”

A Concurrent Smalltalk Compiler for the Message-Driven Processor

“…There is a function in the Statement Analyzer and Optimizer, output-stmtgraph, available to do this conversion; the function is useful for the purposes of debugging as well as using the Statement Analyzer and Optimizer to optimize ICode that will be run on Andrew's simulator [7].…”