Patnaik, LM and Badrinath, BR (1984) Implementation of CSP-S for description of distributed algorithms. In: Computer Languages, 9 (3-4). pp. 193-202.Full text not available from this repository. (Request a copy)
The implementation of CSP-S (a subset of CSP)—a high level language for distributed programming—is presented in this paper. The language CSP-S features a parallel command, communication by message passing and the use of guarded command. The implementation consists of a compiler translating the CSP-S constructs into intermediate language. The execution is carried out by a scheduler which creates an illusion of concurrency. Using the CSP-S language constructs, distributed algorithms are written, executed and tested with the compiler designed.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier Science.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||17 Aug 2009 08:52|
|Last Modified:||17 Aug 2009 08:52|
Actions (login required)