Comparing barrier algorithms

DOI10.1016/0167-8191(89)90050-1MaRDI QIDQ582051zbMATH OpenOpenAlexFDO

Authors Norbert S. Arenstorf, Harry F. Jordan

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

graphical modelsynchronizationparallel programmingshared memoryconcurrent processesspeedupbarrier algorithmsMIMD computer

Mathematics Subject Classification ID

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

Recommendations

• Comparing algorithms based on marginal problem
• Algorithm of Barrier Objective Penalty Function
• Two algorithms for barrier synchronization
• Approximation Algorithms for Barrier Sweep Coverage
• Comparison of optimization algorithms
• Barriers for rank methods in arithmetic complexity
• scientific article; zbMATH DE number 2040684

Cited in

(10)

• The Combinatorics of Barrier Synchronization
• Vector barrier certificates and comparison systems
• scientific article; zbMATH DE number 2030013 (Why is no real title available?)
• Synchronization costs on multiprocessors
• scientific article; zbMATH DE number 2090669 (Why is no real title available?)
• Deadlock and WCET analysis of barrier-synchronized concurrent programs
• On automation in the verification of software barriers: experience report
• First-class synchronization barriers
• Two-phase barrier: A synchronization primitive for improving the processor utilization
• Initializing memory shared by several processors

This page was built for publication: Comparing barrier algorithms

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