Experience with CST: programming and implementation
- 21 June 1989
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 24 (7), 101-109
- https://doi.org/10.1145/73141.74827
Abstract
CST is a programming language based on Smalltalk-802 that supports concurrency using locks, asynchronous messages, and distributed objects. In this paper, we describe CST: the language and its implementation. Example programs and initial programming experience with CST are described. Our implementation of CST generates native code for the J-machine, a fine-grained concurrent computer. Some compiler optimizations developed in conjunction with that implementation are also described.Keywords
This publication has 5 references indexed in Scilit:
- Finite-grain message passing concurrent computersPublished by Association for Computing Machinery (ACM) ,1988
- Architecture of a message-driven processorPublished by Association for Computing Machinery (ACM) ,1987
- A VLSI Architecture for Concurrent Data StructuresPublished by Springer Nature ,1987
- Parallel Symbolic ComputingComputer, 1986
- ActorsPublished by MIT Press ,1986