Skip to Main content Skip to Navigation

CONKER : un modèle de répartition pour processus communicants. Application à OCCAM

Abstract : This theisis proposes a model CONKER for distributed systems of communicating sequential processes (Hoare 's CSP). An application program will be structured in CONKER as a set of processes (processing objects) commmunicating throught a set of connectors (commun ication-synchronization objects).

Each connector implement a specific and possibly complex communication protocol between application processes which still use the CSP basic communication protocol (rendez-vous for input-output primitives). Therefore this basic protocol is used transparently to the connectors complex protocol. More over the connectors can realise a specific synchronisation control scheme between communicating processes (synchronous or asynchronous diffusion, cime constrained communication, total asynchrony, etc).

This transparency in CONKER allows to easy implement a distributed application on a multiprocessor or a heterogeneous network of different host machines. Our model also facilitates transportability and improve reliability. The connectors are strongly typed objects and for which an incremental construction is proposed.

An experimental implementation presented in the framework of a distributed robotic systems.
Complete list of metadatas
Contributor : Thèses Imag <>
Submitted on : Thursday, October 13, 2005 - 2:55:32 PM
Last modification on : Friday, November 6, 2020 - 3:58:29 AM
Long-term archiving on: : Friday, April 2, 2010 - 10:04:40 PM


  • HAL Id : tel-00010614, version 1




Michel Riveill. CONKER : un modèle de répartition pour processus communicants. Application à OCCAM. Réseaux et télécommunications [cs.NI]. Institut National Polytechnique de Grenoble - INPG, 1987. Français. ⟨tel-00010614⟩



Record views


Files downloads