Correctness of a Distributed-Memory Model for Scheme
Moreau, Luc (1996) Correctness of a Distributed-Memory Model for Scheme. Second International Europar Conference (EURO-PAR'96) Springer-Verlag, 615-624.
Download
Full text not available from this repository.
Description/Abstract
We propose a high-level approach to program distributed applications; it is based on the annotation future by which the programmer specifies which expressions may be evaluated remotely in parallel. We present the CEKDS-Machine, an abstract machine with a distributed memory, able to evaluate Scheme-like future-based programs. In this paper, we focus on the issue of task migration and prove that task migration is transparent to the user, i.e. task migration does not change the observable behaviour of programs.
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Additional Information: | Address: Lyon, France |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Web & Internet Science |
| Item ID: | 252769 |
| Date Deposited: | 20 Mar 2000 |
| Last Modified: | 01 Mar 2012 10:32 |
| Contributors: | Moreau, Luc (Author) |
| Date: | 1996 |
| Additional Information: | Address: Lyon, France |
| Status: | Published |
| Publisher: | Springer-Verlag |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/252769 |
Actions (login required)
 |
View Item |
