Experimenting Iterative Computations with Ordered Read-Write Locks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Experimenting Iterative Computations with Ordered Read-Write Locks

Pierre-Nicolas Clauss
  • Function : Author
  • PersonId : 843073
Jens Gustedt


This paper presents the first experimental results of the use of our new adaptive tool for synchronization, based on ordered read-write locks, ORWL. They provide a new synchronizing method for data-oriented parallel algorithms and are particularly suited for iterative pipelined algorithms with out-of-core data. We conducted experiments with the classic benchmarking Livermore Kernel~23 algorithm to validate the theoretical model and measure the efficiency of the first available implementation of ORWL in the parXXL library. They show that this tool is able to efficiently control an IO bound application running on 64 parallel POSIX threads with tight data dependencies between them.
Fichier principal
Vignette du fichier
RR-7123.pdf (338.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00436417 , version 1 (26-11-2009)



Pierre-Nicolas Clauss, Jens Gustedt. Experimenting Iterative Computations with Ordered Read-Write Locks. 18th Euromicro International Conference on Parallel, Distributed and network-based Processing, Feb 2010, Pisa, Italy. pp.155-162, ⟨10.1109/PDP.2010.11⟩. ⟨inria-00436417⟩
111 View
145 Download



Gmail Facebook Twitter LinkedIn More