Iterative computations with ordered read-write locks

DOI10.1016/J.JPDC.2009.09.002MaRDI QIDQ666107zbMATH OpenOpenAlexFDO

Authors Pierre-Nicolas Clauss, Jens Gustedt

Publication date 7 March 2012

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2009.09.002

zbMATH Keywords

synchronizationiterative algorithmsread-write locks

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Randomized registers and iterative algorithms
• Some aspects of parallel and distributed iterative algorithms - a survey
• On asynchronous iterations
• On the Complexity of Reader-Writer Locks
• Relations between Concurrent-Write Models of Parallel Computation

Cites work

• scientific article; zbMATH DE number 733664 (Why is no real title available?)
• A framework for scalable greedy coloring on distributed-memory parallel computers
• Atomic snapshots of shared memory
• Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
• Graph coloring on coarse grained multicomputers
• PRO: a model for the design and analysis of efficient and scalable parallel algorithms
• The lattice structure of chip firing games and related models
• Time-optimal, space-efficient single-scanner snapshots \& multi-scanner snapshots using CAS

Cited in

(2)

• Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks
• Towards a full higher order AD-based continuation and bifurcation framework

Describes a project that uses

Uses Software

• parXXL

This page was built for publication: Iterative computations with ordered read-write locks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666107)