Skip to Main content Skip to Navigation
Conference papers

Experimenting Iterative Computations with Ordered Read-Write Locks

Pierre-Nicolas Clauss 1 Jens Gustedt 1
1 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/inria-00436417
Contributor : Jens Gustedt <>
Submitted on : Thursday, November 26, 2009 - 4:37:17 PM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM
Long-term archiving on: : Tuesday, October 16, 2012 - 2:56:31 PM

File

RR-7123.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

343

Files downloads

571