Implementation of CSP-S for description of distributed algorithms

Patnaik, L. M. ; Badrinath, B. R. (1984) Implementation of CSP-S for description of distributed algorithms Computer Languages, 9 (3-4). pp. 193-202. ISSN 0096-0551

Full text not available from this repository.

Official URL: http://www.sciencedirect.com/science/article/pii/0...

Related URL: http://dx.doi.org/10.1016/0096-0551(84)90005-5

Abstract

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:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:70155
Deposited On:18 Nov 2011 12:04
Last Modified:18 Nov 2011 12:04

Repository Staff Only: item control page