• No results found

Separating computation and coordination in the design of parallel and distributed programs

N/A
N/A
Info
Downloaden
Protected

Academic year: 2021

Share "Separating computation and coordination in the design of parallel and distributed programs"

Copied!
3
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Download het nu ( 3 pagina )

Hele tekst

(1)

Separating computation and coordination in the design of parallel and

distributed programs

Chaudron, M.R.V.

Citation

Chaudron, M. R. V. (1998, May 28). Separating computation and coordination in the design of parallel and distributed programs. ASCI dissertation series. Retrieved from

https://hdl.handle.net/1887/26994

Version: Corrected Publisher’s Version

License: Licence agreement concerning inclusion of doctoral thesis in theInstitutional Repository of the University of Leiden Downloaded from: https://hdl.handle.net/1887/26994

(2)

Cover Page

The handle http://hdl.handle.net/1887/26994 holds various files of this Leiden University dissertation

Author: Chaudron, Michel

Title: Separating computation and coordination in the design of parallel and distributed programs

(3)

Curriculum Vitae

Michel Chaudron is geboren op 1 augustus 1969 te Leiden. In 1987 behaalde hij het VWO diploma aan het Rijnlands Lyceum te Wassenaar waarna hij Informatica ging studeren aan de Rijksuniversiteit te Leiden. In augustus 1988 behaalde hij het propaedeutisch examen.

De eerste helft van zijn vierde studiejaar (september 1990 - maart 1991) bracht hij door bij de Programming Research Group van de Universiteit van Oxford. Daar volg-de hij volg-de colleges van volg-de Master of Science cursus in Computation en werkte aan een tweetal research projecten op het gebied van formele methoden. Na zijn terugkomst in Nederland startte hij in september 1991 zijn afstudeerstage bij het (toenmalige) Instituut voor Toegepaste Informatica van TNO Delft. Tot maart 1992 werkte hij daar aan een afstudeerproject op het gebied van ontwerp en verificatie van parallelle algoritmes.

Van juni 1992 tot juni 1997 werkte hij als AIO aan het onderzoek waarvan de resul-taten zijn beschreven in dit proefschrift. Gedurende deze periode was hij van september 1994 tot en met december 1994 als visiting researcher op bezoek bij de Theory and For-mal Method Section van Imperial College in London. Naast zijn onderzoeksactiviteiten maakte Michel enkele jaren deel uit van de organisatie van het Graduate Network for Applied Research in Parallel Computing.

Sinds juni 1997 werkt hij bij een automatiseringsbedrijf.

Referenties

Download het nu ( PDF - 3 pagina - 159.67 KB )

GERELATEERDE DOCUMENTEN

Separating computation and coordination in the design of parallel and distributed programs

In this section we show that a most general schedule does not describe any behaviour that cannot be displayed by the corresponding Gamma program, we first consider this claim

Separating computation and coordination in the design of parallel and distributed programs

In general, statebased refinement is not preserved by parallel composition because the interaction of the refined components of the composition may give rise to behaviour that is

Separating computation and coordination in the design of parallel and distributed programs

In order use the generic theory of refinement to prove that the weak notions of refinement satisfy the properties proposed in previous sections, we need to check that the

Separating computation and coordination in the design of parallel and distributed programs

With this notion of refinement it is possible to justify refinements using properties of the multiset (just as statebased refinement) and use these in a modular way (because it is

Separating computation and coordination in the design of parallel and distributed programs

The Selection Sort schedule was derived using convex refinement laws. The first two re- finements were obtained by decomposing the domain of the index variables of the rewrite rule

Separating computation and coordination in the design of parallel and distributed programs

Initially, a calculus of refinement of action systems was based on weakest precondi- tions [4, 5]. Based on this notion of refinement a step-wise method for the development of

Separating computation and coordination in the design of parallel and distributed programs

In his thesis [79], De Jong expresses his ideas on how a computational model based on multiset transformations and a separate coordination model based on scheduling can be integrated

Separating computation and coordination in the design of parallel and distributed programs

License: Licence agreement concerning inclusion of doctoral thesis in the Institutional Repository of the University of Leiden Downloaded from: https://hdl.handle.net/1887/26994..