Initializing memory shared by several processors

DOI10.1007/BF01407858MaRDI QIDQ915433zbMATH OpenFDO

Authors David Hemmendinger

Publication date 1989

Published in International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01407858

zbMATH Keywords

atomic instructionsbarrier algorithmLamport's concurrent programming problemmultiprocessor systemshared memorysynchronization

Mathematics Subject Classification ID

Theory of operating systems (68N25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Two algorithms for barrier synchronization
• An \(O(1)\) RMRs leader election algorithm
• An \(O(1)\) RMRs leader election algorithm
• Atomic snapshots of shared memory
• Optimal Time–Space Tradeoff for Shared Memory Leader Election

Cites work

• Comparing barrier algorithms
• Myths about the mutual exclusion problem
• The butterfly barrier
• Two algorithms for barrier synchronization

This page was built for publication: Initializing memory shared by several processors

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