Iterative Computations with Ordered Read-Write Locks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Parallel and Distributed Computing Year : 2010

Iterative Computations with Ordered Read-Write Locks

Pierre-Nicolas Clauss
  • Function : Author
  • PersonId : 843073
Jens Gustedt
Connectez-vous pour contacter l'auteur

Abstract

We introduce the framework of ordered read-write locks, ORWL, that are characterized by two main features: a strict FIFO policy for access and the attribution of access to lock-handles instead of processes or threads. These two properties allow applications to have a controlled pro-active access to resources and thereby to achieve a high degree of asynchronicity between different tasks of the same application. For the case of iterative computations with many parallel tasks which access their resources in a cyclic pattern we provide a generic technique to implement them by means of ORWL. We show that the possible execution patterns for such a system correspond to a combinatorial lattice structure and that this lattice is finite iff the configuration contains a potential deadlock. In addition, we provide efficient algorithms: one that allows for a deadlock-free initialization of such a system and another one for the detection of deadlocks in an already initialized system.
Fichier principal
Vignette du fichier
RR-6685.pdf (228.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00330024 , version 1 (13-10-2008)

Identifiers

Cite

Pierre-Nicolas Clauss, Jens Gustedt. Iterative Computations with Ordered Read-Write Locks. Journal of Parallel and Distributed Computing, 2010, 70 (5), pp.496­-504. ⟨10.1016/j.jpdc.2009.09.002⟩. ⟨inria-00330024⟩
417 View
264 Download

Altmetric

Share

Gmail Facebook X LinkedIn More