Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors

DOI10.1145/69624.357206zbMath0511.68012OpenAlexW2047434043MaRDI QIDQ4749188

Boris D. Lubachevsky, Allan Gottlieb, Larry Rudolph

Publication date: 1983

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/69624.357206

zbMATH Keywords

synchronizationparallel processingomega-networkoperating system primitivesreplace-addultracomputer

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (10)

Scalable and predictable performance for irregular problems using the WPRAM computational model ⋮ Solo-valency and the cost of coordination ⋮ An optimistic approach to lock-free FIFO queues ⋮ Linearizable counting networks ⋮ Using local-spin k -exclusion algorithms to improve wait-free object implementations ⋮ A scalable lock-free stack algorithm ⋮ The Fork95 programming language: Design, implementation, application. ⋮ Quicker Convergence for Iterative Numerical Solutions to Stochastic Problems: Probabilistic Interpretations, Ordering Heuristics, and Parallel Processing ⋮ An approach to automating the verification of compact parallel coordination programs. I ⋮ How to emulate shared memory

This page was built for publication: Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors