This paper introduces the application of an unconventional approach to Grid programming. The proposed programming model is based on the chemical metaphor for expressing coordination of large grain computations. A chemical program can be seen as a set of chemical reactions, representing computations, that transform a set of floating molecules, representing data, within a chemical solution until an inert solution is reached. This model is intrinsically parallel and possesses nice autonomic properties, which are expected for programming Grids. We illustrate this novel programming model with a simple ray-tracing application and describe an implementation in the context of Desktop Grids.

Gamma is a programming model in which computation can be seen as chemical reactions between data represented as molecules floating in a chemical solution. This model can be formalised as associative, commutative, conditional rewritings of multisets where rewrite rules and multisets represent chemical reactions and solutions, respectively. In this article we generalise the notion of multiset used by Gamma and present applications through various programming examples. First, multisets are generalised to include rewrite rules, which become first-class citizens. This extension is formalised by the -calculus with constants, operators, types and expressive patterns, we build a higher-order chemical programming language called HOCL. Finally, multisets are further generalised by allowing elements to have infinite and negative multiplicities. Semantics, implementation and applications of this extension are considered.

A discussion is given on a programming language based approach to information flow control in a system of communicating processes. The approach differs from previous work in that the security level approach to controlling flows is replaced by a mechanism where flows are registered in terms of the set of variable signaling information and that the manner of registering the inter-process information flows does not require any extra message exchanges. The language chosen to present these ideas is Hoare's CSP. The authors give the 'security semantics' of CSP and show, with the aid of two examples, how these semantics can be used to conduct security proofs of parallel programs.>

The authors address the problem of implementing the CSP (communicating sequential processes) rendezvous within a transactional framework. Instead of implementing a fair nondeterministic choice and assuming the correct functioning of processors and communication media, the authors propose an efficient transactional implementation of the atomic rendezvous in the presence of processor failures in a multiprocessor machine. Both atomicity and efficiency are obtained by using high-speed stable storage devices.>

An active, RAM-based stable storage board is described. The stable storage board is intended to make it relatively fast to access data structures, and contains features to guard against incorrect access from a faulty processor or from an errant program. Basic performance data are presented and potential applications are described.>

A systolic algorithm for connected word recognition (CWR) using dynamic time warping (DTW)Qtechnique is described. The algorithm relies upon an iterative method for finding the sequence of connected words that minimizes DTW distance to a given utterance. This method allows simultaneous computation of the best connected word sequence regardless of its number of words. A parallel implementation of the method is also proposed. Basically it uses a linear network of identical very simple processors. It is also explained how this network may be connected to a recently proposed DTW net-word implementing DTW algorithm. The machine resulting from this interconnection constitutes a highly parallel connected word recognition device. Such a device has a regular structure involving only local communication between very simple processors. This suggests a VLSI implementation of the device. This issue is also discussed.

article Free Access Share on A Multiprocessing Approach to Compile-Time Symbol Resolution Authors: F. André Institut de recherche en informatique et systèmes aléatoires (IRISA), Campus de Beaulieu, Avenue du General Leclerc, 35042--Rennes Cédex, France Institut de recherche en informatique et systèmes aléatoires (IRISA), Campus de Beaulieu, Avenue du General Leclerc, 35042--Rennes Cédex, FranceView Profile , J. P. Banatre Institut de recherche en informatique et systèmes aléatoires (IRISA), Campus de Beaulieu, Avenue du General Leclerc, 35042--Rennes Cédex, France Institut de recherche en informatique et systèmes aléatoires (IRISA), Campus de Beaulieu, Avenue du General Leclerc, 35042--Rennes Cédex, FranceView Profile , J. P. Routeau Institut de recherche en informatique et systèmes aléatoires (IRISA), Campus de Beaulieu, Avenue du General Leclerc, 35042--Rennes Cédex, France Institut de recherche en informatique et systèmes aléatoires (IRISA), Campus de Beaulieu, Avenue du General Leclerc, 35042--Rennes Cédex, FranceView Profile Authors Info & Claims ACM Transactions on Programming Languages and SystemsVolume 3Issue 1Jan. 1981 pp 11–23https://doi.org/10.1145/357121.357123Online:01 January 1981Publication History 4citation215DownloadsMetricsTotal Citations4Total Downloads215Last 12 Months4Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

The project KENSUR aiming in breaking down a compiler into a set of concurrent processes and in having them executed onto a network of processors is currently developed at I.R.I.S.A.

Basic error recovery problems between interacting processes are first discussed and the desirability of having separate recovery mechanisms for cooperation and competition is demonstrated. The paper then concentrates on recovery mechanisms for processes competing for the use of the shared resources of a computer system. Appropriate programming language features are developed based on the class and inner features of SIMULA, and on the structuring concepts of recovery blocks and monitors.