Iterative computations with ordered read-write locks

DOI10.1016/J.JPDC.2009.09.002zbMath1233.68048OpenAlexW2010941736MaRDI QIDQ666107

Jens Gustedt, Pierre-Nicolas Clauss

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

iterative algorithmssynchronizationread-write locks

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (1)

Towards a full higher order AD-based continuation and bifurcation framework

Uses Software

• parXXL

Cites Work

• Unnamed Item
• Unnamed Item
• A framework for scalable greedy coloring on distributed-memory parallel computers
• Graph coloring on coarse grained multicomputers
• Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
• Atomic snapshots of shared memory
• Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS
• The lattice structure of chip firing games and related models

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