Correctness of a distributed-memory model for scheme

Moreau, Luc (1996) Correctness of a distributed-memory model for scheme At Second International Europar Conference (EURO-PAR'96). , pp. 615-624. (doi:10.1007/3-540-61626-8_82).


[img] PDF europar96 - Accepted Manuscript
Download (11MB)


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 (Paper)
Digital Object Identifier (DOI): doi:10.1007/3-540-61626-8_82
Additional Information: Address: Lyon, France
Venue - Dates: Second International Europar Conference (EURO-PAR'96), 1996-01-01
Organisations: Web & Internet Science
ePrint ID: 252769
Date :
Date Event
Date Deposited: 20 Mar 2000
Last Modified: 17 Apr 2017 23:29
Further Information:Google Scholar

Actions (login required)

View Item View Item