Comparing barrier algorithms

DOI10.1016/0167-8191(89)90050-1zbMath0689.68021OpenAlexW2038149966MaRDI QIDQ582051

Harry F. Jordan, Norbert S. Arenstorf

Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2060/19880003552

zbMATH Keywords

synchronizationparallel programmingconcurrent processesshared memorygraphical modelspeedupbarrier algorithmsMIMD computer

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Related Items (1)

Initializing memory shared by several processors

This page was built for publication: Comparing barrier algorithms