A Fine-Grained Concurrent Completion Procedure - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1996

A Fine-Grained Concurrent Completion Procedure

Christopher Lynch
  • Function : Author
Christelle Scharff
  • Function : Author
  • PersonId : 756535
  • IdRef : 15792808X


We present a concurrent Completion procedure based on the use of a SOUR graph as data structure. The procedure has the following characteristics. It is asynchronous, there is no need for a global memory or global control, equations are stored in a SOUR graph with maximal structure sharing, and each vertex is a process, representing a term. Therefore, the parallelism is at the term level. Each edge is a communication link, representing a (subterm, ordering, unification or rewrite) relation between terms. Completion is performed on the graph as local graph transformations by cooperation between processes. We show that this concurrent Completion procedure is sound and complete with respect to the sequential one, provided that the information is locally time stamped in order to detect out of date information.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2990.pdf (490.08 Ko) Télécharger le fichier

Dates and versions

inria-00073707 , version 1 (24-05-2006)


  • HAL Id : inria-00073707 , version 1


Claude Kirchner, Christopher Lynch, Christelle Scharff. A Fine-Grained Concurrent Completion Procedure. [Research Report] RR-2990, INRIA. 1996, pp.56. ⟨inria-00073707⟩
195 View
130 Download


Gmail Facebook Twitter LinkedIn More