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

barrier algorithmsconcurrent processesgraphical modelMIMD computerparallel programmingshared memoryspeedupsynchronization

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
• Barrier trees for search analysis

Cited in

(13)

• Synchronization costs on multiprocessors
• A network model of Barrier synchronization algorithms
• Vector barrier certificates and comparison systems
• Deadlock and WCET analysis of barrier-synchronized concurrent programs
• On automation in the verification of software barriers: experience report
• First-class synchronization barriers
• Busy-wait barrier synchronization using distributed counters with local sensor
• A fast barrier synchronization protocol for broadcast networks based on a dynamic access control
• Quantitative and algorithmic aspects of barrier synchronization in concurrency
• Two-phase barrier: A synchronization primitive for improving the processor utilization
• The Combinatorics of Barrier Synchronization
• Noncommittal barrier synchronization
• 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)